Edward D. Kim, “Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture”, Electronic Notes in Discrete Mathematics, 38, 2011, 511
Noriyoshi Sukegawa, “Improving bounds on the diameter of a polyhedron in high dimensions”, Discrete Mathematics, 340, № 9, 2017, 2134
Francisco Santos, Proceedings of the twenty-ninth annual symposium on Computational geometry, 2013, 165
Friedrich Eisenbrand, “Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes”, TOP, 21, № 3, 2013, 468
Tristram C. Bogart, Edward D. Kim, “Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count”, Combinatorica, 38, № 1, 2018, 75
David Bremner, Antoine Deza, William Hua, Lars Schewe, “More bounds on the diameters of convex polytopes”, Optimization Methods and Software, 28, № 3, 2013, 442
Noriyoshi Sukegawa, “An Asymptotically Improved Upper Bound on the Diameter of Polyhedra”, Discrete Comput Geom, 62, № 3, 2019, 690
Nicolai Hähnle, Steven Klee, Vincent Pilaud, “Obstructions to weak decomposability for simplicial polytopes”, Proc. Amer. Math. Soc., 142, № 9, 2014, 3249
Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, “Foundations of Discrete Optimization: In Transition from Linear to Non-linear Models and Methods”, Jahresber. Dtsch. Math. Ver., 114, № 4, 2012, 189
Michael J. Todd, “An Improved Kalai–Kleitman Bound for the Diameter of a Polyhedron”, SIAM J. Discrete Math., 28, № 4, 2014, 1944