{"id":"https://openalex.org/W7161023999","doi":"https://doi.org/10.48550/arxiv.2605.11873","title":"Maximizing Reachability via Shifting of Temporal Paths","display_name":"Maximizing Reachability via Shifting of Temporal Paths","publication_year":2026,"publication_date":"2026-05-12","ids":{"openalex":"https://openalex.org/W7161023999","doi":"https://doi.org/10.48550/arxiv.2605.11873"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.11873","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11873","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.11873","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048361071","display_name":"Argyrios Deligkas","orcid":"https://orcid.org/0000-0002-6513-6748"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Deligkas, Argyrios","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006143744","display_name":"Michelle D\u00f6ring","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D\u00f6ring, Michelle","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136054796","display_name":"Eduard Eiben","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eiben, Eduard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006076693","display_name":"George Skretas","orcid":"https://orcid.org/0000-0003-2514-8004"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Skretas, George","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5048427977","display_name":"Georg Tennigkeit","orcid":"https://orcid.org/0000-0003-0734-0684"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tennigkeit, Georg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9886999726295471,"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.9886999726295471,"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/T13553","display_name":"Age of Information Optimization","score":0.0006000000284984708,"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/T10269","display_name":"Epigenetics and DNA Methylation","score":0.0005000000237487257,"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.9470999836921692},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9107000231742859},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6477000117301941},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5795999765396118},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5580000281333923},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.503000020980835}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9470999836921692},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9107000231742859},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6477000117301941},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5795999765396118},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5734000205993652},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5580000281333923},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.503000020980835},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.41269999742507935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40290001034736633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4025000035762787},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3878999948501587},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34630000591278076},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.3127000033855438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29980000853538513},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2825999855995178},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2551000118255615}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.11873","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11873","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.11873","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.11873","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,51,102],"examine":[1],"the":[2,6,19,56,59,72,85,93,104,108,113,119,126],"problem":[3,109],"of":[4,8,21,32,45,58,74,92,107,115,129],"maximizing":[5],"reachability":[7],"a":[9,30,75,172,181],"given":[10,17,27],"source":[11],"in":[12,41,81,95],"temporal":[13,23,46,64,76,100],"graphs":[14,47],"that":[15,38,61,68,139,190],"are":[16,132,191],"as":[18],"union":[20],"k":[22,151],"paths,":[24],"i.e.,":[25],"every":[26,166],"path":[28,94],"is":[29,125,162],"sequence":[31],"edges":[33,91],"with":[34,110],"strictly":[35],"increasing":[36],"labels":[37,57],"denote":[39],"availability":[40,73],"time.":[42],"This":[43,66],"type":[44],"represent":[48],"train":[49],"networks.":[50],"consider":[52],"shifting":[53],"operations":[54],"on":[55,183],"paths":[60,116],"maintain":[62],"their":[63],"continuity.":[65],"means":[67],"we":[69,131,185],"can":[70,143],"move":[71],"edge":[77],"later":[78],"or":[79,175],"earlier":[80],"time,":[82],"and":[83,118,152,154,160],"propagate":[84],"shifts":[86,130],"to":[87,97,112,134],"all":[88],"other":[89,167],"affected":[90],"order":[96],"preserve":[98],"its":[99],"connectivity.":[101],"study":[103],"parameterized":[105,148,157,170,176],"complexity":[106],"respect":[111],"number":[114,128],"k,":[117,159,178],"total":[120],"budget":[121],"b,":[122,153,184],"where":[123],"b":[124,161],"maximum":[127],"allowed":[133],"perform.":[135],"Our":[136],"results":[137],"reveal":[138],"fixed":[140],"parameter":[141,174],"tractability":[142],"be":[144],"achieved":[145],"(1)":[146],"when":[147,156],"both":[149],"by":[150,158,171,177,193],"(2)":[155],"unconstrained.":[163],"In":[164],"almost":[165],"case,":[168],"e.g.,":[169],"single":[173],"while":[179],"having":[180],"bound":[182],"establish":[186],"intractability":[187],"lower":[188],"bounds":[189],"matched":[192],"XP":[194],"algorithms.":[195]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-14T00:00:00"}