Primal-dual methods for vertex and facet enumeration (preliminary version)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Computing the face lattice of a polytope from its vertex-facet incidences
Computational Geometry: Theory and Applications
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
Proceedings of the twenty-seventh annual symposium on Computational geometry
A global optimization algorithm for solving the bi-level linear fractional programming problem
Computers and Industrial Engineering
Computing the bounded subcomplex of an unbounded polyhedron
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |