{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:24:33Z","timestamp":1764588273513,"version":"3.37.3"},"reference-count":40,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002661","name":"Belgian National Fund for Scientific Research (FNRS)","doi-asserted-by":"publisher","award":["451026932"],"award-info":[{"award-number":["451026932"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1109\/focs52979.2021.00011","type":"proceedings-article","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T20:27:48Z","timestamp":1646425668000},"page":"13-24","source":"Crossref","is-referenced-by-count":8,"title":["Integer programs with bounded subdeterminants and two nonzeros per row"],"prefix":"10.1109","author":[{"given":"Samuel","family":"Fiorini","sequence":"first","affiliation":[{"name":"Université libre de Bruxelles,Brussels,Belgium"}]},{"given":"Gwenael","family":"Joret","sequence":"additional","affiliation":[{"name":"Université libre de Bruxelles,Brussels,Belgium"}]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[{"name":"Technical University of Munich,Munich,Germany"}]},{"given":"Yelena","family":"Yuditsky","sequence":"additional","affiliation":[{"name":"Université libre de Bruxelles,Brussels,Belgium"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"journal-title":"Integer programs with bounded subdeterminants and two nonzeros per row (full version)","year":"2021","author":"fiorini","key":"ref38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2012.07.001"},{"journal-title":"Quickly excluding a non-planar graph","year":"2020","author":"kawarabayashi","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2008.03.006"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.31"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806785"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.162"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.31"},{"key":"ref10","first-page":"44: 1","article-title":"Empowering the configuration-ip - new PTAS results for scheduling with setups times","volume":"124","author":"jansen","year":"2019","journal-title":"10th Innovations in Theoretical Computer Science Conference ITCS 2019"},{"journal-title":"Graphs on Surfaces","year":"2001","author":"mohar","key":"ref40"},{"journal-title":"Theory of Linear and Integer Programming","year":"1998","author":"schrijver","key":"ref11"},{"key":"ref12","volume":"24","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055473"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.250"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.12.002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-014-9601-x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582563"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1089-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45771-6_26"},{"key":"ref28","first-page":"527","article-title":"Matroid minors","volume":"1","author":"seymour","year":"1995","journal-title":"Handbook of combina-torics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582230"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0490-y"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s004930050056","article-title":"Mangoes and blueberries","volume":"19","author":"reed","year":"1999","journal-title":"COMBINATORICA"},{"journal-title":"Integer programming lattice algorithms and deterministic volume estimation","year":"2012","author":"dadush","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.101"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/19M1303873"},{"key":"ref2","first-page":"1","article-title":"Proximity results and faster algorithms for integer programming using the steinitz lemma","volume":"16","author":"eisenbrand","year":"2019","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3421750"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322287"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"johnson","key":"ref20"},{"key":"ref22","first-page":"187","article-title":"Solving the stable set problem in terms of the odd cycle packing number","volume":"29","author":"bock","year":"2014","journal-title":"34th International Conference on Foundation of Software Technology and Theoretical Computer Science ser LIPIcs Leibniz Int Proc Inform Schloss Dagstuhl Leibniz-Zent Inform"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)00173-W"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.176"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45771-6_9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.28"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.09.014"}],"event":{"name":"2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2022,2,7]]},"location":"Denver, CO, USA","end":{"date-parts":[[2022,2,10]]}},"container-title":["2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9719594\/9719683\/09719761.pdf?arnumber=9719761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T02:45:24Z","timestamp":1670381124000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9719761\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/focs52979.2021.00011","relation":{},"subject":[],"published":{"date-parts":[[2022,2]]}}}