7 citations · 9 across the 8 of their papers we have counts for
10 papers
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…
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…
A General Approach to Approximate Multistage Subgraph Problems
Markus Chimani, Niklas Troost, Tilo Wiedera
In a Subgraph Problem we are given some graph and want to find a feasible subgraph that optimizes some measure. We consider Multistage Subgraph Problems (MSPs), where we are given…
An Experimental Study of ILP Formulations for the Longest Induced Path Problem
Fritz Bökler, Markus Chimani, Mirko H. Wagner +1
Given a graph , the longest induced path problem asks for a maximum cardinality node subset such that the graph induced by is a path. It is a long estab…
Approximating Multistage Matching Problems
Markus Chimani, Niklas Troost, Tilo Wiedera
In multistage perfect matching problems we are given a sequence of graphs on the same vertex set and asked to find a sequence of perfect matchings, corresponding to the sequence of…
Inserting one edge into a simple drawing is hard
Alan Arroyo, Fabian Klute, Irene Parada +3
A {\em simple drawing} of a graph is one where each pair of edges share at most one point: either a common endpoint or a proper crossing. An edge in the complement o…