
StarStruck by Fixed Embeddings: Modern Crossing Number Heuristics
We present a thorough experimental evaluation of several crossing minimi...
read it

A General Approach to Approximate Multistage Subgraph Problems
In a Subgraph Problem we are given some graph and want to find a feasibl...
read it

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...
read it

Approximating Multistage Matching Problems
In multistage perfect matching problems we are given a sequence of graph...
read it

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...
read it

Bounded maximum degree conjecture holds precisely for ccrossingcritical graphs with c ≤ 12
We study ccrossingcritical graphs, which are the minimal graphs that r...
read it

Cycles to the Rescue! Novel Constraints to Compute Maximum Planar Subgraphs Fast
The NPhard Maximum Planar Subgraph problem asks for a planar subgraph H...
read it

Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments
Given a graph G, the NPhard Maximum Planar Subgraph problem asks for a ...
read it
Tilo Wiedera
is this you? claim profile