3 papers
cs.CG2026
Weighted Book Thickness
Henry Förster, Michael Hoffmann, Stephen Kobourov +3
We introduce and study the weighted book thickness of graphs. A -page book embedding of a graph is defined by a spanning cycle for (which does not need to be p…
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.CG2025
Using Reinforcement Learning to Optimize the Global and Local Crossing Number
Timo Brand, Henry Förster, Stephen Kobourov +4
Graph drawing concerns the algorithmic visualization of graphs. A good drawing of a graph is easy to read and facilitates solving tasks on the graph. Several properties have been i…