{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:35Z","timestamp":1781305055202,"version":"3.54.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_15","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:09Z","timestamp":1781303649000},"page":"220-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Lattice Diameter Segments: Algorithms and\u00a0Structure"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2245-9958","authenticated-orcid":false,"given":"Gennadiy","family":"Averkov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6869-1146","authenticated-orcid":false,"given":"Anouk E.","family":"Brose","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9556-1112","authenticated-orcid":false,"given":"Jes\u00fas A.","family":"De Loera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2005-8210","authenticated-orcid":false,"given":"Gyivan","family":"Lopez-Campos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9498-1692","authenticated-orcid":false,"given":"Antonio J.","family":"Torres","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"15_CR1","unstructured":"Alarcon\u00a0II, E.G.: Convex lattice polygons. Ph.D. thesis, University of Illinois at Urbana-Champaign (1987)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Arnold, V.I.: Statistics of integral convex polytopes. Funkts. Anal. Pril. 14, 1\u20133 (1980). (in Russian), English translation. Funct. Anal. Appl. 14, 79\u201384 (1980)","DOI":"10.1007\/BF01086547"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, USA (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"15_CR4","unstructured":"Arun, S., Dillon, T.: Hollow polytopes with many vertices (2025). arXiv:2504.17530"},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1287\/moor.1110.0510","volume":"36","author":"G Averkov","year":"2011","unstructured":"Averkov, G., Wagner, C., Weismantel, R.: Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three. Math. Oper. Res. 36(4), 721\u2013742 (2011)","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"15_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0012-365X(01)00145-5","volume":"241","author":"I B\u00e1r\u00e1ny","year":"2001","unstructured":"B\u00e1r\u00e1ny, I., F\u00fcredi, Z.: On the lattice diameter of a convex polygon. Discrete Math. 241(1\u20133), 41\u201350 (2001)","journal-title":"Discrete Math."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1017\/S0963548300000341","volume":"1","author":"I B\u00e1r\u00e1ny","year":"1992","unstructured":"B\u00e1r\u00e1ny, I., Pach, J.: On the number of convex lattice polygons. Comb. Probab. Comput. 1, 295\u2013302 (1992)","journal-title":"Comb. Probab. Comput."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01896660","volume":"2","author":"I B\u00e1r\u00e1ny","year":"1992","unstructured":"B\u00e1r\u00e1ny, I., Vershik, A.M.: On the number of convex lattice polytopes. Geom. Funct. Anal. 2, 381\u2013393 (1992)","journal-title":"Geom. Funct. Anal."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"A Barvinok","year":"1994","unstructured":"Barvinok, A.: A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19, 769\u2013779 (1994)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1007\/BF02367245","volume":"94","author":"VV Batyrev","year":"1999","unstructured":"Batyrev, V.V.: On the classification of toric Fano 4-folds. J. Math. Sci. 94(1), 1021\u20131050 (1999)","journal-title":"J. Math. Sci."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Beck, M., Robins, S.: Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra. Undergraduate Texts in Mathematics, 2nd edn. Springer (2015)","DOI":"10.1007\/978-1-4939-2969-6"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Boltyansky, V.G., Gohberg, I.: Results and problems in combinatorial geometry. CUP Archive (1985)","DOI":"10.1017\/CBO9780511569258"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.4064\/fm-20-1-177-190","volume":"20","author":"K Borsuk","year":"1933","unstructured":"Borsuk, K.: Drei S\u00e4tze \u00fcber die $$n$$-dimensionale Euklidische Sph\u00e4re. Fund. Math. 20, 177\u2013190 (1933)","journal-title":"Fund. Math."},{"key":"15_CR14","first-page":"1003","volume":"94","author":"MC Brandenburg","year":"2025","unstructured":"Brandenburg, M.C., De Loera, J.A., Meroni, C.: The best ways to slice a polytope. Math. Comp. 94, 1003\u20131042 (2025)","journal-title":"Math. Comp."},{"key":"15_CR15","unstructured":"Brose, A.E.: The combinatorics and computation of sections of polytopes. Ph.D. thesis, UC Davis (2028). (in progress)"},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12982","volume":"110","author":"G Codenotti","year":"2024","unstructured":"Codenotti, G., Freyer, A.: Lattice reduced and complete convex bodies. J. London Math. Soc. 110(4), e12982 (2024)","journal-title":"J. London Math. Soc."},{"key":"15_CR17","unstructured":"Corzatt, C.E.: Some extremal problems of number theory and geometry. Ph.D. thesis, University of Illinois at Urbana-Champaign (1974)"},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1287\/moor.1050.0169","volume":"31","author":"JA De Loera","year":"2006","unstructured":"De Loera, J.A., Hemmecke, R., K\u00f6ppe, M., Weismantel, R.: Integer polynomial optimization in fixed dimension. Math. Oper. Res. 31(1), 147\u2013153 (2006). https:\/\/doi.org\/10.1287\/moor.1050.0169","journal-title":"Math. Oper. Res."},{"issue":"4","key":"15_CR19","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/j.jsc.2003.04.003","volume":"38","author":"JA De Loera","year":"2004","unstructured":"De Loera, J.A., Hemmecke, R., Tauzer, J., Yoshida, R.: Effective lattice point counting in rational convex polytopes. J. Symbolic Comput. 38(4), 1273\u20131302 (2004)","journal-title":"J. Symbolic Comput."},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Eggleston, H.G.: Covering a three-dimensional set with sets of smaller diameter. J. Lond. Math. Soc. s1-30(1), 11\u201324 (1955)","DOI":"10.1112\/jlms\/s1-30.1.11"},{"key":"15_CR21","unstructured":"van Emde-Boas, P.: Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Report. Department of Mathematics, University of Amsterdam, Department, Univ. (1981). https:\/\/books.google.com\/books?id=tCQiHQAACAAJ"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s00454-021-00310-7","volume":"67","author":"A Freyer","year":"2022","unstructured":"Freyer, A., Henk, M.: Bounds on the lattice point enumerator via slices and projections. Discrete Comput. Geom. 67, 895\u2013918 (2022)","journal-title":"Discrete Comput. Geom."},{"issue":"7","key":"15_CR23","first-page":"3063","volume":"152","author":"A Freyer","year":"2024","unstructured":"Freyer, A., Henk, M.: Polynomial bounds in Koldobsky\u2019s discrete slicing problem. Proc. Amer. Math. Soc. 152(7), 3063\u20133074 (2024)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"6","key":"15_CR24","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1090\/S0002-9947-97-01741-8","volume":"349","author":"RJ Gardner","year":"1997","unstructured":"Gardner, R.J., Gritzmann, P.: Discrete tomography: determination of finite sets by X-rays. Trans. Amer. Math. Soc. 349(6), 2271\u20132295 (1997)","journal-title":"Trans. Amer. Math. Soc."},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s00454-005-1169-z","volume":"34","author":"RJ Gardner","year":"2005","unstructured":"Gardner, R.J., Gronchi, P., Zong, C.: Sums, projections, and sections of lattice sets, and the discrete covariogram. Discrete Comput. Geom. 34, 391\u2013409 (2005)","journal-title":"Discrete Comput. Geom."},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Giannopoulos, A., Koldobsky, A., Zvavitch, A.: Inequalities for Sections and Projections of Convex Bodies, vol.\u00a09, pp. 223\u2013256. De Gruyter (2023)","DOI":"10.1515\/9783110775389-006"},{"issue":"3","key":"15_CR27","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF02187841","volume":"7","author":"P Gritzmann","year":"1992","unstructured":"Gritzmann, P., Klee, V.: Inner and outer $$ j $$-radii of convex bodies in finite-dimensional normed spaces. Discrete Comput. Geom. 7(3), 255\u2013280 (1992). https:\/\/doi.org\/10.1007\/BF02187841","journal-title":"Discrete Comput. Geom."},{"key":"15_CR28","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1017\/S0305004100032849","volume":"53","author":"B Gr\u00fcnbaum","year":"1957","unstructured":"Gr\u00fcnbaum, B.: A simple proof of Borsuk\u2019s conjecture in three dimensions. Math. Proc. Cambridge Philos. Soc. 53, 776\u2013778 (1957)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"1","key":"15_CR29","first-page":"4","volume":"21","author":"T Jenrich","year":"2014","unstructured":"Jenrich, T., Brouwer, A.E.: A 64-dimensional counterexample to Borsuk\u2019s conjecture. Electron. J. Combin. 21(1), 4\u201329 (2014)","journal-title":"Electron. J. Combin."},{"issue":"1","key":"15_CR30","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1287\/opre.21.1.221","volume":"21","author":"RC Jeroslow","year":"1973","unstructured":"Jeroslow, R.C.: There cannot be any algorithm for integer programming with quadratic constraints. Oper. Res. 21(1), 221\u2013224 (1973). https:\/\/doi.org\/10.1287\/opre.21.1.221","journal-title":"Oper. Res."},{"key":"15_CR31","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1090\/S0273-0979-1993-00398-7","volume":"29","author":"J Kahn","year":"1993","unstructured":"Kahn, J., Kalai, G.: A counterexample to Borsuk\u2019s conjecture. Bull. Amer. Math. Soc. 29, 60\u201362 (1993)","journal-title":"Bull. Amer. Math. Soc."},{"key":"15_CR32","unstructured":"Kasprzyk, A.: Toric Fano varieties and convex polytopes. Ph.D. thesis, University of Bath (2006)"},{"issue":"5","key":"15_CR33","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.4153\/CJM-1991-058-4","volume":"43","author":"JC Lagarias","year":"1991","unstructured":"Lagarias, J.C., Ziegler, G.M.: Bounds for lattice polytopes containing a fixed number of interior points in a sublattice. Canad. J. Math. 43(5), 1022\u20131035 (1991)","journal-title":"Canad. J. Math."},{"key":"15_CR34","unstructured":"Matiyasevich, Y.: Hilbert\u2019s Tenth Problem. The MIT Press, Cambridge, MA and London (1993)"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Nayar, P., Tkocz, T.: Extremal sections and projections of certain convex bodies: a survey, vol.\u00a09, pp. 343\u2013390. De Gruyter (2023)","DOI":"10.1515\/9783110775389-008"},{"issue":"3","key":"15_CR36","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1287\/moor.1110.0503","volume":"36","author":"B Nill","year":"2011","unstructured":"Nill, B., Ziegler, G.M.: Projecting lattice polytopes without interior lattice points. Math. Oper. Res. 36(3), 462\u2013467 (2011)","journal-title":"Math. Oper. Res."},{"key":"15_CR37","doi-asserted-by":"publisher","unstructured":"Padrol, A., Pfeifle, J.: Polygons as sections of higher-dimensional polytopes. Electron. J. Combin. 22(1), P1.24 (2015). https:\/\/doi.org\/10.37236\/4315","DOI":"10.37236\/4315"},{"key":"15_CR38","first-page":"45","volume":"1","author":"J Perkal","year":"1947","unstructured":"Perkal, J.: Sur la subdivision des ensembles en parties de diam\u00e8tre inf\u00e9rieur. Colloq. Math. 1, 45 (1947)","journal-title":"Colloq. Math."},{"key":"15_CR39","first-page":"93","volume":"36","author":"S Rabinowitz","year":"1989","unstructured":"Rabinowitz, S.: A Theorem about collinear lattice points. Util. Math. 36, 93\u201395 (1989)","journal-title":"Util. Math."},{"key":"15_CR40","doi-asserted-by":"crossref","unstructured":"Regev, O., Rosen, R.: Lattice problems and norm embeddings. In: Proceedings of 38th ACM Symposium on Theory of Computing (STOC), pp. 447\u2013456 (2006)","DOI":"10.1145\/1132516.1132581"},{"key":"15_CR41","doi-asserted-by":"crossref","unstructured":"Seb\u0151, A.: An Introduction to Empty Lattice Simplices. In: Integer Programming and Combinatorial Optimization (IPCO 1999). Lecture Notes in Computer Science, vol.\u00a01610, pp. 400\u2013414. Springer (1999)","DOI":"10.1007\/3-540-48777-8_30"},{"key":"15_CR42","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.ejc.2016.05.009","volume":"58","author":"I Soprunov","year":"2016","unstructured":"Soprunov, I., Soprunova, J.: Eventual quasi-linearity of the Minkowski length. Eur. J. Combin. 58, 107\u2013117 (2016)","journal-title":"Eur. J. Combin."},{"issue":"2","key":"15_CR43","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/jsl.2015.4","volume":"80","author":"K Woods","year":"2015","unstructured":"Woods, K.: Presburger arithmetic, rational generating functions, and quasi-polynomials. J. Symb. Log. 80(2), 433\u2013449 (2015)","journal-title":"J. Symb. Log."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:15Z","timestamp":1781303655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}