2 citations · 3 across the 5 of their papers we have counts for
6 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…
An Improved Lower Bound on the Number of Pseudoline Arrangements
Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner +1
Arrangements of pseudolines are classic objects in discrete and computational geometry. They have been studied with increasing intensity since their introduction almost 100 years a…
Plane Hamiltonian Cycles in Convex Drawings
Helena Bergold, Stefan Felsner, Meghana M. Reddy +2
A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph admits a plane Hamiltonian cycle. It turned out that already the existence of much sim…
Combinatorics of rectangulations: Old and new bijections
Andrei Asinowski, Jean Cardinal, Stefan Felsner +1
A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a ric…
Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles
Yan Alves Radtke, Stefan Felsner, Johannes Obenaus +3
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer…
Bichromatic Perfect Matchings with Crossings
Oswin Aichholzer, Stefan Felsner, Rosna Paul +2
We consider bichromatic point sets with red and blue points and study straight-line bichromatic perfect matchings on them. We show that every such point set in convex posit…