Journal of the ACM (JACM)
Sequential and parallel algorithms to find a K5 minor
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Embedding graphs in an arbitrary surface in linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
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
Three-coloring triangle-free planar graphs in linear time
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
Efficient extraction of multiple kuratowski subdivisions
GD'07 Proceedings of the 15th international conference on Graph drawing
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Three-coloring triangle-free planar graphs in linear time
ACM Transactions on Algorithms (TALG)
Experiments on exact crossing minimization using column generation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
A linear time algorithm for finding a maximal planar subgraph based on PC-trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Computer Science Review
| Hi-index | 0.00 |