Polytope Skeletons And Paths

by Gil Kalai
Venue:HANDBOOK OF DISCRETE AND COMPUTATIONAL GEOMETRY (SECOND EDITION ), CHAPTER 20
Citations:6 - 0 self

Active Bibliography

The Work of Daniel A. Spielman – Gil Kalai - 2010
3 Geometric Combinatorics of Transportation Polytopes and the Behavior of . . . – Edward Dong Huhn Kim - 2010
19 Randomized Simplex Algorithms on Klee-Minty Cubes – Bernd Gärtner, Martin Henk, Günter M. Ziegler - 1994
54 COMPUTATIONAL TOPOLOGY – Tamal K. Dey, Herbert Edelsbrunner , Sumanta Guha
OPTIMA Mathematical Optimization Society Newsletter – unknown authors - 2011
25 Combinatorial Aspects of Convex Polytopes – Margaret M. Bayer, Carl W. Lee - 1991
9 Remarks on the combinatorial intersection cohomology of fans, preprint – Tom Braden
8 Randomized Optimization by Simplex-type Methods – Bernd Gärtner - 1995
Documenta Math. 75 Who Solved the Hirsch Conjecture? – Günter M. Ziegler
10 LINEAR PROGRAMMING – Martin Dyer, Nimrod Megiddo, Emo Welzl - 1997
3 GALE DUALITY AND KOSZUL DUALITY – Tom Braden, Anthony Licata, Nicholas Proudfoot, Ben Webster
20 Two decompositions in topological combinatorics with applications to matroid complexes – Manoj K. Chari - 1997
1 Topological Graph Theory - A Survey – Dan Archdeacon - 1996
13 Enumeration and random realization of triangulated surfaces.arXiv:math.CO – Frank H. Lutz
13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
3 Convex Polytopes: Extremal Constructions and f-Vector Shapes – Günter M. Ziegler - 2005
2 Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings – David Eppstein, Michael T. Goodrich, Darren Strash - 2009
47 Bounds On The Complex Zeros Of (Di)Chromatic Polynomials And Potts-Model Partition Functions – Alan D. Sokal
2 Two new bounds for the random-edge simplex algorithm, preprint, arXiv: math.CO/0502025 – Bernd Gärtner, Volker Kaibel - 2005