7 citations · 9 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2021
Properties of Large 2-Crossing-Critical Graphs
Drago Bokal, Markus Chimani, Alexander Nover +4
A -crossing-critical graph is one that has crossing number at least but each of its proper subgraphs has crossing number less than . Recently, a set of explicit construct…
cs.DM2021
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
Markus Chimani, Max Ilsen, Tilo Wiedera
We present a thorough experimental evaluation of several crossing minimization heuristics that are based on the construction and iterative improvement of a planarization, i.e., a p…