{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:23Z","timestamp":1781305043215,"version":"3.54.1"},"publisher-location":"Cham","reference-count":25,"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_11","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:59Z","timestamp":1781303699000},"page":"158-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Integer Programs That Look Like Paths"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1695-0188","authenticated-orcid":false,"given":"Marcin","family":"Bria\u0144ski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6215-066X","authenticated-orcid":false,"given":"Alexandra","family":"Lassota","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3539-6431","authenticated-orcid":false,"given":"Krist\u00fdna","family":"Pek\u00e1rkov\u00e1","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7891-1988","authenticated-orcid":false,"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9758-9620","authenticated-orcid":false,"given":"Janina","family":"Reuter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welfare 6(2), 157\u2013165 (1989)","journal-title":"Soc. Choice Welfare"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"11_CR3","unstructured":"Cslovjecsek, J., Eisenbrand, F., Pilipczuk, M., Venzin, M., Weismantel, R.: Efficient sequential and parallel algorithms for multistage stochastic integer programming using proximity. In: Proceedings of the 29th Annual European Symposium on Algorithms, ESA, vol.\u00a0204, pp. 33:1\u201333:14 (2021)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Eiben, E., Ganian, R., Knop, D., Ordyniak, S.: Unary integer linear programming with structural restrictions. In: 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 1284\u20131290 (2018)","DOI":"10.24963\/ijcai.2018\/179"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-030-17953-3_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"E Eiben","year":"2019","unstructured":"Eiben, E., Ganian, R., Knop, D., Ordyniak, S., Pilipczuk, M., Wrochna, M.: Integer programming and incidence treedepth. In: Lodi, A., Nagarajan, V. (eds.) IPCO 2019. LNCS, vol. 11480, pp. 194\u2013204. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_15"},{"key":"11_CR6","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K., Kouteck\u00fd, M., Levin, A., Onn, S.: An algorithmic theory of integer programming (2019)"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10559-023-00573-3","volume":"59","author":"T Ermolieva","year":"2023","unstructured":"Ermolieva, T., et al.: Connections between robust statistical estimation, robust decision-making with two-stage stochastic optimization, and robust machine learning problems. Cybern. Syst. Anal. 59(3), 385\u2013397 (2023)","journal-title":"Cybern. Syst. Anal."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph layout problems parameterized by vertex cover. In: Proceedings of the 19th International Symposium on Algorithms and Computation, ISAAC, pp. 294\u2013305 (2008)","DOI":"10.1007\/978-3-540-92182-0_28"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.dam.2017.02.010","volume":"248","author":"J Fiala","year":"2018","unstructured":"Fiala, J., Gaven\u010diak, T., Knop, D., Kouteck\u00fd, M., Kratochv\u00edl, J.: Parameterized complexity of distance labeling and uniform channel assignment problems. Disc. Appl. Math. 248, 46\u201355 (2018)","journal-title":"Disc. Appl. Math."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.artint.2017.12.006","volume":"257","author":"R Ganian","year":"2018","unstructured":"Ganian, R., Ordyniak, S.: The complexity landscape of decompositional parameters for ILP. Artif. Intell. 257, 61\u201371 (2018)","journal-title":"Artif. Intell."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Ganian, R., Ordyniak, S., Ramanujan, M.S.: Going beyond primal treewidth for (M)ILP. In: 31st AAAI Conference on Artificial Intelligence, pp. 815\u2013821. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10644"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Gaven\u010diak, T., Kouteck\u00fd, M., Knop, D.: Integer programming in parameterized complexity: five miniatures. Disc. Optim. 44(Part 1), 100596 (2022)","DOI":"10.1016\/j.disopt.2020.100596"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Rothvoss, T.: Polynomiality for bin packing with a constant number of item types. J. ACM 67(6), 38:1\u201338:21 (2020)","DOI":"10.1145\/3421750"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for CLOSEST STRING and related problems. Algorithmica 37(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"11_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10107-011-0490-y","volume":"137","author":"R Hemmecke","year":"2013","unstructured":"Hemmecke, R., Onn, S., Romanchuk, L.: n-fold integer programming in cubic time. Math. Program. 137(1\u20132), 325\u2013341 (2013)","journal-title":"Math. Program."},{"issue":"2\u20133","key":"11_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10107-002-0322-1","volume":"94","author":"R Hemmecke","year":"2003","unstructured":"Hemmecke, R., Schultz, R.: Decomposition of test sets in stochastic integer programming. Math. Program. 94(2\u20133), 323\u2013341 (2003)","journal-title":"Math. Program."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/978-3-662-48350-3_65","volume-title":"Algorithms - ESA 2015","author":"BMP Jansen","year":"2015","unstructured":"Jansen, B.M.P., Kratsch, S.: A structural approach to kernels for ILPs: treewidth and total unimodularity. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 779\u2013791. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_65"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10107-021-01694-3","volume":"195","author":"K Jansen","year":"2022","unstructured":"Jansen, K., Klein, K., Maack, M., Rau, M.: Empowering the configuration-IP: new PTAS results for scheduling with setup times. Math. Program. 195(1), 367\u2013401 (2022)","journal-title":"Math. Program."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Jr. Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","DOI":"10.1287\/moor.8.4.538"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Klein, K., Polak, A., Rohwedder, L.: On minimizing tardy processing time, max-min skewed convolution, and triangular structured ILPs. In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, 22\u201325 January 2023, pp. 2947\u20132960. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch112"},{"issue":"3","key":"11_CR21","first-page":"22","volume":"20","author":"K Klein","year":"2024","unstructured":"Klein, K., Reuter, J.: Collapsing the tower - on the complexity of multistage stochastic IPs. ACM Trans. Algor. 20(3), 22 (2024)","journal-title":"ACM Trans. Algor."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Knop, D., Kouteck\u00fd, M., Mnich, M.: Voting and bribing in single-exponential time. ACM Trans. Econ. Comput. 8(3), 12:1\u201312:28 (2020)","DOI":"10.1145\/3396855"},{"key":"11_CR23","unstructured":"Lassota, A., Ligthart, K.: Parameterized algorithms for matching integer programs with additional rows and columns. In: ICALP. LIPIcs, vol.\u00a0334, pp. 112:1\u2013112:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025)"},{"key":"11_CR24","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity \u2013 Graphs, Structures, and Algorithms","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity \u2013 Graphs, Structures, and Algorithms. AC, vol. 28. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4"},{"key":"11_CR25","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency. Algor. Comb. 24 (2003)"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:35:05Z","timestamp":1781303705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_11","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"}}]}}