7 citations · 10 across the 16 of their papers we have counts for
39 papers
(Re)packing Equal Disks into Rectangle
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar +2
The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem. (By a packing here we mean an arrangement of disks in a rectangle without ov…
A Framework for Approximation Schemes on Disk Graphs
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh +2
We initiate a systematic study of approximation schemes for fundamental optimization problems on disk graphs, a common generalization of both planar graphs and unit-disk graphs. Ou…
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation
Akanksha Agrawal, Saket Saurabh, Meirav Zehavi
The \emph{Delaunay graph} of a point set is the plane graph with the vertex-set and the edge-set that contains if there exists a disc whos…
The complexity of high-dimensional cuts
Ulrich Bauer, Abhishek Rathod, Meirav Zehavi
Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. For instance, the minimum cut, the minimum - cut, the minimum multiway cut, and…
Grid Recognition: Classical and Parameterized Computational Perspectives
Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
Grid graphs, and, more generally, grid graphs, form one of the most basic classes of geometric graphs. Over the past few decades, a large body of works studied the (in)…
Verification of Multi-Layered Assignment Problems
Barak Steindl, Meirav Zehavi
The class of assignment problems is a fundamental and well-studied class in the intersection of Social Choice, Computational Economics and Discrete Allocation. In a general assignm…