73 citations · 178 across the 49 of their papers we have counts for
8 papers · 1 filter
The Density Formula: One Lemma to Bound Them All
Michael Kaufmann, Boris Klemz, Kristin Knorr +3
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in t…
Shallow Hitting Edge Sets in Uniform Hypergraphs
Tim Planken, Torsten Ueckerdt
A subset of the edges of a graph or hypergraph is hitting if covers each vertex of at least once, and is -shallow if it covers each vertex of at most tim…
Axis-Parallel Right Angle Crossing Graphs
Patrizio Angelini, Michael A. Bekos, Julia Katheder +3
A RAC graph is one admitting a RAC drawing, that is, a polyline drawing in which each crossing occurs at a right angle. Originally motivated by psychological studies on readability…
On the complexity of embedding in graph products
Therese Biedl, David Eppstein, Torsten Ueckerdt
Graph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of…
Clustered independence and bounded treewidth
Kolja Knauer, Torsten Ueckerdt
A set of vertices of a graph is a -clustered set if it induces a subgraph with components of order at most each, and denotes the size of a larges…
Cops and Robber -- When Capturing is not Surrounding
Paul Jungeblut, Samuel Schneider, Torsten Ueckerdt
We consider "surrounding" versions of the classic Cops and Robber game. The game is played on a connected graph in which two players, one controlling a number of cops and the other…