A. Lingas

collaborators

2 papers

cs.DS2026

Finding Small Complete Subgraphs Efficiently

Ke Chen, Adrian Dumitrescu, Andrzej Lingas

(I) We revisit the algorithmic problem of finding all triangles in a graph $G = (V, E)$ with $n$ vertices and $m$ edges. According to a result of Chiba and Nishizeki (1985), this task…

cs.DS2024

Perpetual maintenance of machines with different urgency requirements

Leszek GÄ sieniec, Tomasz JurdziÅski, Ralf Klasing +4

A garden $G$ is populated by $n \geq 1$ bamboos $b_{1}, b_{2}, ..., b_{n}$ with the respective daily growth rates $h_{1} \geq h_{2} \geq \dots \geq h_{n}$ . It is assumed that the initial heights of…