{"id":"https://openalex.org/W4385767788","doi":"https://doi.org/10.24963/ijcai.2023/592","title":"Minimizing Reachability Times on Temporal Graphs via Shifting Labels","display_name":"Minimizing Reachability Times on Temporal Graphs via Shifting Labels","publication_year":2023,"publication_date":"2023-08-01","ids":{"openalex":"https://openalex.org/W4385767788","doi":"https://doi.org/10.24963/ijcai.2023/592"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2023/592","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2023/592","pdf_url":"https://www.ijcai.org/proceedings/2023/0592.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":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2023/0592.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048361071","display_name":"Argyrios Deligkas","orcid":"https://orcid.org/0000-0002-6513-6748"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Argyrios Deligkas","raw_affiliation_strings":["Royal Holloway University of London","Royal Holloway, University of London"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Holloway University of London","institution_ids":["https://openalex.org/I184558857"]},{"raw_affiliation_string":"Royal Holloway, University of London","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066848088","display_name":"Eduard Eiben","orcid":"https://orcid.org/0000-0003-2628-3435"},"institutions":[{"id":"https://openalex.org/I184558857","display_name":"Royal Holloway University of London","ror":"https://ror.org/04g2vpn86","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I184558857"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Eduard Eiben","raw_affiliation_strings":["Royal Holloway, University of London"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Holloway, University of London","institution_ids":["https://openalex.org/I184558857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006076693","display_name":"George Skretas","orcid":"https://orcid.org/0000-0003-2514-8004"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]},{"id":"https://openalex.org/I176453806","display_name":"University of Potsdam","ror":"https://ror.org/03bnmw459","country_code":"DE","type":"education","lineage":["https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"George Skretas","raw_affiliation_strings":["Hasso Plattner Institute, University of Potsdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, University of Potsdam","institution_ids":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0885,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73089334,"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":"5333","last_page":"5340"},"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.996999979019165,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9891999959945679,"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/reachability","display_name":"Reachability","score":0.842173159122467},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7338225245475769},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.652748703956604},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6447772979736328},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.596123218536377},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5928620100021362},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5083567500114441},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3986261487007141},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3424283266067505},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.341509610414505},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.332017183303833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28975528478622437},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1114453673362732}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.842173159122467},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7338225245475769},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.652748703956604},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6447772979736328},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.596123218536377},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5928620100021362},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5083567500114441},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3986261487007141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3424283266067505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.341509610414505},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.332017183303833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28975528478622437},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1114453673362732}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2023/592","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2023/592","pdf_url":"https://www.ijcai.org/proceedings/2023/0592.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/592","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2023/592","pdf_url":"https://www.ijcai.org/proceedings/2023/0592.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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4385767788.pdf"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1990920784","https://openalex.org/W2064796716","https://openalex.org/W2116087731","https://openalex.org/W2244843312","https://openalex.org/W2416893725","https://openalex.org/W2438284930","https://openalex.org/W2607316446","https://openalex.org/W2789836371","https://openalex.org/W2800514555","https://openalex.org/W2914414140","https://openalex.org/W2949065857","https://openalex.org/W2970341242","https://openalex.org/W3080676684","https://openalex.org/W3093196139","https://openalex.org/W3166547661","https://openalex.org/W3199947862","https://openalex.org/W4323781158"],"related_works":["https://openalex.org/W2170721748","https://openalex.org/W2075531723","https://openalex.org/W2945561475","https://openalex.org/W1511821218","https://openalex.org/W4389814085","https://openalex.org/W2175868772","https://openalex.org/W3048010228","https://openalex.org/W1587078595","https://openalex.org/W4285659194","https://openalex.org/W3031065515"],"abstract_inverted_index":{"We":[0,53,81,146],"study":[1,82],"how":[2,83],"we":[3,84,100,110,117,139,161,172,199],"can":[4,67,85],"accelerate":[5],"the":[6,41,69,87,107,112,125,134,164,169,179,182,185,188],"spreading":[7],"of":[8,37,92,106,115,136,144,181,187,196],"information":[9,24],"in":[10,49,56],"temporal":[11,31],"graphs":[12],"via":[13],"shifting":[14,59],"operations;":[15],"a":[16,30,35,50,90,122,148],"problem":[17,126,165],"that":[18,163,191],"captures":[19],"real-world":[20],"applications":[21],"varying":[22],"from":[23,74],"flows":[25],"to":[26,72,78,95,103],"distribution":[27],"schedules.":[28],"In":[29],"graph":[32,183,205],"there":[33,152,157],"is":[34,127,153],"set":[36,91],"fixed":[38],"vertices":[39],"and":[40,129],"available":[42],"connections":[43],"between":[44],"them":[45],"change":[46],"over":[47],"time":[48,70,89],"predefined":[51],"manner.":[52],"observe":[54],"that,":[55,119],"some":[57,60,75,105],"cases,":[58],"connections,":[61],"i.e.,":[62],"advancing":[63],"or":[64],"delaying":[65],"them,":[66],"decrease":[68],"required":[71],"reach":[73,96],"vertex":[76],"(source)":[77],"another":[79],"vertex.":[80],"minimize":[86],"maximum":[88],"sources":[93],"needs":[94],"every":[97],"vertex,":[98],"when":[99,131,151],"are":[101,158],"allowed":[102,113],"shift":[104],"connections.":[108],"If":[109],"restrict":[111],"number":[114,135,143,195],"changes,":[116],"prove":[118],"already":[120],"for":[121,193,203],"single":[123],"source,":[124],"NP-hard,":[128],"W[2]-hard":[130],"parameterized":[132,177],"by":[133,178],"changes.":[137,145],"Then":[138],"focus":[140],"on":[141,168],"unconstrained":[142],"derive":[147],"polynomial-time":[149,201],"algorithm":[150,176],"one":[154],"source.":[155],"When":[156],"two":[159],"sources,":[160],"show":[162],"becomes":[166],"NP-hard;":[167],"other":[170],"hand,":[171],"design":[173],"an":[174],"FPT":[175],"treewidth":[180],"plus":[184],"lifetime":[186],"optimal":[189],"solution,":[190],"works":[192],"any":[194],"sources.":[197],"Finally,":[198],"provide":[200],"algorithms":[202],"several":[204],"classes.":[206]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}