A. Lingas

activity

20092024

most citedExact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications

4 citations · 10 across the 24 of their papers we have counts for

collaborators

Showing 2023 · cs.DSShow all

2 papers · 2 filters

cs.DS2023

$(min, +)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences

Andrzej Lingas, Mia Persson

We study the time complexity of computing the $(min, +)$ matrix product of two $n \times n$ integer matrices in terms of $n$ and the number of monotone subsequences the rows of the…

cs.DS2023

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…

(min,+) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences

Finding Small Complete Subgraphs Efficiently

$(min, +)$ Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences