Add to ORKGAbstract. The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
In the expanding computer science field of Graph Drawing, methods are developed to draw graphs in o...
The Planar Contraction problem is to test whether a given graph can be made planar by using at most ...
The Planar Contraction problem is to test whether a given graph can be made planar by using at most ...
The Planar Contraction problem is to test whether a given graph can be made planar by using at most ...
For every graph H, there exists a polynomial-time algorithm deciding if a planar input graph G can b...
AbstractFor every graph H, there exists a polynomial-time algorithm deciding if a planar input graph...
For every graph H, there exists a polynomial-time algorithm deciding if a planar input graph G can b...
We show that testing reachability in a planar DAG can be performed in parallel in O(log n log n) ...
Testing the planarity of a graph and possibly drawing it without intersections is one of the most fa...
AbstractFor every graph H, there exists a polynomial-time algorithm deciding if a planar input graph...
\u3cbr/\u3eWe study the problem of computing straight-line drawings of non-planar graphs with few cr...
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
In the expanding computer science field of Graph Drawing, methods are developed to draw graphs in o...
The Planar Contraction problem is to test whether a given graph can be made planar by using at most ...
The Planar Contraction problem is to test whether a given graph can be made planar by using at most ...
The Planar Contraction problem is to test whether a given graph can be made planar by using at most ...
For every graph H, there exists a polynomial-time algorithm deciding if a planar input graph G can b...
AbstractFor every graph H, there exists a polynomial-time algorithm deciding if a planar input graph...
For every graph H, there exists a polynomial-time algorithm deciding if a planar input graph G can b...
We show that testing reachability in a planar DAG can be performed in parallel in O(log n log n) ...
Testing the planarity of a graph and possibly drawing it without intersections is one of the most fa...
AbstractFor every graph H, there exists a polynomial-time algorithm deciding if a planar input graph...
\u3cbr/\u3eWe study the problem of computing straight-line drawings of non-planar graphs with few cr...
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
We study the problem of computing straight-line drawings of non-planar graphs with few crossings. We...
In the expanding computer science field of Graph Drawing, methods are developed to draw graphs in o...