{"id":"https://openalex.org/W3035520095","doi":"https://doi.org/10.1145/3357713.3384250","title":"An exponential time parameterized algorithm for planar disjoint paths","display_name":"An exponential time parameterized algorithm for planar disjoint paths","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W3035520095","doi":"https://doi.org/10.1145/3357713.3384250","mag":"3035520095"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384250","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384250","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384250","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384250","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of California at Santa Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045302816","display_name":"Pranabendu Misra","orcid":"https://orcid.org/0000-0002-7086-5590"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pranabendu Misra","raw_affiliation_strings":["MPI-INF, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MPI-INF, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["University of Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["IMSc, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IMSc, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082025487","display_name":"Meirav Zehavi","orcid":"https://orcid.org/0000-0002-3636-5322"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Meirav Zehavi","raw_affiliation_strings":["Ben-Gurion University of the Negev, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1307","last_page":"1316"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8474204540252686},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6601036787033081},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6211183667182922},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.6184465289115906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6141700744628906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.539758026599884},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41750848293304443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26822686195373535},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2201279103755951},{"id":"https://openalex.org/keywords/computer-graphics","display_name":"Computer graphics (images)","score":0.09474000334739685}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8474204540252686},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6601036787033081},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6211183667182922},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.6184465289115906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6141700744628906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.539758026599884},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41750848293304443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26822686195373535},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2201279103755951},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.09474000334739685},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3357713.3384250","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384250","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384250","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.mpg.de:item_3279918","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0007-D2AA-C","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STOC '20","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:3149994998","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.1145/3357713.3384250","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384250","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384250","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1533455792","display_name":null,"funder_award_id":"677651","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G267355722","display_name":null,"funder_award_id":"DST/SJF/MSA-01/2017-18","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"},{"id":"https://openalex.org/G5730270640","display_name":null,"funder_award_id":"2018302","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G6299013311","display_name":null,"funder_award_id":"2017-18","funder_id":"https://openalex.org/F4320320719","funder_display_name":"Department of Science and Technology, Ministry of Science and Technology, India"},{"id":"https://openalex.org/G6774542772","display_name":null,"funder_award_id":"819416","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7702557058","display_name":null,"funder_award_id":"1176/18","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320719","display_name":"Department of Science and Technology, Ministry of Science and Technology, India","ror":"https://ror.org/0101xrq71"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320323078","display_name":"Universitetet i Bergen","ror":"https://ror.org/03zga2b32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3035520095.pdf","grobid_xml":"https://content.openalex.org/works/W3035520095.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1550254812","https://openalex.org/W1967565181","https://openalex.org/W1976463682","https://openalex.org/W1998811202","https://openalex.org/W2005079828","https://openalex.org/W2017434030","https://openalex.org/W2035409201","https://openalex.org/W2046069847","https://openalex.org/W2050579693","https://openalex.org/W2060632898","https://openalex.org/W2085348754","https://openalex.org/W2112406764","https://openalex.org/W2115589427","https://openalex.org/W2115607023","https://openalex.org/W2158584754","https://openalex.org/W2183582012","https://openalex.org/W2202596972","https://openalex.org/W2253740506","https://openalex.org/W2278828694","https://openalex.org/W2295563127","https://openalex.org/W2297903070","https://openalex.org/W2401610261","https://openalex.org/W2550041253","https://openalex.org/W2563156040","https://openalex.org/W2563767922","https://openalex.org/W2569646339","https://openalex.org/W2785736399","https://openalex.org/W2803303081","https://openalex.org/W2803460775","https://openalex.org/W2890355536","https://openalex.org/W2949666389","https://openalex.org/W2962856411","https://openalex.org/W2963908100","https://openalex.org/W2963966355","https://openalex.org/W2988480584","https://openalex.org/W4210631930","https://openalex.org/W4246499806"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W4255576661","https://openalex.org/W1516574938","https://openalex.org/W2625725254","https://openalex.org/W1034070228"],"abstract_inverted_index":{"In":[0,52],"the":[1,5,31,42,72,75,78,91,105,125,147,155,162,165,176],"Disjoint":[2,70,116,140],"Paths":[3,117,141],"problem,":[4],"input":[6,79,166],"is":[7,33,81,88,154,168],"an":[8],"undirected":[9],"graph":[10,80,167],"G":[11],"on":[12,90,118,142],"n":[13,66],"vertices":[14],"and":[15,30,122],"a":[16,57,171],"set":[17],"of":[18,74,124,149,164,178],"k":[19,28,36],"vertex":[20],"pairs,":[21],"{s":[22],"i":[23,25,47,50],",t":[24],"}":[26],"i=1":[27],",":[29],"task":[32],"to":[34,48,83,159],"find":[35],"pairwise":[37],"vertex-disjoint":[38],"paths":[39],"such":[40],"that":[41,161],"i\u2019th":[43],"path":[44],"connects":[45],"s":[46],"t":[49],".":[51],"this":[53],"paper,":[54],"we":[55],"give":[56],"parameterized":[58,157],"algorithm":[59,87,138,153,158],"with":[60],"running":[61],"time":[62],"2":[63],"O(k":[64],"2)":[65],"O(1)":[67],"for":[68,96,115,139],"Planar":[69],"Paths,":[71],"variant":[73],"problem":[76],"where":[77],"required":[82],"be":[84],"planar.":[85],"Our":[86],"based":[89,108],"unique":[92],"linkage/treewidth":[93],"reduction":[94],"theorem":[95],"planar":[97,120,144],"graphs":[98],"by":[99,111,130],"Adler":[100],"et":[101,132],"al.":[102,133],"[JCTB":[103],"2017],":[104],"algebraic":[106],"co-homology":[107],"technique":[109],"developed":[110,129],"Schrijver":[112],"[SICOMP":[113],"1994]":[114],"directed":[119,143],"graphs,":[121],"one":[123],"key":[126],"combinatorial":[127],"insights":[128],"Cygan":[131],"[FOCS":[134],"2013]":[135],"in":[136,170],"their":[137],"graphs.":[145],"To":[146],"best":[148],"our":[150,152],"knowledge":[151],"first":[156],"exploit":[160],"treewidth":[163],"small":[169],"way":[172],"completely":[173],"different":[174],"from":[175],"use":[177],"dynamic":[179],"programming.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3}],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2025-10-10T00:00:00"}