29 citations · 74 across the 56 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013★ 3 cited
Covering Paths and Trees for Planar Grids
Balázs Keszegh
Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We sh…
math.CO2013
Topological orderings of weighted directed acyclic graphs
Dániel Gerbner, Balázs Keszegh, Cory Palmer +1
We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate…
math.MG2013
Convex Polygons are Self-Coverable
Balázs Keszegh, Dömötör Pálvölgyi
We introduce a new notion for geometric families called self-coverability and show that homothets of convex polygons are self-coverable. As a corollary, we obtain several results a…