{"id":"https://openalex.org/W4415141367","doi":"https://doi.org/10.2139/ssrn.7616312","title":"Pathfinding in Self-Deleting Graphs","display_name":"Pathfinding in Self-Deleting Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W4415141367","doi":"https://doi.org/10.2139/ssrn.7616312"},"language":"en","primary_location":{"id":"doi:10.2139/ssrn.7616312","doi":"https://doi.org/10.2139/ssrn.7616312","is_oa":true,"landing_page_url":"https://doi.org/10.2139/ssrn.7616312","pdf_url":null,"source":{"id":"https://openalex.org/S4210172589","display_name":"SSRN Electronic Journal","issn_l":"1556-5068","issn":["1556-5068"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1318003438","host_organization_name":"RELX Group (Netherlands)","host_organization_lineage":["https://openalex.org/I1318003438"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.2139/ssrn.7616312","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Michal Dvo\u0159\u00e1k","orcid":"https://orcid.org/0000-0002-5048-773X","observed_orcids":["https://orcid.org/0000-0002-5048-773X"]},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Michal Dvo\u0159\u00e1k","raw_affiliation_strings":["Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-5048-773X","affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Dusan Knop","orcid":"https://orcid.org/0000-0003-2588-5709","observed_orcids":["https://orcid.org/0000-0003-2588-5709"]},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Dusan Knop","raw_affiliation_strings":["Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0003-2588-5709","affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006649123","display_name":"Michal Opler","orcid":"https://orcid.org/0000-0002-4389-5807","observed_orcids":["https://orcid.org/0000-0002-4389-5807"]},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Michal Opler","raw_affiliation_strings":["Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101982410","display_name":"Jan Pokorn\u00fd","orcid":"https://orcid.org/0000-0003-3164-0791","observed_orcids":["https://orcid.org/0000-0003-3164-0791"]},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Pokorn\u00fd","raw_affiliation_strings":["Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062803495","display_name":"Ond\u0159ej Such\u00fd","orcid":"https://orcid.org/0000-0002-7236-8336","observed_orcids":["https://orcid.org/0000-0002-7236-8336"]},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ond\u0159ej Such\u00fd","raw_affiliation_strings":["Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064125227","display_name":"Krisztina Szil\u00e1gyi","orcid":"https://orcid.org/0000-0003-3570-0528","observed_orcids":["https://orcid.org/0000-0003-3570-0528"]},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Krisztina Szil\u00e1gyi","raw_affiliation_strings":["Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Czech Technical University in Prague, Thakurova 2077/7, Prague 6, 16629, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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.9970999956130981,"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.0026000000070780516,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/path-finding","display_name":"path finding","score":0.7599999904632568},{"id":"https://openalex.org/keywords/dynamic-graphs","display_name":"dynamic graphs","score":0.6269999742507935},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8579999804496765},{"id":"https://openalex.org/keywords/w-1-completeness","display_name":"W[1]-completeness","score":0.921999990940094},{"id":"https://openalex.org/keywords/fixed-parameter-tractability","display_name":"fixed-parameter tractability","score":0.9559999704360962},{"id":"https://openalex.org/keywords/polynomial-kernel","display_name":"polynomial kernel","score":0.8330000042915344},{"id":"https://openalex.org/keywords/outerplanar-graphs","display_name":"outerplanar graphs","score":0.859000027179718},{"id":"https://openalex.org/keywords/bipartite-graphs","display_name":"bipartite graphs","score":0.7749999761581421},{"id":"https://openalex.org/keywords/tree-depth","display_name":"tree depth","score":0.9110000133514404},{"id":"https://openalex.org/keywords/vertex-cover-number","display_name":"vertex cover number","score":0.7950000166893005},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"feedback vertex set","score":0.9120000004768372}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7642999887466431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6104999780654907},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6078000068664551},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5906999707221985},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5777999758720398},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.5766000151634216},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4650000035762787},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.40709999203681946},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.39649999141693115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3935999870300293},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.36399999260902405},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3571000099182129},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.35499998927116394},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.30979999899864197},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.289900004863739},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.28360000252723694},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.2833999991416931},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.27489998936653137},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2676999866962433},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.25130000710487366}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.2139/ssrn.7616312","doi":"https://doi.org/10.2139/ssrn.7616312","is_oa":true,"landing_page_url":"https://doi.org/10.2139/ssrn.7616312","pdf_url":null,"source":{"id":"https://openalex.org/S4210172589","display_name":"SSRN Electronic Journal","issn_l":"1556-5068","issn":["1556-5068"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1318003438","host_organization_name":"RELX Group (Netherlands)","host_organization_lineage":["https://openalex.org/I1318003438"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},{"id":"pmh:oai:arXiv.org:2507.12047","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2507.12047","pdf_url":"https://arxiv.org/pdf/2507.12047","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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:drops-oai.dagstuhl.de:24927","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol359-isaac2025/LIPIcs.ISAAC.2025.19/LIPIcs.ISAAC.2025.19.pdf","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2507.12047","doi":"https://doi.org/10.48550/arxiv.2507.12047","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2507.12047","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.isaac.2025.19","doi":"https://doi.org/10.4230/lipics.isaac.2025.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.isaac.2025.19","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"doi:10.4230/lipics.isaac.2025.28","doi":"https://doi.org/10.4230/lipics.isaac.2025.28","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.isaac.2025.28","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.2139/ssrn.7616312","doi":"https://doi.org/10.2139/ssrn.7616312","is_oa":true,"landing_page_url":"https://doi.org/10.2139/ssrn.7616312","pdf_url":null,"source":{"id":"https://openalex.org/S4210172589","display_name":"SSRN Electronic Journal","issn_l":"1556-5068","issn":["1556-5068"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1318003438","host_organization_name":"RELX Group (Netherlands)","host_organization_lineage":["https://openalex.org/I1318003438"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3697738339","display_name":null,"funder_award_id":"SGS23/205/OHK3/3T/18","funder_id":"https://openalex.org/F4320309972","funder_display_name":"\u010cesk\u00e9 Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Praze"},{"id":"https://openalex.org/G6758225026","display_name":"Green Segment Routing","funder_award_id":"461207633","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320309972","display_name":"\u010cesk\u00e9 Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Praze","ror":"https://ror.org/03kqpb082"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415141367.pdf","grobid_xml":"https://content.openalex.org/works/W4415141367.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2565777450","https://openalex.org/W2025304499","https://openalex.org/W7095664860","https://openalex.org/W6922680874","https://openalex.org/W7222713967","https://openalex.org/W2951916654","https://openalex.org/W2035019160","https://openalex.org/W3003329734","https://openalex.org/W3209831531","https://openalex.org/W2899023405"],"abstract_inverted_index":{"In":[0],"this":[1,214],"paper,":[2],"we":[3,24,68,81,178,207,241,273],"study":[4,25,274],"the":[5,19,51,61,64,122,149,152,163,180,186,192,195,203,257,275,281,291,296,300,306,309,317,332,335,361],"problem":[6,67,181,301,336],"of":[7,37,53,151,189,194,202,230,259,264,278,283,293,295,308,368],"pathfinding":[8],"on":[9,18,270,360],"traversal-dependent":[10],"graphs,":[11],"i.e.,":[12],"graphs":[13],"whose":[14],"edges":[15,54],"change":[16],"depending":[17],"previously":[20],"visited":[21],"vertices.In":[22],"particular,":[23],"\\emph{self-deleting":[26],"graphs},":[27],"introduced":[28],"by":[29,148,162,182,227,256,305,340,347],"Carmesin":[30],"et":[31],"al.":[32],"(JoCS":[33],"2023)~\\cite{carmesin2023hamiltonian},":[34],"which":[35],"consist":[36],"a":[38,43,71,86,95,199,228,233,251,325],"graph":[39,73,124],"$G=(V,":[40],"E)$":[41],"and":[42,74,78,80,134,155,171,191,232,267,350],"function":[44],"$f\\colon":[45],"V\\rightarrow":[46],"2^E$,":[47],"where":[48],"$f(v)$":[49,107,190,285],"is":[50,118,125,145,286],"set":[52,169],"that":[55,99,116,143,156],"will":[56],"be":[57],"deleted":[58],"after":[59,108],"visiting":[60,109],"vertex":[62,113,140,164,168,260,352],"$v$.In":[63],"\\textsc{(Shortest)}":[65],"\\SDpath":[66,117],"are":[69,82,159],"given":[70,96,123],"self-deleting":[72],"its":[75],"vertices":[76,294],"$s$":[77,89],"$t$,":[79],"asked":[83],"to":[84,90,174,213,221],"find":[85],"path":[87,154],"from":[88],"$t$":[91],"(of":[92],"at":[93,287],"most":[94,288,367],"length),":[97],"such":[98,236],"it":[100,312,321,343],"does":[101,248,322],"not":[102,249,323],"traverse":[103],"an":[104],"edge":[105],"in":[106,290],"$v$":[110],"for":[111,138,366],"any":[112],"$v$.We":[114,141],"prove":[115],"\\NP-hard":[119],"even":[120,254],"if":[121],"outerplanar,":[126],"bipartite,":[127],"has":[128],"maximum":[129,187],"degree":[130],"$3$,":[131],"bandwidth":[132],"$2$":[133],"satisfies":[135],"$|f(v)|\\leq":[136],"1$":[137],"each":[139,284],"show":[142,242],"\\SSDpath":[144,247,279],"\\W{1}-complete":[146,160],"parameterized":[147,161,226,255,276,304,339,346],"length":[150,193,263,307],"sought":[153,196,265,310],"both":[157],"problems":[158],"cover":[165,261],"number,":[166,262],"feedback":[167],"number":[170,292],"treedepth.In":[172],"order":[173],"obtain":[175,208,222],"algorithmic":[176,370],"results,":[177],"parameterize":[179],"$\\mu=\\max_v":[183],"|f(v)|$":[184],"--":[185],"size":[188,282],"path.":[197],"By":[198],"nontrivial":[200],"application":[201],"color":[204],"coding":[205],"technique,":[206],"\\FPT":[209,224,303,338],"algorithm":[210],"with":[211],"respect":[212],"parameter":[215],"combination.":[216],"This":[217],"result":[218],"allows":[219],"us":[220],"several":[223],"algorithms":[225],"combination":[229,258],"$\\mu$":[231,268],"structural":[234,333],"parameter,":[235],"as":[237],"shrub-depth":[238],"or":[239],"modular-width.Next,":[240],"that,":[243],"unless":[244,328],"$\\NP\\subseteq":[245,329],"\\coNP/_{\\poly}$,":[246],"admit":[250,324],"polynomial":[252,326],"kernel":[253,327],"path,":[266,311],"already":[269],"2-outerplanar":[271],"graphs.Lastly,":[272],"complexity":[277],"when":[280],"logarithmic":[289],"underlying":[297],"graph.":[298],"While":[299],"becomes":[302,313,337,344],"{\\sf":[314],"WK}[1]-hard":[315],"under":[316],"same":[318],"parameterization":[319],"(hence":[320],"\\coNP/_{\\poly}$).":[330],"From":[331],"side,":[334],"treedepth,":[341],"but":[342],"\\W{1}-hard":[345],"neighborhood":[348],"diversity":[349],"cluster":[351],"deletion":[353],"number.We":[354],"provide":[355],"tight":[356],"lower":[357],"bounds":[358],"based":[359],"Exponential":[362],"Time":[363],"Hypothesis":[364],"(ETH)":[365],"our":[369],"results.":[371]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2025-10-14T00:00:00"}
