{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T09:05:41Z","timestamp":1768640741997,"version":"3.49.0"},"reference-count":41,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/100007397","name":"Charles University","doi-asserted-by":"crossref","award":["UNCE\/SCI\/004"],"award-info":[{"award-number":["UNCE\/SCI\/004"]}],"id":[{"id":"10.13039\/100007397","id-type":"DOI","asserted-by":"crossref"}]},{"name":"GA CR","award":["19-27871X"],"award-info":[{"award-number":["19-27871X"]}]},{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["648509"],"award-info":[{"award-number":["648509"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010653","name":"Masarykova Univerzita","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010653","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1137\/20m1353502","type":"journal-article","created":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T13:05:38Z","timestamp":1653397538000},"page":"664-700","source":"Crossref","is-referenced-by-count":5,"title":["Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming"],"prefix":"10.1137","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3396-4458","authenticated-orcid":true,"given":"Timothy F.","family":"Chan","sequence":"first","affiliation":[]},{"given":"Jacob W.","family":"Cooper","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Kouteck\u00fd","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Kr\u00e1l","sequence":"additional","affiliation":[]},{"given":"Krist\u00fdna","family":"Pek\u00e1rkov\u00e1","sequence":"additional","affiliation":[]}],"member":"351","published-online":{"date-parts":[[2022,5,24]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-005-0174-1"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827502401953"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0761-5"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0049"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497318682"},{"key":"atypb6","first-page":"2801","volume-title":"Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM","author":"Chen L.","year":"2018"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"atypb8","first-page":"158","volume-title":"Proceedings of the 12th International IPCO Conference on Integer Programming and Combinatorial Optimization","author":"Cunningham W. H.","year":"2007"},{"key":"atypb9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"Cygan M.","year":"2015"},{"key":"atypb10","volume-title":"Branch-Depth: Generalizing Tree-Depth of Graphs, preprint, arXiv:1903.11988","author":"DeVos M.","year":"2019"},{"key":"atypb11","first-page":"607","volume-title":"Proceedings of the 26th International Joint Conference on Artificial Intelligence, AAAI Press","author":"Dvo\u0159\u00e1k P.","year":"2017"},{"key":"atypb12","first-page":"242","volume":"718","author":"Edmonds J.","year":"1967","journal-title":"J. Res. National Bureau of Standards"},{"key":"atypb13","volume-title":"An Algorithmic Theory of Integer Programming, preprint, arXiv:1904.01361","author":"Eisenbrand F.","year":"2019"},{"key":"atypb14","first-page":"1","volume-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming","author":"Eisenbrand F.","year":"2018"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582130"},{"key":"atypb16","unstructured":"F. V. Fomin, F. Panolan, M. S. Ramanujan, and S. Saurabh,On the optimality of pseudo-polynomial algorithms for integer programming, in the Proceedings of the 26th Annual European Symposium on Algorithms, 2018, pp. 31:1-31:13."},{"key":"atypb17","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-642-13193-6_21","volume-title":"Experimental Algorithms","author":"Gamrath G.","year":"2010"},{"key":"atypb18","volume-title":"Proceedings of the 30th AAAI conference on Artificial Intelligence","author":"Ganian R.","year":"2016"},{"key":"atypb19","first-page":"815","volume-title":"Proceedings of the 31st AAAI Conference on Artificial Intelligence","author":"Ganian R.","year":"2017"},{"key":"atypb20","series-title":"Lecture Notes in Comput. Sci. 7392","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-642-31585-5_24","volume-title":"Proceedings of the 39th International Colloquium Automata, Languages, and Programming","author":"Gaven\u010diak T.","year":"2012"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(02)00046-1"},{"key":"atypb22","volume-title":"Undergrad. Texts in Math.","author":"Halmos P.","year":"1993"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0638-z"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0490-y"},{"key":"atypb25","first-page":"319","volume-title":"Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, H. Alt and M. Habib, eds., Lecture Notes in Comput. Sci. 2607","author":"Hlin\u011bn\u00fd P.","year":"2003"},{"key":"atypb26","first-page":"470","volume-title":"Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, B. Rovan and P. Vojt\u00e1\u0161, eds., Lecture Notes in Comput. Sci. 2747","author":"Hlin\u011bn\u00fd P.","year":"2003"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.08.005"},{"key":"atypb28","series-title":"Lecture Notes in Comput","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-540-75520-3_16","volume-title":"Proceedings of the 15th Annual European Symposium","author":"Hlin\u011bn\u00fd P.","year":"2007"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/070685920"},{"key":"atypb30","first-page":"1","volume-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, I. Chatzigiannakis, C. Kaklamanis, D. Marx, and D. Sannella, eds., LIPIcs Leibniz Int. Proc. Inform. 107","author":"Jeong J.","year":"2018"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2016.08.005"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2017.0797"},{"key":"atypb34","first-page":"1","volume-title":"Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science","author":"Knop D.","year":"2017"},{"key":"atypb35","first-page":"1","volume-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming","author":"Kouteck\u00fd M.","year":"2018"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0524"},{"key":"atypb38","volume-title":"Oxford Grad. Texts Math. 21","author":"Oxley J.","year":"2011"},{"key":"atypb39","doi-asserted-by":"crossref","unstructured":"F. Vanderbeck and L. A. Wolsey,Reformulation and decomposition of integer programs, in 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art, Springer, New York, 2010, pp. 431-502,https:\/\/doi.org\/10.1007\/978-3-540-68279-0_13.","DOI":"10.1007\/978-3-540-68279-0_13"},{"key":"atypb40","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/978-3-642-38171-3_31","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"Wang J.","year":"2013"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.1.98"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T20:45:55Z","timestamp":1709066755000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1353502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,24]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["10.1137\/20M1353502"],"URL":"https:\/\/doi.org\/10.1137\/20m1353502","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,24]]}}}