{"id":"https://openalex.org/W4226434845","doi":"https://doi.org/10.1137/19m1304088","title":"A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs","display_name":"A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs","publication_year":2022,"publication_date":"2022-04-01","ids":{"openalex":"https://openalex.org/W4226434845","doi":"https://doi.org/10.1137/19m1304088"},"language":"en","primary_location":{"id":"doi:10.1137/19m1304088","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1304088","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarland Informatics Campus, Germany"],"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarland Informatics Campus, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"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":"Marcin Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","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":"Michal Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012849997"],"corresponding_institution_ids":["https://openalex.org/I4210128801"],"apc_list":null,"apc_paid":null,"fwci":0.1509,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47511181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"51","issue":"2","first_page":"254","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8363432884216309},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7464100122451782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.690669059753418},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6823170185089111},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.6191956400871277},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5611668825149536},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5549277067184448},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5002548694610596},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.43939870595932007},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42936933040618896},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4246056079864502},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36118102073669434},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33524948358535767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2179303765296936}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8363432884216309},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7464100122451782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.690669059753418},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6823170185089111},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.6191956400871277},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5611668825149536},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5549277067184448},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5002548694610596},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.43939870595932007},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42936933040618896},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4246056079864502},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36118102073669434},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33524948358535767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2179303765296936},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/19m1304088","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1304088","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:16943","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.5","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:1707.02190","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1707.02190","pdf_url":"https://arxiv.org/pdf/1707.02190","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.tue.nl:publications/b142044e-3414-498f-89ad-f9b6791c6622","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/b142044e-3414-498f-89ad-f9b6791c6622","pdf_url":"https://pure.tue.nl/ws/files/358573340/LIPIcs.ESA.2022.5_1_.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Alkema, H, Berg, M D, Monemizadeh, M & Theocharous, L 2022, TSP in a Simple Polygon. in S Chechik, G Navarro, E Rotenberg & G Herman (eds), 30th Annual European Symposium on Algorithms, ESA 2022., 5, Leibniz International Proceedings in Informatics, LIPIcs, vol. 244, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 5:1-5:14, 30th Annual European Symposium on Algorithms, ESA 2022, Berlin/Potsdam, Germany, 5/09/22. https://doi.org/10.4230/LIPIcs.ESA.2022.5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.4230/lipics.esa.2022.5","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2022.5","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:16943","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.5","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G1399324874","display_name":null,"funder_award_id":"024.002.00","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G1468631800","display_name":null,"funder_award_id":"START","funder_id":"https://openalex.org/F4320321042","funder_display_name":"Fundacja na rzecz Nauki Polskiej"},{"id":"https://openalex.org/G3413111253","display_name":null,"funder_award_id":"NETWORKS","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G3514550006","display_name":null,"funder_award_id":"Centre","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4956428346","display_name":null,"funder_award_id":"Horizon 2020 research and innovatio","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5244030528","display_name":null,"funder_award_id":"714704","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G629491556","display_name":null,"funder_award_id":"(NWO)","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7584590778","display_name":null,"funder_award_id":"725978","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G7723633313","display_name":null,"funder_award_id":"UMO-2013/11/D/ST6/03073","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"},{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G8040201784","display_name":null,"funder_award_id":"280152","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8454853383","display_name":"Parameterized complexity and the search for tight complexity results","funder_award_id":"280152","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G971706015","display_name":"Systematic mapping of the complexity landscape of hard algorithmic graph problems","funder_award_id":"725978","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321042","display_name":"Fundacja na rzecz Nauki Polskiej","ror":"https://ror.org/048zd9m77"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W95416648","https://openalex.org/W790236442","https://openalex.org/W836309381","https://openalex.org/W1669562806","https://openalex.org/W1791386552","https://openalex.org/W1982089707","https://openalex.org/W1986916307","https://openalex.org/W2018419361","https://openalex.org/W2019137761","https://openalex.org/W2045749371","https://openalex.org/W2048794017","https://openalex.org/W2132169470","https://openalex.org/W2144241285","https://openalex.org/W2154257711","https://openalex.org/W2158584754","https://openalex.org/W2165094933","https://openalex.org/W2242234494","https://openalex.org/W2266863926","https://openalex.org/W2415335518","https://openalex.org/W2496893526","https://openalex.org/W2551041103","https://openalex.org/W2570206580","https://openalex.org/W2803460775","https://openalex.org/W2914414140","https://openalex.org/W2950450493","https://openalex.org/W2951996037","https://openalex.org/W2962856411","https://openalex.org/W2963232826","https://openalex.org/W2989902795","https://openalex.org/W4232845306","https://openalex.org/W4241892047","https://openalex.org/W4252655663"],"related_works":["https://openalex.org/W4376138746","https://openalex.org/W4389782626","https://openalex.org/W2361554335","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2359992618","https://openalex.org/W4200179302","https://openalex.org/W4309336419","https://openalex.org/W2946024655","https://openalex.org/W2620231896"],"abstract_inverted_index":{"There":[0],"are":[1,67],"numerous":[2],"examples":[3],"of":[4,13,17,50,85,95,126],"the":[5,11,18,40,72,82,92,100,124,138],"so-called":[6],"\u201csquare":[7],"root":[8],"phenomenon\u201d":[9],"in":[10,38,47,88,110],"field":[12],"parameterized":[14,23,83],"algorithms:":[15],"many":[16],"most":[19],"fundamental":[20],"graph":[21],"problems,":[22],"by":[24,75],"some":[25],"natural":[26],"parameter":[27],"$k$,":[28],"become":[29],"significantly":[30],"simpler":[31],"when":[32],"restricted":[33],"to":[34,69],"planar":[35,89,119,147],"graphs":[36,148],"and":[37,128],"particular":[39],"best":[41],"possible":[42],"running":[43,140],"time":[44,111,141],"is":[45,97],"exponential":[46],"$\\mathcal{O}(\\sqrt{k})$":[48],"instead":[49],"$\\mathcal{O}(k)$":[51],"(modulo":[52],"standard":[53],"complexity":[54,84],"assumptions).":[55],"We":[56,80,102],"consider":[57],"a":[58,76],"classic":[59],"optimization":[60],"problem":[61,87],"Subset":[62,105],"Traveling":[63],"Salesman,":[64],"where":[65,91],"we":[66],"asked":[68],"visit":[70],"all":[71],"terminals":[73,96],"$T$":[74],"minimum-weight":[77],"closed":[78],"walk.":[79],"investigate":[81],"this":[86],"graphs,":[90],"number":[93],"$k=|T|$":[94],"regarded":[98],"as":[99],"parameter.":[101],"show":[103],"that":[104,142],"TSP":[106],"can":[107],"be":[108],"solved":[109],"$2^{\\mathcal{O}(\\sqrt{k}\\log":[112],"k)}\\cdot":[113],"n^{\\mathcal{O}(1)}$":[114],"even":[115],"on":[116,145],"edge-weighted":[117],"directed":[118],"graphs.":[120],"This":[121],"improves":[122],"upon":[123],"algorithm":[125],"Klein":[127],"Marx":[129],"[SODA":[130],"2014,":[131,134],"SIAM,":[132],"Philadelphia,":[133],"pp.":[135],"1812--1830]":[136],"with":[137,149],"same":[139],"worked":[143],"only":[144],"undirected":[146],"polynomially":[150],"large":[151],"integer":[152],"weights.":[153]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2022-05-05T00:00:00"}