73 citations · 178 across the 49 of their papers we have counts for
6 papers · 1 filter
Polychromatic Colorings of Unions of Geometric Hypergraphs
Vera Chekan, Torsten Ueckerdt
We consider the polychromatic coloring problems for unions of two or more geometric hypergraphs on the same vertex sets of points in the plane. We show, inter alia, that the union…
On the Queue-Number of Partial Orders
Stefan Felsner, Torsten Ueckerdt, Kaja Wille
The queue-number of a poset is the queue-number of its cover graph viewed as a directed acyclic graph, i.e., when the vertex order must be a linear extension of the poset. Heath an…
Linear Layouts of Complete Graphs
Stefan Felsner, Laura Merker, Torsten Ueckerdt +1
A page (queue) with respect to a vertex ordering of a graph is a set of edges such that no two edges cross (nest), i.e., have their endpoints ordered in an ABAB-pattern (ABBA-patte…
An improved planar graph product structure theorem
Torsten Ueckerdt, David R. Wood, Wendy Yi
Dujmović, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved that for every planar graph there is a graph with treewidth at most 8 and a path such that $G\subs…
A Sublinear Bound on the Page Number of Upward Planar Graphs
Paul Jungeblut, Laura Merker, Torsten Ueckerdt
The page number of a directed acyclic graph is the minimum for which there is a topological ordering of and a -coloring of the edges such that no two edges of the sa…
Weak Coloring Numbers of Intersection Graphs
Zdeněk Dvořák, Jakub Pekárek, Torsten Ueckerdt +1
Weak and strong coloring numbers are generalizations of the degeneracy of a graph, where for each natural number , we seek a vertex ordering such every vertex can (weakly respec…