research
∙
12/09/2021
Properties of Large 2-Crossing-Critical Graphs
A c-crossing-critical graph is one that has crossing number at least c b...
share
research
∙
08/25/2021
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
We present a thorough experimental evaluation of several crossing minimi...
research
∙
07/06/2021
A General Approach to Approximate Multistage Subgraph Problems
In a Subgraph Problem we are given some graph and want to find a feasibl...
research
∙
02/17/2020
An Experimental Study of ILP Formulations for the Longest Induced Path Problem
Given a graph G=(V,E), the longest induced path problem asks for a maxim...
research
∙
02/17/2020
Approximating Multistage Matching Problems
In multistage perfect matching problems we are given a sequence of graph...
research
∙
09/16/2019
Extending simple drawings with one edge is hard
A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...
research
∙
03/13/2019
Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c ≤ 12
We study c-crossing-critical graphs, which are the minimal graphs that r...
research
∙
06/21/2018
Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast
The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph H...
research
∙
04/19/2018
