2 papers
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.DS2016
A Note on the Practicality of Maximal Planar Subgraph Algorithms
Markus Chimani, Karsten Klein, Tilo Wiedera
Given a graph , the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of with the maximum number of edges. There are several heuristic, approximative,…