7 citations · 7 across the 3 of their papers we have counts for
6 papers
A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
Zayed Asiri, Ryan Burdett, Markus Chimani +3
Determining the crossing numbers of Cartesian products of small graphs with arbitrarily large paths has been an ongoing topic of research since the 1970s. Doing so requires the est…
Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
Markus Chimani, Torben Donzelmann, Nick Kloster +3
Beyond planarity concepts (prominent examples include k-planarity or fan-planarity) apply certain restrictions on the allowed patterns of crossings in drawings. It is natural to as…
Exact Minimum Weight Spanners via Column Generation
Fritz Bökler, Markus Chimani, Henning Jasper +1
Given a weighted graph , a minimum weight -spanner is a least-weight subgraph that preserves minimum distances between all node pairs up to a factor of . Th…
PaMILO: A Solver for Multi-Objective Mixed Integer Linear Optimization and Beyond
Fritz Bökler, Levin Nemesch, Mirko H. Wagner
In multi-objective optimization, several potentially conflicting objective functions need to be optimized. Instead of one optimal solution, we look for the set of so called non-dom…
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…
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…