A c-crossing-critical graph is one that has crossing number at least c
b...
We present a thorough experimental evaluation of several crossing
minimi...
In a Subgraph Problem we are given some graph and want to find a feasibl...
Given a graph G=(V,E), the longest induced path problem asks for a maxim...
In multistage perfect matching problems we are given a sequence of graph...
A simple drawing D(G) of a graph G = (V,E) is a drawing in which two
edg...
We study c-crossing-critical graphs, which are the minimal graphs that
r...
The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph H...
Given a graph G, the NP-hard Maximum Planar Subgraph problem asks for a
...