activity
20062026
most citedBijections for Baxter Families and Related Objects

88 citations · 196 across the 39 of their papers we have counts for

collaborators

59 papers

cs.CG2026

Rerouting Curves on Surfaces

Timo Brand, Stefan Felsner, Henry Förster +8

We study the problem of reconfiguring a crossing-free embedding of a graph on a surface, with edges represented as curves, into another crossing-free embedding of the same graph on…

cs.CG2023

Using SAT to study plane Hamiltonian substructures in simple drawings

Helena Bergold, Stefan Felsner, Meghana M. Reddy +1

In 1988 Rafla conjectured that every simple drawing of a complete graph contains a plane, i.e., non-crossing, Hamiltonian cycle. The conjecture is far from being resolved. Th…

math.CO2023

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…

cs.CG2023

Linear Size Universal Point Sets for Classes of Planar Graphs

Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder +1

A finite set of points in the plane is -universal with respect to a class of planar graphs if every -vertex graph in admits a crossing-free st…

cs.DS2022★ 1 cited

The Rique-Number of Graphs

Michael A. Bekos, Stefan Felsner, Philipp Kindermann +3

We continue the study of linear layouts of graphs in relation to known data structures. At a high level, given a data structure, the goal is to find a linear order of the vertices…

cs.CG2022

Arrangements of Pseudocircles: On Digons and Triangles

Stefan Felsner, Sandro Roch, Manfred Scheucher

In this article, we study the cell-structure of simple arrangements of pairwise intersecting pseudocircles. The focus will be on two problems of Grünbaum (1972). First, we discuss…