An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B

Graph minors. VI. Disjoint paths across a disc

Journal of Combinatorial Theory Series B

Topological graph theory

Topological graph theory

Nonconstructive advances in polynomial-time complexity

Information Processing Letters

Finding a maximum-genus graph imbedding

Journal of the ACM (JACM)

Nonconstructive tools for proving polynomial-time decidability

Journal of the ACM (JACM)

An efficient parallel algorithm for planarity

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986

The graph genus problem is NP-complete

Journal of Algorithms

Graph minors. IV. Tree-width and well-quasi-ordering

Journal of Combinatorial Theory Series B

Graph minors. VIII. A Kuratowski theorem for general surfaces

Journal of Combinatorial Theory Series B

3-edge-connected embeddings have few singular edges

Journal of Graph Theory

Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B

Efficient Planarity Testing

Journal of the ACM (JACM)

A Linear Time Planarity Algorithm for 2-Complexes

Journal of the ACM (JACM)

Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus)

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory

On determining the genus of a graph in O(v O(g)) steps(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Isomorphism testing for graphs of bounded genus

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing