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 cs.CGShow all

2 papers · 1 filter

cs.CG2024

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O (lo g n)$ Deterministic Rounds on the Congested Clique

Jesper Jansson, Christos Levcopoulos, Andrzej Lingas

We study the problem of computing the Voronoi diagram of a set of $n^{2}$ points with $O (lo g n)$ -bit coordinates in the Euclidean plane in a substantially sublinear in $n$ number of…

cs.CG2014★ 1 cited

A QPTAS for the Base of the Number of Triangulations of a Planar Point Set

Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu

The number of triangulations of a planar n point set is known to be $c^{n}$ , where the base $c$ lies between $2.43$ and $30.$ The fastest known algorithm for counting triangulations…

The Voronoi Diagram of Weakly Smooth Planar Point Sets in O(logn) Deterministic Rounds on the Congested Clique

A QPTAS for the Base of the Number of Triangulations of a Planar Point Set

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O (lo g n)$ Deterministic Rounds on the Congested Clique