{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T14:22:07Z","timestamp":1783088527171,"version":"3.54.6"},"reference-count":46,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T00:00:00Z","timestamp":1777766400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1470\/24"],"award-info":[{"award-number":["1470\/24"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P020372\/1"],"award-info":[{"award-number":["EP\/P020372\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P02002X\/1"],"award-info":[{"award-number":["EP\/P02002X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"publisher","award":["ANR-22-CE48-0001"],"award-info":[{"award-number":["ANR-22-CE48-0001"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101039913"],"award-info":[{"award-number":["101039913"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.jcss.2026.103814","type":"journal-article","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T14:58:51Z","timestamp":1777993131000},"page":"103814","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Temporal graph realization with bounded stretch"],"prefix":"10.1016","volume":"160","author":[{"given":"George B.","family":"Mertzios","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7283-4982","authenticated-orcid":false,"given":"Nils","family":"Morawietz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2026.103814_br0010","series-title":"Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"781","article-title":"Nearly tight low stretch spanning trees","author":"Abraham","year":"2008"},{"issue":"2","key":"10.1016\/j.jcss.2026.103814_br0020","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1137\/17M1115575","article-title":"Using petal-decompositions to build a low stretch spanning tree","volume":"48","author":"Ittai","year":"2019","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103814_br0030","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1007\/s00224-017-9757-x","article-title":"The complexity of optimal design of temporally connected graphs","volume":"61","author":"Akrida","year":"2017","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.jcss.2026.103814_br0040","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.dam.2025.06.024","article-title":"Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs","volume":"378","author":"Arrighi","year":"2026","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jcss.2026.103814_br0050","series-title":"Proceedings of the 30th Annual European Symposium on Algorithms (ESA)","article-title":"Sparse temporal spanners with low stretch","author":"Bil\u00f2","year":"2022"},{"key":"10.1016\/j.jcss.2026.103814_br0060","series-title":"Proceedings of the 36th International Symposium on Algorithms and Computation (ISAAC)","article-title":"Realization of temporally connected graphs based on degree sequences","author":"Casteigts","year":"2025"},{"issue":"5","key":"10.1016\/j.jcss.2026.103814_br0070","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/0016-0032(66)90301-2","article-title":"On the realization of a (p,s)-digraph with prescribed degrees","volume":"281","author":"Chen","year":"1966","journal-title":"J. Franklin Inst."},{"issue":"1","key":"10.1016\/j.jcss.2026.103814_br0080","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/S0097539794261295","article-title":"Fast algorithms for constructing t-spanners and paths with stretch t","volume":"28","author":"Cohen","year":"1998","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.jcss.2026.103814_br0090","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs. I. Recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inf. Comput."},{"key":"10.1016\/j.jcss.2026.103814_br0100","series-title":"Graph Structure and Monadic Second-Order Logic: a Language-Theoretic Approach, vol. 138","author":"Courcelle","year":"2012"},{"key":"10.1016\/j.jcss.2026.103814_br0110","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.jcss.2026.103814_br0120","author":"De Carufel"},{"key":"10.1016\/j.jcss.2026.103814_br0130","series-title":"Structural Information and Communication Complexity - 30th International Colloquium (SIROCCO)","first-page":"386","article-title":"Cops & robber on periodic temporal graphs: characterization and improved bounds","author":"De Carufel","year":"2023"},{"key":"10.1016\/j.jcss.2026.103814_br0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2022.104890","article-title":"Optimizing reachability sets in temporal graphs by delaying","volume":"285","author":"Deligkas","year":"2022","journal-title":"Inf. Comput."},{"key":"10.1016\/j.jcss.2026.103814_br0150","article-title":"Graph Theory","volume":"vol. 173","author":"Diestel","year":"2016"},{"issue":"2","key":"10.1016\/j.jcss.2026.103814_br0160","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1137\/050641661","article-title":"Lower-stretch spanning trees","volume":"38","author":"Elkin","year":"2008","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/j.jcss.2026.103814_br0170","doi-asserted-by":"crossref","first-page":"1761","DOI":"10.1137\/060666202","article-title":"Approximating minimum max-stretch spanning trees on unweighted graphs","volume":"38","author":"Emek","year":"2008","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2026.103814_br0180","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.jcss.2021.01.007","article-title":"Deleting edges to restrict the size of an epidemic in temporal networks","volume":"119","author":"Enright","year":"2021","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103814_br0190","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.jcss.2020.08.001","article-title":"Assigning times to minimise reachability in temporal graphs","volume":"115","author":"Enright","year":"2021","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103814_br0200","first-page":"264","article-title":"Graphs with prescribed degrees of vertices","volume":"11","author":"Erd\u00f6s","year":"1960","journal-title":"Mat. Lapok"},{"key":"10.1016\/j.jcss.2026.103814_br0210","series-title":"Proceedings of the 33rd Annual European Symposium on Algorithms (ESA)","article-title":"Recognizing and realizing temporal reachability graphs","author":"Erlebach","year":"2025"},{"key":"10.1016\/j.jcss.2026.103814_br0220","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2024.103534","article-title":"A cop and robber game on edge-periodic temporal graphs","volume":"144","author":"Erlebach","year":"2024","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103814_br0230","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2025.115412","article-title":"Parameterized algorithms for multi-label periodic temporal graph realization","volume":"1051","author":"Erlebach","year":"2025","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.jcss.2026.103814_br0240","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.jcss.2011.10.003","article-title":"Local search: is brute-force avoidable?","volume":"78","author":"Fellows","year":"2012","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103814_br0250","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.tcs.2019.03.031","article-title":"Temporal graph classes: a view through temporal separators","volume":"806","author":"Fluschnik","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jcss.2026.103814_br0260","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(91)90068-D","article-title":"Label-connected graphs and the gossip problem","volume":"87","author":"G\u00f6bel","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcss.2026.103814_br0270","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.tcs.2013.05.006","article-title":"Local search for string problems: brute-force is essentially optimal","volume":"525","author":"Guo","year":"2014","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10.1016\/j.jcss.2026.103814_br0280","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/0110037","article-title":"On realizability of a set of integers as degrees of the vertices of a linear graph. I","volume":"10","author":"Hakimi","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"4","key":"10.1016\/j.jcss.2026.103814_br0290","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1090\/qam\/184873","article-title":"Distance matrix of a graph and its realizability","volume":"22","author":"Hakimi","year":"1965","journal-title":"Q. Appl. Math."},{"key":"10.1016\/j.jcss.2026.103814_br0300","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"4","key":"10.1016\/j.jcss.2026.103814_br0310","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1006\/jcss.2002.1829","article-title":"Connectivity and inference problems for temporal networks","volume":"64","author":"Kempe","year":"2002","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103814_br0320","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2024.103564","article-title":"The complexity of computing optimum labelings for temporal connectivity","volume":"146","author":"Klobas","year":"2024","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103814_br0330","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2025.115508","article-title":"Temporal graph realization from fastest paths","volume":"1056","author":"Klobas","year":"2025","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.jcss.2026.103814_br0340","article-title":"Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity","volume":"15","author":"Knop","year":"2019","journal-title":"Log. Methods Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103814_br0350","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s00453-011-9554-x","article-title":"Algorithmic meta-theorems for restrictions of treewidth","volume":"64","author":"Lampis","year":"2012","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.jcss.2026.103814_br0360","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.orl.2007.02.008","article-title":"Searching the k-change neighborhood for TSP is W[1]-hard","volume":"36","author":"Marx","year":"2008","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.jcss.2026.103814_br0370","series-title":"Proceedings of the 18th Conference on Computability in Europe (CiE)","first-page":"186","article-title":"Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes","author":"Meeks","year":"2022"},{"issue":"4","key":"10.1016\/j.jcss.2026.103814_br0380","doi-asserted-by":"crossref","first-page":"1416","DOI":"10.1007\/s00453-018-0478-6","article-title":"Temporal network optimization subject to connectivity constraints","volume":"81","author":"Mertzios","year":"2019","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2026.103814_br0390","series-title":"Proceedings of the 51st Workshop on Graph-Theoretic Concepts in Computer Science (WG)","article-title":"Realizing temporal transportation trees","author":"Mertzios","year":"2025"},{"key":"10.1016\/j.jcss.2026.103814_br0400","series-title":"Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science (MFCS)","article-title":"Temporal graph realization with bounded stretch","volume":"vol. 345","author":"Mertzios","year":"2025"},{"key":"10.1016\/j.jcss.2026.103814_br0410","series-title":"Proceedings of the 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS)","article-title":"Directed temporal tree realization for periodic public transport: easy and hard cases","author":"Meusel","year":"2025"},{"key":"10.1016\/j.jcss.2026.103814_br0420","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2024.103549","article-title":"Temporal reachability minimization: delaying vs. deleting","volume":"144","author":"Molter","year":"2024","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103814_br0430","series-title":"On the complexity of local search problems with scalable neighborhoods","author":"Morawietz","year":"2024"},{"key":"10.1016\/j.jcss.2026.103814_br0440","series-title":"Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS)","first-page":"71:1","article-title":"A timecop's work is harder than you think","author":"Morawietz","year":"2020"},{"key":"10.1016\/j.jcss.2026.103814_br0450","series-title":"Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science (MFCS)","first-page":"77:1","article-title":"A timecop's chase around the table","author":"Morawietz","year":"2021"},{"key":"10.1016\/j.jcss.2026.103814_br0460","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.jcss.2019.07.006","article-title":"The complexity of finding separators in temporal graphs","volume":"107","author":"Zschoche","year":"2020","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000607?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000607?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T13:51:43Z","timestamp":1783086703000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":46,"alternative-id":["S0022000026000607"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103814","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Temporal graph realization with bounded stretch","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103814","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"103814"}}