{"id":"https://openalex.org/W4385767438","doi":"https://doi.org/10.24963/ijcai.2023/21","title":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?","display_name":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?","publication_year":2023,"publication_date":"2023-08-01","ids":{"openalex":"https://openalex.org/W4385767438","doi":"https://doi.org/10.24963/ijcai.2023/21"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2023/21","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2023/21","pdf_url":"https://www.ijcai.org/proceedings/2023/0021.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2023/0021.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057016052","display_name":"Pascal Kunz","orcid":"https://orcid.org/0000-0002-0787-8428"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]},{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Pascal Kunz","raw_affiliation_strings":["Humboldt-Universit\u00e4t zu Berlin","Technische Universit\u00e4t Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt-Universit\u00e4t zu Berlin","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Technische Universit\u00e4t Berlin","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102795134","display_name":"Hendrik Molter","orcid":"https://orcid.org/0000-0002-4590-798X"},"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":"Hendrik Molter","raw_affiliation_strings":["Ben-Gurion University of the Negev","Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"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","Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057016052"],"corresponding_institution_ids":["https://openalex.org/I39343248","https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":0.7683,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72985757,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"180","last_page":"188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9987999796867371,"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/T12288","display_name":"Optimization and Search Problems","score":0.9947999715805054,"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/T12029","display_name":"DNA and Biological Computing","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6665377020835876},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6291300058364868},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6230830550193787},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6192808747291565},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5806079506874084},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5710535645484924},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5001864433288574},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4914478063583374},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.487444669008255},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4192357659339905},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.4109746813774109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3524368405342102},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31721925735473633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29520493745803833},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.0769469141960144}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6665377020835876},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6291300058364868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6230830550193787},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6192808747291565},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5806079506874084},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5710535645484924},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5001864433288574},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4914478063583374},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.487444669008255},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4192357659339905},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.4109746813774109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3524368405342102},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31721925735473633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29520493745803833},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0769469141960144},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2023/21","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2023/21","pdf_url":"https://www.ijcai.org/proceedings/2023/0021.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2023/21","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2023/21","pdf_url":"https://www.ijcai.org/proceedings/2023/0021.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8400095090","display_name":null,"funder_award_id":"1456/18","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385767438.pdf"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W196900508","https://openalex.org/W1551562380","https://openalex.org/W1563039933","https://openalex.org/W1570425181","https://openalex.org/W1881841366","https://openalex.org/W1989407213","https://openalex.org/W2005079828","https://openalex.org/W2051627428","https://openalex.org/W2061597613","https://openalex.org/W2063525042","https://openalex.org/W2115589427","https://openalex.org/W2116087731","https://openalex.org/W2191404279","https://openalex.org/W2498592833","https://openalex.org/W2569646339","https://openalex.org/W2584529157","https://openalex.org/W2903837854","https://openalex.org/W2904325460","https://openalex.org/W2914414140","https://openalex.org/W2949992533","https://openalex.org/W2964196611","https://openalex.org/W2980480328","https://openalex.org/W3011643348","https://openalex.org/W3037454447","https://openalex.org/W3037469527","https://openalex.org/W3162196475","https://openalex.org/W3166547661","https://openalex.org/W3199947862","https://openalex.org/W4205985266","https://openalex.org/W4225569149","https://openalex.org/W4385767438"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2385033175","https://openalex.org/W2374043190","https://openalex.org/W2363298784","https://openalex.org/W2367402697"],"abstract_inverted_index":{"A":[0],"temporal":[1,16,31,63],"graph":[2],"has":[3,65],"an":[4],"edge":[5],"set":[6],"that":[7,23],"may":[8,152],"change":[9],"over":[10],"discrete":[11],"time":[12,27],"steps,":[13],"and":[14,91,146,160],"a":[15,110],"path":[17,81],"(or":[18,33],"walk)":[19],"must":[20],"traverse":[21],"edges":[22],"appear":[24],"at":[25,45],"increasing":[26],"steps.":[28],"Accordingly,":[29],"two":[30],"paths":[32,59],"walks)":[34],"are":[35],"temporally":[36,57],"disjoint":[37,58],"if":[38],"they":[39],"do":[40],"not":[41],"visit":[42],"any":[43],"vertex":[44],"the":[46,52,116,121,133,143,147,158],"same":[47],"time.":[48],"The":[49],"study":[50],"of":[51,55,115,157],"computational":[53],"complexity":[54],"finding":[56,82],"or":[60],"walks":[61],"in":[62,79],"graphs":[64],"recently":[66],"been":[67],"initiated":[68],"by":[69,77,100,166],"Klobas":[70,96,167],"et":[71,97,168],"al..":[72],"This":[73],"problem":[74,134],"is":[75],"motivated":[76],"applications":[78],"multi-agent":[80],"(MAPF),":[83],"which":[84],"include":[85],"robotics,":[86],"warehouse":[87],"management,":[88,90],"aircraft":[89],"traffic":[92],"routing.":[93],"We":[94],"extend":[95],"al.\u2019s":[98],"research":[99],"providing":[101],"parameterized":[102],"hardness":[103],"results":[104,137],"for":[105],"very":[106],"restricted":[107],"cases,":[108],"with":[109],"focus":[111],"on":[112],"structural":[113],"parameters":[114],"so-called":[117],"underlying":[118],"graph.":[119],"On":[120],"positive":[122],"side,":[123],"we":[124,130],"identify":[125],"sufficiently":[126],"simple":[127],"cases":[128],"where":[129],"can":[131],"solve":[132],"efficiently.":[135],"Our":[136],"reveal":[138],"some":[139],"surprising":[140],"differences":[141],"between":[142],"\u201cpath":[144],"version\u201d":[145,149],"\u201cwalk":[148],"(where":[150],"vertices":[151],"be":[153],"visited":[154],"multiple":[155],"times)":[156],"problem,":[159],"answer":[161],"several":[162],"open":[163],"questions":[164],"posed":[165],"al.":[169]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}