{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:14:36Z","timestamp":1781345676186,"version":"3.54.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030179526","type":"print"},{"value":"9783030179533","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17953-3_15","type":"book-chapter","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:25:20Z","timestamp":1556753120000},"page":"194-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Integer Programming and Incidence Treedepth"],"prefix":"10.1007","author":[{"given":"Eduard","family":"Eiben","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Ganian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Du\u0161an","family":"Knop","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Ordyniak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micha\u0142","family":"Pilipczuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcin","family":"Wrochna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,4,13]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Altmanov\u00e1, K., Knop, D., Kouteck\u00fd, M.: Evaluating and tuning n-fold integer programming. In: D\u2019Angelo, G. (ed.) 17th International Symposium on Experimental Algorithms, SEA 2018, L\u2019Aquila, Italy, 27\u201329 June 2018. LIPIcs, vol. 103, pp. 10:1\u201310:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2018.10","DOI":"10.4230\/LIPIcs.SEA.2018.10"},{"key":"15_CR2","unstructured":"Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.): 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, Prague, Czech Republic, 9\u201313 July 2018. LIPIcs, vol. 107. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-076-7"},{"key":"15_CR3","unstructured":"Chen, L., Xu, L., Shi, W.: On the graver basis of block-structured integer programming. CoRR abs\/1805.03741 (2018). http:\/\/arxiv.org\/abs\/1805.03741"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"De Loera, J.A., Hemmecke, R., K\u00f6ppe, M.: Algebraic and Geometric Ideas in the Theory of Discrete Optimization. MOS-SIAM Series on Optimization, vol. 14. SIAM (2013). https:\/\/doi.org\/10.1137\/1.9781611972443","DOI":"10.1137\/1.9781611972443"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S1574-6526(06)80011-8","volume-title":"Handbook of Constraint Programming","author":"Rina Dechter","year":"2006","unstructured":"Dechter, R.: Chapter 7 - tractable structures for constraint satisfaction problems. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol. 2, pp. 209\u2013244. Elsevier (2006). https:\/\/doi.org\/10.1016\/S1574-6526(06)80011-8"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Knop, D., Ordyniak, S.: Unary integer linear programming with structural restrictions. In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, Stockholm, Sweden, 13\u201319 July 2018, pp. 1284\u20131290. ijcai.org (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/179","DOI":"10.24963\/ijcai.2018\/179"},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Eisenbrand, F., Hunkenschr\u00f6der, C., Klein, K.: Faster algorithms for integer programs with block structure. In: Chatzigiannakis et al. [2], pp. 49:1\u201349:13. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.49","DOI":"10.4230\/LIPIcs.ICALP.2018.49"},{"key":"15_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-13036-6_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"R Hemmecke","year":"2010","unstructured":"Hemmecke, R., K\u00f6ppe, M., Weismantel, R.: A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 219\u2013229. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13036-6_17"},{"issue":"1\u20132","key":"15_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-13036-6_17","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). https:\/\/doi.org\/10.1007\/978-3-642-13036-6_17","journal-title":"Math. Program."},{"issue":"2","key":"15_CR11","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), 323\u2013341 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0322-1","journal-title":"Math. Program."},{"key":"15_CR12","unstructured":"Jansen, K., Lassota, A., Rohwedder, L.: Near-linear time algorithm for n-fold ILPs via color coding. CoRR abs\/1811.00950 (2018)"},{"key":"15_CR13","unstructured":"Klein, K.: About the complexity of two-stage stochastic IPs. CoRR abs\/1901.01135 (2019). http:\/\/arxiv.org\/abs\/1901.01135"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Kouteck\u00fd, M., Levin, A., Onn, S.: A parameterized strongly polynomial algorithm for block structured integer programs. In: Chatzigiannakis et al. [2], pp. 85:1\u201385:14. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.85","DOI":"10.4230\/LIPIcs.ICALP.2018.85"},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/moor.8.4.538","journal-title":"Math. Oper. Res."},{"key":"15_CR16","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27875-4","volume-title":"Sparsity - Graphs, Structures, and Algorithms","author":"J Ne\u0161et\u0159il","year":"2012","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity - Graphs, Structures, and Algorithms. AC, vol. 28. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27875-4"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Onn, S.: Nonlinear Discrete Optimization: An Algorithmic Theory (Zurich Lectures in Advanced Mathematics). European Mathematical Society Publishing House (2010)","DOI":"10.4171\/093"}],"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-030-17953-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:42:37Z","timestamp":1709815357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17953-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030179526","9783030179533"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17953-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Ann Arbor, MI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/umich.edu\/~ipco2019conf\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}