{"id":"https://openalex.org/W4415141367","doi":"https://doi.org/10.4230/lipics.isaac.2025.19","title":"Pathfinding in Self-Deleting Graphs","display_name":"Pathfinding in Self-Deleting Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415141367","doi":"https://doi.org/10.4230/lipics.isaac.2025.19"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2507.12047","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/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"},"type":"article","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2507.12047","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chimani, Markus","orcid":"https://orcid.org/0000-0002-4681-5550"},"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":"Chimani, Markus","raw_affiliation_strings":["Theoretical Computer Science, Osnabr\u00fcck University, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4681-5550","affiliations":[{"raw_affiliation_string":"Theoretical Computer Science, Osnabr\u00fcck University, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Ilsen, Max","orcid":"https://orcid.org/0000-0002-4532-3829"},"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":"Ilsen, Max","raw_affiliation_strings":["Theoretical Computer Science, Osnabr\u00fcck University, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4532-3829","affiliations":[{"raw_affiliation_string":"Theoretical Computer Science, Osnabr\u00fcck University, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29142129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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.9466000199317932,"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.9466000199317932,"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/vertex","display_name":"Vertex (graph theory)","score":0.6078000068664551},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5906999707221985},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5777999758720398},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.5766000151634216},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4650000035762787},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.40709999203681946},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.39649999141693115},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.36399999260902405}],"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":4,"locations":[{"id":"pmh:oai:arXiv.org:2507.12047","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/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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","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,"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":"publishedVersion"},{"id":"doi: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/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":""},{"id":"doi: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/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:arXiv.org:2507.12047","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/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6758225026","display_name":null,"funder_award_id":"461207633","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,23,71],"this":[1],"paper,":[2],"we":[3,25,77,90,191,204],"study":[4,26],"the":[5,19,58,68,72,128,158,161,172,186,194,207,219,224],"problem":[6,76,187,208],"of":[7,41,60,160,197,227],"pathfinding":[8],"on":[9,18,231],"traversal-dependent":[10],"graphs,":[11,28],"i.e.,":[12],"graphs":[13],"whose":[14],"edges":[15,61],"change":[16],"depending":[17],"previously":[20],"visited":[21],"vertices.":[22],"particular,":[24],"self-deleting":[27,81],"introduced":[29],"by":[30,157,171,193,218],"Carmesin":[31,35],"et":[32,36],"al.":[33],"[Sarah":[34],"al.,":[37],"2023],":[38],"which":[39],"consist":[40],"a":[42,49,80,95,212],"graph":[43,82,130],"G":[44],"=":[45],"(V,":[46],"E)":[47],"and":[48,83,87,89,140,164,180,199,223],"function":[50],"f:":[51],"V":[52],"\u2192":[53],"2^E,":[54],"where":[55],"f(v)":[56,111,198,228],"is":[57,124,131,154,168],"set":[59,178],"that":[62,103,121,150,165,185,206],"will":[63],"be":[64],"deleted":[65],"after":[66,112],"visiting":[67,113],"vertex":[69,117,146,173,177,220],"v.":[70,118,147],"(Shortest)":[73],"Self-Deleting":[74,122,152,166],"s-t-path":[75,123,153,167],"are":[78,91],"given":[79,129],"its":[84],"vertices":[85],"s":[86,99],"t,":[88,101],"asked":[92],"to":[93,100],"find":[94],"(shortest)":[96],"path":[97,163],"from":[98],"such":[102],"it":[104],"does":[105,209],"not":[106,210],"traverse":[107],"an":[108],"edge":[109],"in":[110],"v":[114],"for":[115,144,216],"any":[116],"We":[119,148,182],"prove":[120],"NP-hard":[125],"even":[126,215],"if":[127],"outerplanar,":[132],"bipartite,":[133],"has":[134],"maximum":[135,195,225],"degree":[136],"3,":[137],"bandwidth":[138],"2":[139],"|f(v)|":[141],"\u2264":[142],"1":[143],"each":[145],"show":[149,184,205],"Shortest":[151],"W[1]-complete":[155,169],"parameterized":[156,170],"length":[159],"sought":[162],"cover":[174,221],"number,":[175],"feedback":[176],"number":[179,222],"treedepth.":[181],"also":[183],"becomes":[188],"FPT":[189],"when":[190],"parameterize":[192],"size":[196,226],"several":[200],"structural":[201],"parameters.":[202],"Lastly,":[203],"admit":[211],"polynomial":[213],"kernel":[214],"parameterization":[217],"combined":[229],"already":[230],"2-outerplanar":[232],"graphs.":[233]},"counts_by_year":[],"updated_date":"2025-11-28T23:14:17.795251","created_date":"2025-10-14T00:00:00"}