6 citations · 9 across the 4 of their papers we have counts for
4 papers · 1 filter
Covering Paths for Planar Point Sets
Adrian Dumitrescu, Daniel Gerbner, Balazs Keszegh +1
Given points in the plane, a \emph{covering path} is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least …
Density-based group testing
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi +1
In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are conside…
Drawing planar graphs of bounded degree with few slopes
Balázs Keszegh, János Pach, Dömötör Pálvölgyi
We settle a problem of Dujmović, Eppstein, Suderman, and Wood by showing that there exists a function with the property that every planar graph with maximum degree admi…
Drawing Graphs with Orthogonal Crossings
Radoslav Fulek, Balázs Keszegh, Filip Morić
By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertice…