activity
20222026
most citedRevisiting Extremal Graphs Having No Stable Cutsets

1 citations · 1 across the 11 of their papers we have counts for

collaborators
Showing 2024Show all

3 papers · 1 filter

cs.DS2024

weberknecht -- a One-Sided Crossing Minimization solver

Johannes Rauch

We describe the implementation of the exact solver weberknecht and the heuristic solver weberknecht_h for the One-Sided Crossing Minimization problem.

math.CO2024★ 1 cited

Revisiting Extremal Graphs Having No Stable Cutsets

Johannes Rauch, Dieter Rautenbach

Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph with vertices and at most edges has a stable cutset, which is a stable set of ver…

math.CO2024

Forest Cuts in Sparse Graphs

Vsevolod Chernyshev, Johannes Rauch, Dieter Rautenbach

We propose the conjecture that every graph of order with less than edges has a vertex cut that induces a forest. Maximal planar graphs do not have such vertex cuts a…