A linear algorithm for embedding planar graphs using PQ-trees
Journal of Computer and System Sciences
Projective planarity in linear time
Journal of Algorithms
Embedding graphs in an arbitrary surface in linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Depth-First Search and Kuratowski Subgraphs
Journal of the ACM (JACM)
Graph Algorithms
Embedding Graphs in the Torus in Linear Time
Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
I/O-optimal algorithms for planar graphs using separators
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristics for the Maximum Outerplanar Subgraph Problem
Journal of Heuristics
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
Conformal spherical representation of 3D genus-zero meshes
Pattern Recognition
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Efficient extraction of multiple kuratowski subdivisions
GD'07 Proceedings of the 15th international conference on Graph drawing
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
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
New 3d fourier descriptors for genus-zero mesh objects
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part I
Additional PC-Tree planarity conditions
GD'04 Proceedings of the 12th international conference on Graph Drawing
A note on the self-similarity of some orthogonal drawings
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |