{"id":"https://openalex.org/W7165760544","doi":"https://doi.org/10.4230/lipics.sand.2026.21","title":"Brief Announcement: Revisiting the Realizability of Periodic Temporal Graphs with Bounded Stretch","display_name":"Brief Announcement: Revisiting the Realizability of Periodic Temporal Graphs with Bounded Stretch","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7165760544","doi":"https://doi.org/10.4230/lipics.sand.2026.21"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26255","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.21/LIPIcs.SAND.2026.21.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":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.21/LIPIcs.SAND.2026.21.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139245561","display_name":"Julia Meusel","orcid":"https://orcid.org/0009-0001-2880-1390"},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Meusel, Julia","raw_affiliation_strings":["Martin Luther University Halle-Wittenberg, Germany"],"raw_orcid":"https://orcid.org/0009-0001-2880-1390","affiliations":[{"raw_affiliation_string":"Martin Luther University Halle-Wittenberg, Germany","institution_ids":["https://openalex.org/I68956291"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045950235","display_name":"Nils Morawietz","orcid":"https://orcid.org/0000-0002-7283-4982"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE","FR"],"is_corresponding":false,"raw_author_name":"Morawietz, Nils","raw_affiliation_strings":["LaBRI, Universit\u00e9 de Bordeaux, Talence, France","Institute of Computer Science, Friedrich Schiller University Jena, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7283-4982","affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 de Bordeaux, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]},{"raw_affiliation_string":"Institute of Computer Science, Friedrich Schiller University Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006211424","display_name":"Matthias M\u00fcller\u2010Hannemann","orcid":"https://orcid.org/0000-0001-6976-0006"},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M\u00fcller-Hannemann, Matthias","raw_affiliation_strings":["Martin Luther University Halle-Wittenberg, Germany"],"raw_orcid":"https://orcid.org/0000-0001-6976-0006","affiliations":[{"raw_affiliation_string":"Martin Luther University Halle-Wittenberg, Germany","institution_ids":["https://openalex.org/I68956291"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079358721","display_name":"K Reinhardt","orcid":null},"institutions":[{"id":"https://openalex.org/I68956291","display_name":"Martin Luther University Halle-Wittenberg","ror":"https://ror.org/05gqaka33","country_code":"DE","type":"education","lineage":["https://openalex.org/I68956291"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Reinhardt, Klaus","raw_affiliation_strings":["Martin Luther University Halle-Wittenberg, Germany"],"raw_orcid":"https://orcid.org/0009-0002-7002-4051","affiliations":[{"raw_affiliation_string":"Martin Luther University Halle-Wittenberg, Germany","institution_ids":["https://openalex.org/I68956291"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67547529,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.8206999897956848,"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.8206999897956848,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.049400001764297485,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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"}},{"id":"https://openalex.org/T10269","display_name":"Epigenetics and DNA Methylation","score":0.026499999687075615,"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/realizability","display_name":"Realizability","score":0.6818000078201294},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5264000296592712},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5224000215530396},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4851999878883362},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.33230000734329224},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.28459998965263367},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.2824000120162964}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.6818000078201294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6694999933242798},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6190999746322632},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5264000296592712},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5224000215530396},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4851999878883362},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44519999623298645},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.28459998965263367},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2662000060081482},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.26109999418258667},{"id":"https://openalex.org/C120241303","wikidata":"https://www.wikidata.org/wiki/Q3503302","display_name":"Periodic sequence","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.25459998846054077},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.25440001487731934},{"id":"https://openalex.org/C148837635","wikidata":"https://www.wikidata.org/wiki/Q1742397","display_name":"Sawtooth wave","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26255","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.21/LIPIcs.SAND.2026.21.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":"InProceedings"},{"id":"doi:10.4230/lipics.sand.2026.21","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sand.2026.21","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26255","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2026.21","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol373-sand2026/LIPIcs.SAND.2026.21/LIPIcs.SAND.2026.21.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":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2465436510","display_name":"TEMPOral GRaph ALgorithms and problems","funder_award_id":"ANR-22-CE48-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7165760544.pdf","grobid_xml":"https://content.openalex.org/works/W7165760544.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,182,263],"revisit":[4],"Stretched":[5],"Periodic":[6,248],"Temporal":[7,249],"Graph":[8,250],"Realization":[9,251],"(STGR)":[10],"which":[11,198],"was":[12,254],"recently":[13],"introduced":[14,255],"by":[15,139,160,188,256],"Mertzios":[16,189],"et":[17,190,258],"al.":[18,191,259],"[MFCS":[19],"2025].":[20,261],"Here,":[21],"the":[22,43,57,64,71,104,115,125,140,146,151,162,185,199,224,246,265],"input":[23],"consists":[24],"of":[25,101,117,127,165,267,269],"an":[26],"undirected":[27],"graph":[28,67],"G":[29],"=":[30,97,167,236,243],"(V,E),":[31],"a":[32,36,49,118,128],"period":[33],"\u0394,":[34],"and":[35,42,80,93,273],"rational":[37],"number":[38],"\u03b1":[39,62],"\u2265":[40],"1,":[41],"question":[44,187],"is,":[45,70],"whether":[46,193,223],"there":[47,194],"is":[48,59,103,122,174,203,227],"labeling":[50],"\u03bb:":[51],"E":[52],"\u2192":[53],"[0,\u0394-1],":[54],"such":[55,212],"that":[56,69,172,211,217,253],"stretch":[58,100,106,116,202,226],"at":[60,86,228],"most":[61,229],"in":[63,112,136,145],"\u0394-periodic":[65],"temporal":[66,72,130],"(G,\u03bb),":[68,113],"graph,":[73],"where":[74,114],"for":[75,154,176,197,234,241,245],"each":[76,81,177],"c":[77],"\u2208":[78],"\u2115":[79],"edge":[82],"e,":[83],"e":[84],"appears":[85],"time":[87],"c\u22c5":[88],"\u0394":[89,159,166,178,235,242],"+":[90],"i":[91],"if":[92,95],"only":[94,210],"\u03bb(e)":[96],"i.":[98],"The":[99],"(G,\u03bb)":[102,137],"maximum":[105],"between":[107,142],"any":[108],"vertex":[109,119],"pair":[110,120],"(u,v)":[111,121],"defined":[123],"as":[124],"duration":[126],"fastest":[129],"path":[131],"from":[132],"u":[133],"to":[134,158,221],"v":[135],"divided":[138],"distance":[141],"these":[143],"vertices":[144],"underlying":[147],"graph.":[148],"We":[149,207],"complete":[150],"complexity":[152],"picture":[153],"STGR":[155,173],"with":[156,271],"respect":[157],"investigating":[161],"open":[163,186],"case":[164],"2.":[168],"It":[169],"turns":[170],"out":[171],"NP-hard":[175,220],">":[179],"1.":[180],"Moreover,":[181],"also":[183,216,238],"answer":[184],"on":[192],"are":[195],"graphs":[196,213,270],"smallest":[200],"possible":[201],"larger":[204],"than":[205],"(\u0394+1)/2.":[206,230],"show":[208,264],"not":[209],"exist,":[214],"but":[215],"it":[218],"remains":[219],"decide":[222],"optimal":[225],"Our":[231],"hardness":[232,240],"results":[233],"2":[237,244],"imply":[239],"Fastest":[247],"problem":[252],"Klobas":[257],"[TCS":[260],"Finally,":[262],"existence":[266],"classes":[268],"small":[272],"large":[274],"stretch.":[275]},"counts_by_year":[],"updated_date":"2026-08-18T07:49:30.821534","created_date":"2026-06-25T00:00:00"}