{"id":"https://openalex.org/W3190186573","doi":"https://doi.org/10.24963/ijcai.2021/563","title":"Interference-free Walks in Time: Temporally Disjoint Paths","display_name":"Interference-free Walks in Time: Temporally Disjoint Paths","publication_year":2021,"publication_date":"2021-08-01","ids":{"openalex":"https://openalex.org/W3190186573","doi":"https://doi.org/10.24963/ijcai.2021/563","mag":"3190186573"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2021/563","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/563","pdf_url":"https://www.ijcai.org/proceedings/2021/0563.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2021/0563.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079318908","display_name":"Nina Klobas","orcid":"https://orcid.org/0000-0002-8024-5782"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nina Klobas","raw_affiliation_strings":["Durham University","Department of Computer Science, Durham University, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Durham University","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"Department of Computer Science, Durham University, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018078197","display_name":"George B. Mertzios","orcid":"https://orcid.org/0000-0001-7182-585X"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"George B. Mertzios","raw_affiliation_strings":["Durham University","Department of Computer Science, Durham University, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Durham University","institution_ids":["https://openalex.org/I190082696"]},{"raw_affiliation_string":"Department of Computer Science, Durham University, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"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 Industrial Engineering and Management, Ben-Gurion University of the Negev, 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 Industrial Engineering and Management, Ben-Gurion University of the Negev, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236"},"institutions":[{"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":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["Technische Universitat Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universitat Berlin","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038465467","display_name":"Philipp Zschoche","orcid":"https://orcid.org/0000-0001-9846-0600"},"institutions":[{"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":false,"raw_author_name":"Philipp Zschoche","raw_affiliation_strings":["Technische Universitat Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universitat Berlin","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0852,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73276036,"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":"4090","last_page":"4096"},"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.9998999834060669,"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.9998999834060669,"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/T11478","display_name":"Caching and Content Delivery","score":0.9922000169754028,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9821000099182129,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.749550461769104},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7263727188110352},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6006169319152832},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5474258065223694},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5182547569274902},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4871978163719177},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.480743408203125},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4797409772872925},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4771841764450073},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.47150105237960815},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4019007682800293},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39578261971473694},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3904660940170288},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33345213532447815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32689371705055237}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.749550461769104},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7263727188110352},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6006169319152832},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5474258065223694},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5182547569274902},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4871978163719177},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.480743408203125},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4797409772872925},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4771841764450073},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.47150105237960815},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4019007682800293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39578261971473694},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3904660940170288},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33345213532447815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32689371705055237},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.24963/ijcai.2021/563","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/563","pdf_url":"https://www.ijcai.org/proceedings/2021/0563.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:33174","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/33174/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"30th International Joint Conference on Artificial Intelligence (IJCAI-21), Montreal, Quebec, 21-26 Aug 2021 [Conference proceedings]","raw_type":"Conference item"},{"id":"pmh:oai:durham-repository.worktribe.com:1140800","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1140800","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2021/563","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/563","pdf_url":"https://www.ijcai.org/proceedings/2021/0563.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1658480100","display_name":null,"funder_award_id":"1070/20","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G4802279559","display_name":null,"funder_award_id":"NI 369/17","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6811041424","display_name":"Algorithmic Aspects of Temporal Graphs","funder_award_id":"EP/P020372/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7632411265","display_name":null,"funder_award_id":"RTG 2434","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G967227458","display_name":null,"funder_award_id":"EP/P020372/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"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"},{"id":"https://openalex.org/F4320324094","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3190186573.pdf","grobid_xml":"https://content.openalex.org/works/W3190186573.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W97263645","https://openalex.org/W100926944","https://openalex.org/W1551562380","https://openalex.org/W2003979824","https://openalex.org/W2005079828","https://openalex.org/W2050719228","https://openalex.org/W2061597613","https://openalex.org/W2115589427","https://openalex.org/W2116087731","https://openalex.org/W2312417503","https://openalex.org/W2498592833","https://openalex.org/W2550041253","https://openalex.org/W2569646339","https://openalex.org/W2808374365","https://openalex.org/W2835349798","https://openalex.org/W2911520398","https://openalex.org/W2949992533","https://openalex.org/W2953737785","https://openalex.org/W2963792426","https://openalex.org/W2970341242","https://openalex.org/W2973017021","https://openalex.org/W2980480328","https://openalex.org/W2991501493","https://openalex.org/W2996902925","https://openalex.org/W3011643348","https://openalex.org/W3037454447","https://openalex.org/W3101862638","https://openalex.org/W3104897947","https://openalex.org/W3162196475","https://openalex.org/W3199947862"],"related_works":["https://openalex.org/W2038088825","https://openalex.org/W2051058708","https://openalex.org/W1975203667","https://openalex.org/W2167625605","https://openalex.org/W2890358049","https://openalex.org/W2951548366","https://openalex.org/W4300569185","https://openalex.org/W1815974477","https://openalex.org/W143702185","https://openalex.org/W1988947197"],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,16,50,54,76,85,98,130,134],"computational":[3],"complexity":[4],"of":[5,100,111],"finding":[6,68],"temporally":[7,44,126],"disjoint":[8,45,127],"paths":[9,40],"or":[10,67],"walks":[11],"in":[12,63,71,150],"temporal":[13,26,136],"graphs.":[14],"There,":[15],"edge":[17],"set":[18],"changes":[19],"over":[20],"discrete":[21],"time":[22,37],"steps":[23],"and":[24],"a":[25,140],"path":[27,141],"(resp.":[28],"walk)":[29],"uses":[30],"edges":[31],"that":[32,81],"appear":[33],"at":[34,53],"monotonically":[35],"increasing":[36],"steps.":[38],"Two":[39],"(or":[41],"walks)":[42],"are":[43],"if":[46,119],"they":[47,58],"never":[48],"use":[49],"same":[51,55],"vertex":[52],"time;":[56],"otherwise,":[57],"interfere.":[59],"This":[60],"reflects":[61],"applications":[62],"robotics,":[64],"traffic":[65],"routing,":[66],"safe":[69],"pathways":[70],"dynamically":[72],"changing":[73],"networks.":[74],"On":[75,129],"one":[77],"extreme,":[78,132],"we":[79,120,147],"show":[80],"on":[82],"general":[83,151],"graphs":[84],"problem":[86],"is":[87,93,104],"computationally":[88],"hard.":[89],"The":[90,113],"\"walk":[91],"version\"":[92,115],"W[1]-hard":[94],"when":[95],"parameterized":[96],"by":[97],"number":[99,110],"routes.":[101],"However,":[102],"it":[103],"polynomial-time":[105],"solvable":[106],"for":[107],"any":[108],"constant":[109],"walks.":[112],"\"path":[114],"remains":[116],"NP-hard":[117],"even":[118],"want":[121],"to":[122,138],"find":[123,148],"only":[124],"two":[125],"paths.":[128],"other":[131],"restricting":[133],"input":[135],"graph":[137],"have":[139],"as":[142],"underlying":[143],"graph,":[144],"quite":[145],"counterintuitively,":[146],"NP-hardness":[149],"but":[152],"also":[153],"identify":[154],"natural":[155],"tractable":[156],"cases.":[157]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}