182 citations · 515 across the 59 of their papers we have counts for
67 papers
Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
Jie Gao, Pawel Gawrychowski, Panos Giannopoulos +4
A \emph{disk graph} is the intersection graph of (closed) disks in the plane. We consider the classic problem of finding a maximum clique in a disk graph. For general disk graphs,…
Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs
Katharina Klost, Wolfgang Mulzer
We describe optimal robust algorithms for finding a triangle and the unweighted girth in a unit disk graph, as well as finding a triangle in a transmission graph.In the robust sett…
Insertion-Only Dynamic Connectivity in General Disk Graphs
Haim Kaplan, Katharina Klost, Kristin Knorr +2
Let be a set of \emph{sites} in the plane, so that every site has an \emph{associated radius} . Let be the \emph{disk inter…
Well-Separation and Hyperplane Transversals in High Dimensions
Helena Bergold, Daniel Bertschinger, Nicolas Grelier +2
A family of point sets in dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong ass…
Nearest-Neighbor Decompositions of Drawings
Jonas Cleve, Nicolas Grelier, Kristin Knorr +3
Let be a set of straight-line segments in the plane, potentially crossing, and let be a positive integer. We denote by the union of the endpoints of the strai…
Unique Sink Orientations of Grids is in Unique End of Potential Line
Michaela Borzechowski, Wolfgang Mulzer
The complexity classes Unique End of Potential Line (UEOPL) and its promise version PUEOPL were introduced in 2018 by Fearnly et al. UEOPL captures search problems where the instan…