- Edward D. Kim, “Polyhedral graph abstractions and an approach to the Linear Hirsch Conjecture”, Electronic Notes in Discrete Mathematics, 38, 2011, 511
![https://doi.org/10.1016/j.endm.2011.09.083 crossref](/refsvg/svg/crossref.svg)
- Noriyoshi Sukegawa, “Improving bounds on the diameter of a polyhedron in high dimensions”, Discrete Mathematics, 340, no. 9, 2017, 2134
![https://doi.org/10.1016/j.disc.2017.04.005 crossref](/refsvg/svg/crossref.svg)
- Francisco Santos, Proceedings of the twenty-ninth annual symposium on Computational geometry, 2013, 165
![https://doi.org/10.1145/2462356.2462408 crossref](/refsvg/svg/crossref.svg)
- Friedrich Eisenbrand, “Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes”, TOP, 21, no. 3, 2013, 468
![https://doi.org/10.1007/s11750-013-0292-x crossref](/refsvg/svg/crossref.svg)
- Tristram C. Bogart, Edward D. Kim, “Superlinear Subset Partition Graphs With Dimension Reduction, Strong Adjacency, and Endpoint Count”, Combinatorica, 38, no. 1, 2018, 75
![https://doi.org/10.1007/s00493-016-3327-8 crossref](/refsvg/svg/crossref.svg)
- David Bremner, Antoine Deza, William Hua, Lars Schewe, “More bounds on the diameters of convex polytopes”, Optimization Methods and Software, 28, no. 3, 2013, 442
![https://doi.org/10.1080/10556788.2012.668906 crossref](/refsvg/svg/crossref.svg)
- Noriyoshi Sukegawa, “An Asymptotically Improved Upper Bound on the Diameter of Polyhedra”, Discrete Comput Geom, 62, no. 3, 2019, 690
![https://doi.org/10.1007/s00454-018-0016-y crossref](/refsvg/svg/crossref.svg)
- Nicolai Hähnle, Steven Klee, Vincent Pilaud, “Obstructions to weak decomposability for simplicial polytopes”, Proc. Amer. Math. Soc., 142, no. 9, 2014, 3249
![https://doi.org/10.1090/S0002-9939-2014-12101-0 crossref](/refsvg/svg/crossref.svg)
- 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, no. 4, 2012, 189
![https://doi.org/10.1365/s13291-012-0055-x crossref](/refsvg/svg/crossref.svg)
- Michael J. Todd, “An Improved Kalai–Kleitman Bound for the Diameter of a Polyhedron”, SIAM J. Discrete Math., 28, no. 4, 2014, 1944
![https://doi.org/10.1137/140962310 crossref](/refsvg/svg/crossref.svg)