4 citations · 7 across the 4 of their papers we have counts for
4 papers
Block coupling and rapidly mixing k-heights
Stefan Felsner, Daniel Heldt, Sandro Roch +1
A -height on a graph is an assignment such that the value on ajacent vertices differs by at most . We study the Markov chain on -heights…
Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs
Stefan Felsner, Daniel Heldt
We study Markov chains for -orientations of plane graphs, these are orientations where the outdegree of each vertex is prescribed by the value of a given function . The set o…
On the bend-number of planar and outerplanar graphs
Daniel Heldt, Kolja Knauer, Torsten Ueckerdt
The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjectur…
Edge-intersection graphs of grid paths: the bend-number
Daniel Heldt, Kolja Knauer, Torsten Ueckerdt
We investigate edge-intersection graphs of paths in the plane grid, regarding a parameter called the bend-number. I.e., every vertex is represented by a grid path and two vertices…