{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T04:13:26Z","timestamp":1742012006811,"version":"3.38.0"},"reference-count":32,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100012226","name":"European Research Council","doi-asserted-by":"publisher","award":["101039913","948057","819416","715744","677651"],"award-info":[{"award-number":["101039913","948057","819416","715744","677651"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001742","name":"United States\u2013Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2018302"],"award-info":[{"award-number":["2018302"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1176\/18"],"award-info":[{"award-number":["1176\/18"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swarnajayanti Fellowship","award":["DST\/SJF\/MSA-01\/2017-18"],"award-info":[{"award-number":["DST\/SJF\/MSA-01\/2017-18"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2025,4,30]]},"DOI":"10.1137\/20m1355902","type":"journal-article","created":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T08:18:46Z","timestamp":1741940326000},"page":"321-418","source":"Crossref","is-referenced-by-count":0,"title":["An Exponential Time Parameterized Algorithm for Planar Disjoint Paths"],"prefix":"10.1137","volume":"54","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of California, Santa Barbara, CA 93106 USA."}]},{"given":"Pranabendu","family":"Misra","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, Siruseri, Tamil Nadu 603103, India."}]},{"given":"Michal","family":"Pilipczuk","sequence":"additional","affiliation":[{"name":"Institute of Informatics, University of Warsaw, Warsaw 02-097, Poland."}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[{"name":"The Institute of Mathematical Sciences, HBNI, Chennai, Tamil Nadu 600113, India; University of Bergen, 5007 Bergen, Norway; and IRL 2000 ReLaX, Chennai Mathematical Institute, Siruseri, Tamil Nadu 603103, India."}]},{"given":"Meirav","family":"Zehavi","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Beersheba, Israel."}]}],"member":"351","published-online":{"date-parts":[[2025,3,14]]},"reference":[{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2016.10.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.12.010"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2973749"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2820609"},{"key":"ref8","series-title":"LIPIcs 40","first-page":"187","volume-title":"Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques (APPROX\/RANDOM 2015)","author":"Chuzhoy J.","year":"2015"},{"key":"ref10","first-page":"STOC17-189","volume":"5","author":"Chuzhoy J.","year":"2020","journal-title":"SIAM J. Comput."},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00265"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1101821.1101823"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-008-2140-4"},{"key":"ref18","series-title":"Grad Texts in Math 173","volume-title":"Graph Theory","author":"Diestel R.","year":"2005","edition":"3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0405009"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3154833"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"ref23","series-title":"Algorithms and Combinatorics 9","first-page":"49","volume-title":"Paths, Flows and VLSI-Layout","author":"Frank A.","year":"1990"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/net.1975.5.1.45"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.07.004"},{"key":"ref33","first-page":"129","volume":"2","author":"Kramer M. R.","year":"1984","journal-title":"Adv. Comput. Res."},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41422-0_20"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/16M1104834"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1061425.1061430"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.56021\/9780801866890"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322048"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3239560"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.12.007"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1073"},{"key":"ref44","volume":"3","author":"Scheffler P.","year":"1994","journal-title":"A Practical Linear Time Algorithm for Disjoint Paths in Graphs with Bounded Tree-Width"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792224061"},{"key":"ref46","series-title":"Algorithms Combin. 24","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"Schrijver A.","year":"2003"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T08:18:54Z","timestamp":1741940334000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1355902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,14]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4,30]]}},"alternative-id":["10.1137\/20M1355902"],"URL":"https:\/\/doi.org\/10.1137\/20m1355902","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,14]]}}}