A linear algorithm for embedding planar graphs using PQ-trees
Journal of Computer and System Sciences
Topological graph theory
The graph genus problem is NP-complete
Journal of Algorithms
A Kuratowski theorem for nonorientable surfaces
Journal of Combinatorial Theory Series B
Graph minors. VIII. A Kuratowski theorem for general surfaces
Journal of Combinatorial Theory Series B
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Projective planarity in linear time
Journal of Algorithms
Triangulating a surface with a prescribed graph
Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Journal of the ACM (JACM)
Depth-First Search and Kuratowski Subgraphs
Journal of the ACM (JACM)
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
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Stop minding your p's and q's: a simplified O(n) planar embedding algorithm
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Isomorphism testing for embeddable graphs through definability
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computing crossing numbers in quadratic time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Computing crossing numbers in quadratic time
Journal of Computer and System Sciences - STOC 2001
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Journal of Algorithms
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Errors in graph embedding algorithms
Journal of Computer and System Sciences
The asymmetric traveling salesman problem on graphs with bounded genus
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Strong backdoors to nested satisfiability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |