A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Kleitman and combinatorics: a celebration
Discrete Mathematics - Kleitman and combinatorics: a celebration
Discrete Mathematics - Kleitman and combinatorics: a celebration
Maximal nonrevisiting paths in simple polytopes
Discrete Mathematics
One-point suspensions and wreath products of polytopes and spheres
Journal of Combinatorial Theory Series A
Diameter of polyhedra: limits of abstraction
Proceedings of the twenty-fifth annual symposium on Computational geometry
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Diameter of Polyhedra: Limits of Abstraction
Mathematics of Operations Research
An O(n) bound for the diameter of transshipment polytopes
Operations Research Letters
The monotonic diameter of the perfect matching and shortest path polytopes
Operations Research Letters
The monotonic diameter of traveling salesman polytopes
Operations Research Letters
Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable
Mathematics of Operations Research
| Hi-index | 0.00 |