{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T08:38:18Z","timestamp":1781080698534,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,6,7]],"date-time":"2014-06-07T00:00:00Z","timestamp":1402099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00454-014-9601-x","type":"journal-article","created":{"date-parts":[[2014,6,6]],"date-time":"2014-06-06T09:17:02Z","timestamp":1402046222000},"page":"102-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["On Sub-determinants and the Diameter of Polyhedra"],"prefix":"10.1007","volume":"52","author":[{"given":"Nicolas","family":"Bonifas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco","family":"Di Summa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Friedrich","family":"Eisenbrand","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolai","family":"H\u00e4hnle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Niemeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,6,7]]},"reference":[{"key":"9601_CR1","unstructured":"Balinski, M.L.: The Hirsch conjecture for dual transportation polyhedra. Math. Oper. Res. 9(4), 629\u2013633 (1984)"},{"key":"9601_CR2","doi-asserted-by":"crossref","unstructured":"Barnette, D.: An upper bound for the diameter of a polytope. Discrete Math. 10, 9\u201313 (1974)","DOI":"10.1016\/0012-365X(74)90016-8"},{"key":"9601_CR3","doi-asserted-by":"crossref","unstructured":"Bonifas, N., Di Summa, M., Eisenbrand, F., H\u00e4hnle, N., Niemeier, M.: On sub-determinants and the diameter of polyhedra. In: Proceedings of the 28th Annual ACM Symposium on Computational Geometry, SoCG \u201912, pp. 357\u2013362. (2012)","DOI":"10.1145\/2261250.2261304"},{"key":"9601_CR4","doi-asserted-by":"crossref","unstructured":"Brunsch, T., R\u00f6glin, H.: Finding short paths on polytopes by the shadow vertex algorithm. In: Automata, Languages, and Programming. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-39206-1_24"},{"issue":"2","key":"9601_CR5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s00493-006-0010-5","volume":"26","author":"G Brightwell","year":"2006","unstructured":"Brightwell, G., van den Heuvel, J., Stougie, L.: A linear bound on the diameter of the transportation polytope. Combinatorica 26(2), 133\u2013139 (2006)","journal-title":"Combinatorica"},{"issue":"1, Ser. A","key":"9601_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582563","volume":"64","author":"M Dyer","year":"1994","unstructured":"Dyer, M., Frieze, A.: Random walks, totally unimodular matrices, and a randomised dual simplex algorithm. Math. Program. 64(1, Ser. A), 1\u201316 (1994)","journal-title":"Math. Program."},{"issue":"8","key":"9601_CR7","doi-asserted-by":"crossref","first-page":"1306","DOI":"10.1016\/j.jcta.2009.03.010","volume":"116","author":"JA Loera De","year":"2009","unstructured":"De Loera, J.A., Kim, E.D., Onn, S., Santos, F.: Graphs of transportation polytopes. J. Comb. Theory Ser. A 116(8), 1306\u20131325 (2009)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"4","key":"9601_CR8","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1287\/moor.1100.0470","volume":"35","author":"F Eisenbrand","year":"2010","unstructured":"Eisenbrand, F., H\u00e4hnle, N., Razborov, A., Rothvo\u00df, T.: Diameter of polyhedra: limits of abstraction. Math. Oper. Res. 35(4), 786\u2013794 (2010)","journal-title":"Math. Oper. Res."},{"key":"9601_CR9","volume-title":"Geometric Measure Theory","author":"H Federer","year":"1969","unstructured":"Federer, H.: Geometric Measure Theory. Springer, New York (1969)"},{"issue":"1","key":"9601_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF02392234","volume":"139","author":"T Figiel","year":"1977","unstructured":"Figiel, T., Lindenstrauss, J., Milman, V.: The dimension of almost spherical sections of convex bodies. Acta Math. 139(1), 53\u201394 (1977)","journal-title":"Acta Math."},{"key":"9601_CR11","doi-asserted-by":"crossref","unstructured":"Kaibel, V.: On the expansion of graphs of 0\/1-polytopes. In: The Sharpest Cut. MPS\/SIAM Ser. Optim., pp. 199\u2013216. SIAM, Philadelphia (2004)","DOI":"10.1137\/1.9780898718805.ch13"},{"key":"9601_CR12","doi-asserted-by":"crossref","unstructured":"Kalai, G.: The diameter of graphs of convex polytopes and f-vector theory. In: Applied Geometry and Discrete Mathematics. DIMACS Ser. Discrete Math. Theor. Comput. Sci., vol. 4, pp. 387\u2013411. Am. Math. Soc., Providence, RI (1991)","DOI":"10.1090\/dimacs\/004\/31"},{"issue":"2","key":"9601_CR13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1090\/S0273-0979-1992-00285-9","volume":"26","author":"G Kalai","year":"1992","unstructured":"Kalai, G., Kleitman, D.J.: A quasi-polynomial bound for the diameter of graphs of polyhedra. Bull. Am. Math. Soc. 26(2), 315\u2013316 (1992)","journal-title":"Bull. Am. Math. Soc."},{"key":"9601_CR14","unstructured":"Kim, E.D., Santos, F.: An update on the Hirsch conjecture. Jahresber. Dtsch. Math.-Ver. 112(2), 73\u201398 (2010)"},{"key":"9601_CR15","doi-asserted-by":"crossref","unstructured":"Klee, V., Walkup, D.W.: The d-step conjecture for polyhedra of dimension $$d<6$$ d < 6 . Acta Math. 133, 53\u201378 (1967)","DOI":"10.1007\/BF02395040"},{"issue":"20","key":"9601_CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1112\/plms\/s3-20.1.161","volume":"3","author":"DG Larman","year":"1970","unstructured":"Larman, D.G.: Paths of polytopes. Proc. Lond. Math. Soc. 3(20), 161\u2013178 (1970)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"4","key":"9601_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L., Simonovits, M.: Random walks in a convex body and an improved volume algorithm. Random Struct. Algorithms 4(4), 359\u2013412 (1993)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"9601_CR18","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1006\/jmaa.1996.0385","volume":"203","author":"M Merkle","year":"1996","unstructured":"Merkle, M.: Logarithmic convexity and inequalities for the gamma function. J. Math. Anal. Appl. 203(2), 369\u2013380 (1996)","journal-title":"J. Math. Anal. Appl."},{"key":"9601_CR19","doi-asserted-by":"crossref","unstructured":"Naddef, D.: The Hirsch conjecture is true for (0,1)-polytopes. Math. Program. 45, 109\u2013110 (1989)","DOI":"10.1007\/BF01589099"},{"key":"9601_CR20","unstructured":"Orlin, J.B.: A polynomial time primal network simplex algorithm for minimum cost flows. Network optimization: algorithms and applications (San Miniato, 1993). Math. Program., Ser. B 78(2), 109\u2013129 (1997)"},{"key":"9601_CR21","doi-asserted-by":"crossref","unstructured":"Santos, F.: A counterexample to the Hirsch conjecture. Annals of Math. 176(1), 383\u2013412 (2012)","DOI":"10.4007\/annals.2012.176.1.7"},{"issue":"2","key":"9601_CR22","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/070683386","volume":"39","author":"R Vershynin","year":"2009","unstructured":"Vershynin, R.: Beyond Hirsch conjecture: walks on random polytopes and smoothed complexity of the simplex method. SIAM J. Comput. 39(2), 646\u2013678 (2009)","journal-title":"SIAM J. Comput."}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9601-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-014-9601-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-014-9601-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T05:49:06Z","timestamp":1565502546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-014-9601-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,7]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9601"],"URL":"https:\/\/doi.org\/10.1007\/s00454-014-9601-x","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,7]]}}}