Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
A better approximation algorithm for finding planar subgraphs
Journal of Algorithms
Vertex Splitting and Tension-Free Layout
GD '95 Proceedings of the Symposium on Graph Drawing
Splitting Number is NP-complete
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.00 |