{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T11:56:22Z","timestamp":1772366182847,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T00:00:00Z","timestamp":1575936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T00:00:00Z","timestamp":1575936000000},"content-version":"vor","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":[[2021,3]]},"DOI":"10.1007\/s00454-019-00161-3","type":"journal-article","created":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T16:04:48Z","timestamp":1575993888000},"page":"476-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Proof of the Strict Monotone 5-Step Conjecture"],"prefix":"10.1007","volume":"65","author":[{"given":"John Mackenzie","family":"Gallagher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0020-5092","authenticated-orcid":false,"suffix":"Jr.","given":"Walter D.","family":"Morris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"key":"161_CR1","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented matroids. Encyclopedia of Mathematics and Its Applications, vol. 46, 2nd edn. Cambridge University Press, Cambridge (1999)","DOI":"10.1017\/CBO9780511586507"},{"issue":"1","key":"161_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0095-8956(77)90055-7","volume":"23","author":"RG Bland","year":"1977","unstructured":"Bland, R.G.: A combinatorial abstraction of linear programming. J. Comb. Theory Ser. B 23(1), 33\u201357 (1977)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"161_CR3","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1080\/10556788.2012.668906","volume":"28","author":"D Bremner","year":"2013","unstructured":"Bremner, D., Deza, A., Hua, W., Schewe, L.: More bounds on the diameters of convex polytopes. Optim. Methods Softw. 28(3), 442\u2013450 (2013)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"161_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1080\/10586458.2011.564965","volume":"20","author":"D Bremner","year":"2011","unstructured":"Bremner, D., Schewe, L.: Edge-graph diameter bounds for convex polytopes with few facets. Exp. Math. 20(3), 229\u2013237 (2011)","journal-title":"Exp. Math."},{"key":"161_CR5","unstructured":"Edmonds, J., Fukuda, K.: Oriented Matroid Programming. Ph.D. Thesis of K. Fukuda, University of Waterloo (1982)"},{"issue":"1\u20132","key":"161_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10107-017-1120-0","volume":"166","author":"M Firsching","year":"2017","unstructured":"Firsching, M.: Realizability and inscribability for simplicial polytopes via nonlinear optimization. Math. Progr. Ser. A 166(1\u20132), 273\u2013295 (2017)","journal-title":"Math. Progr. Ser. A"},{"issue":"2","key":"161_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0095-8956(78)90039-4","volume":"25","author":"J Folkman","year":"1978","unstructured":"Folkman, J., Lawrence, J.: Oriented matroids. J. Combin. Theory Ser. B 25(2), 199\u2013236 (1978)","journal-title":"J. Combin. Theory Ser. B"},{"key":"161_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1090\/conm\/223\/03138","volume-title":"Advances in Discrete and Computational Geometry. Contemporary Mathematics","author":"F Holt","year":"1999","unstructured":"Holt, F., Klee, V.: A proof of the strict monotone $$4$$-step conjecture. In: Chazelle, B., et al. (eds.) Advances in Discrete and Computational Geometry. Contemporary Mathematics, vol. 223, pp. 201\u2013216. American Mathematical Society, Providence (1999)"},{"key":"161_CR9","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/0113062","volume":"13","author":"V Klee","year":"1965","unstructured":"Klee, V.: Paths on polyhedra. I. SIAM J. Appl. Math. 13, 946\u2013956 (1965)","journal-title":"SIAM J. Appl. Math."},{"key":"161_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF02395040","volume":"133","author":"V Klee","year":"1967","unstructured":"Klee, V., Walkup, D.W.: The $$d$$-step conjecture for polyhedra of dimension $$d\\,<\\,6$$. Acta Math. 133, 53\u201378 (1967)","journal-title":"Acta Math."},{"issue":"1","key":"161_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.4007\/annals.2012.176.1.7","volume":"176","author":"F Santos","year":"2012","unstructured":"Santos, F.: A counterexample to the Hirsch conjecture. Ann. Math. 176(1), 383\u2013412 (2012)","journal-title":"Ann. Math."},{"issue":"2","key":"161_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00454-009-9222-y","volume":"43","author":"L Schewe","year":"2010","unstructured":"Schewe, L.: Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers. Discrete Comput. Geom. 43(2), 289\u2013302 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"161_CR13","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1287\/moor.5.4.599","volume":"5","author":"MJ Todd","year":"1980","unstructured":"Todd, M.J.: The monotonic Hirsch conjecture is false for dimension at least 4. Math. Oper. Res. 5(4), 599\u2013601 (1980)","journal-title":"Math. Oper. Res."},{"key":"161_CR14","unstructured":"Tschirschnitz, F.: Testing extendability for partial chirotopes is NP-complete. In: Proceedings of the 13th Canadian Conference on Computational Geometry, pp. 165\u2013168 (2001)"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00161-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-019-00161-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00161-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T19:57:23Z","timestamp":1612900643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-019-00161-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["161"],"URL":"https:\/\/doi.org\/10.1007\/s00454-019-00161-3","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,10]]},"assertion":[{"value":"24 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}