88 citations · 196 across the 39 of their papers we have counts for
34 papers · 1 filter
An extension theorem for signotopes
Helena Bergold, Stefan Felsner, Manfred Scheucher
In 1926, Levi showed that, for every pseudoline arrangement and two points in the plane, can be extended by a pseudoline which contains the two prescrib…
Coloring circle arrangements: New -chromatic planar graphs
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher +3
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement graphs of simple great-circle arrangements have chromatic number at most . Motivated by this conjecture, we…
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…
Reconfiguring Independent Sets on Interval Graphs
Marcin Briański, Stefan Felsner, Jędrzej Hodor +1
We study reconfiguration of independent sets in interval graphs under the token sliding rule. We show that if two independent sets of size are reconfigurable in an -vertex i…
Plattenbauten: Touching Rectangles in Space
Stefan Felsner, Kolja Knauer, Torsten Ueckerdt
Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in . We study a generalization in space: touching graphs of axis-ali…