29 citations · 74 across the 56 of their papers we have counts for
3 papers · 1 filter
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…
Unique-maximum and conflict-free colorings for hypergraphs and tree graphs
Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi
We investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors…