SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Topological graph theory
A polynomial-time algorithm to find the shortest cycle basis of a graph
SIAM Journal on Computing
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science
The graph genus problem is NP-complete
Journal of Algorithms
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Embeddings of graphs with no short noncontractible cycles
Journal of Combinatorial Theory Series B
An introduction to parallel algorithms
An introduction to parallel algorithms
Journal of the ACM (JACM)
Algorithms for Generating Fundamental Cycles in a Graph
ACM Transactions on Mathematical Software (TOMS)
An algorithm for finding a fundamental set of cycles of a graph
Communications of the ACM
Graph Algorithms
Solid model input through orthographic views
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
Creating volume models from edge-vertex graphs
SIGGRAPH '82 Proceedings of the 9th annual conference on Computer graphics and interactive techniques
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
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Identifying Faces in a 2D Line Drawing Representing a Manifold Object
IEEE Transactions on Pattern Analysis and Machine Intelligence
Converting hybrid wire-frames to B-rep models
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Constructing regularity feature trees for solid models
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
A general and efficient method for finding cycles in 3D curve networks
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |