{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:03:26Z","timestamp":1776287006141,"version":"3.50.1"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","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":[[2020,2]]},"DOI":"10.1016\/j.jcss.2019.08.002","type":"journal-article","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T20:17:19Z","timestamp":1566418639000},"page":"108-123","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":51,"special_numbering":"C","title":["Temporal vertex cover with a sliding time window"],"prefix":"10.1016","volume":"107","author":[{"given":"Eleni C.","family":"Akrida","sequence":"first","affiliation":[]},{"given":"George B.","family":"Mertzios","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]},{"given":"Viktor","family":"Zamaraev","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2019.08.002_br0010","series-title":"Proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"29","article-title":"DMVP: foremost waypoint coverage of time-varying graphs","author":"Aaron","year":"2014"},{"key":"10.1016\/j.jcss.2019.08.002_br0020","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.jpdc.2015.10.002","article-title":"Ephemeral networks with random availability of links: the case of fast networks","volume":"87","author":"Akrida","year":"2016","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"10.1016\/j.jcss.2019.08.002_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.2019.08.002_br0040","series-title":"Proceedings of the 46th International Colloquium on Automata, Languages and Programming","article-title":"How fast can we reach a target vertex in stochastic temporal graphs?","author":"Akrida","year":"2019"},{"key":"10.1016\/j.jcss.2019.08.002_br0050","series-title":"Proceedings of the 11th International Conference on Algorithms and Complexity","article-title":"The temporal explorer who returns to the base","author":"Akrida","year":"2019"},{"key":"10.1016\/j.jcss.2019.08.002_br0060","series-title":"Proceedings of the 45th International Colloquium on Automata, Languages, and Programming","first-page":"148:1","article-title":"Temporal vertex covers and sliding time windows","author":"Akrida","year":"2018"},{"issue":"1\u20132","key":"10.1016\/j.jcss.2019.08.002_br0070","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","article-title":"Some APX-completeness results for cubic graphs","volume":"237","author":"Alimonti","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2019.08.002_br0080","article-title":"Temporal matching","author":"Baste","year":"2019","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jcss.2019.08.002_br0090","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1142\/S0129054103001728","article-title":"Computing shortest, fastest, and foremost journeys in dynamic networks","volume":"14","author":"Bui-Xuan","year":"2003","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.jcss.2019.08.002_br0100","series-title":"Deterministic Algorithms in Dynamic Networks: Formal Models and Metrics","author":"Casteigts","year":"2013"},{"key":"10.1016\/j.jcss.2019.08.002_br0110","series-title":"Deterministic Algorithms in Dynamic Networks: Problems, Analysis, and Algorithmic Tools","author":"Casteigts","year":"2013"},{"issue":"5","key":"10.1016\/j.jcss.2019.08.002_br0120","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/17445760.2012.668546","article-title":"Time-varying graphs and dynamic networks","volume":"27","author":"Casteigts","year":"2012","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"key":"10.1016\/j.jcss.2019.08.002_br0130","author":"Casteigts"},{"key":"10.1016\/j.jcss.2019.08.002_br0140","series-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing","first-page":"256","article-title":"Approximation of k-set cover by semi-local optimization","author":"Duh","year":"1997"},{"issue":"4","key":"10.1016\/j.jcss.2019.08.002_br0150","doi-asserted-by":"crossref","first-page":"1694","DOI":"10.1137\/090756053","article-title":"Flooding time of edge-Markovian evolving graphs","volume":"24","author":"Clementi","year":"2010","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.jcss.2019.08.002_br0160","doi-asserted-by":"crossref","first-page":"41:1","DOI":"10.1145\/2925416","article-title":"On problems as hard as CNF-SAT","volume":"12","author":"Cygan","year":"2016","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.jcss.2019.08.002_br0170","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.tcs.2015.02.006","article-title":"Complexity of barrier coverage with relocatable sensors in the plane","volume":"579","author":"Dobrev","year":"2015","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2019.08.002_br0180","author":"Enright"},{"key":"10.1016\/j.jcss.2019.08.002_br0190","series-title":"Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming","first-page":"444","article-title":"On temporal graph exploration","author":"Erlebach","year":"2015"},{"issue":"4","key":"10.1016\/j.jcss.2019.08.002_br0200","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of ln\u2061n for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/j.jcss.2019.08.002_br0210","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","article-title":"Building a reference combinatorial model for MANETs","volume":"18","author":"Ferreira","year":"2004","journal-title":"IEEE Netw."},{"key":"10.1016\/j.jcss.2019.08.002_br0220","series-title":"Proceedings of the 20th International Symposium on Algorithms and Computation","first-page":"534","article-title":"Exploration of periodically varying graphs","author":"Flocchini","year":"2009"},{"key":"10.1016\/j.jcss.2019.08.002_br0230","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.jcss.2019.08.002_br0240","series-title":"Proceedings of the 41st International Colloquium on Automata, Languages and Programming","first-page":"495","article-title":"Randomized rumor spreading in dynamic graphs","author":"Giakkoupis","year":"2014"},{"issue":"5","key":"10.1016\/j.jcss.2019.08.002_br0250","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s00446-016-0267-x","article-title":"Distributed algorithms for barrier coverage using relocatable sensors","volume":"29","author":"Hesari","year":"2016","journal-title":"Distrib. Comput."},{"issue":"1","key":"10.1016\/j.jcss.2019.08.002_br0260","doi-asserted-by":"crossref","first-page":"35:1","DOI":"10.1007\/s13278-017-0455-0","article-title":"Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs","volume":"7","author":"Himmel","year":"2017","journal-title":"Soc. Netw. Anal. Min."},{"key":"10.1016\/j.jcss.2019.08.002_br0270","series-title":"Temporal Networks","year":"2013"},{"issue":"2","key":"10.1016\/j.jcss.2019.08.002_br0280","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","article-title":"On the complexity of k-SAT","volume":"62","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.jcss.2019.08.002_br0290","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","article-title":"Which problems have strongly exponential complexity?","volume":"63","author":"Impagliazzo","year":"2001","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2019.08.002_br0300","series-title":"Proceedings of the 32nd Annual ACM Symposium on Theory of Computing","first-page":"504","article-title":"Connectivity and inference problems for temporal networks","author":"Kempe","year":"2000"},{"key":"10.1016\/j.jcss.2019.08.002_br0310","series-title":"Proceedings of the 6th International Conference on Complex Networks and Their Applications","first-page":"516","article-title":"On mining temporal patterns in dynamic graphs, and other unrelated problems","author":"Kostakis","year":"2017"},{"issue":"6","key":"10.1016\/j.jcss.2019.08.002_br0320","doi-asserted-by":"crossref","first-page":"1840","DOI":"10.1007\/s10618-017-0515-0","article-title":"Discovering recurring activity in temporal networks","volume":"31","author":"Kostakis","year":"2017","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.jcss.2019.08.002_br0330","series-title":"Proceedings of the 11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks","first-page":"27","article-title":"Maintaining intruder detection capability in a rectangular domain with sensors","author":"Kranakis","year":"2015"},{"issue":"1","key":"10.1016\/j.jcss.2019.08.002_br0340","doi-asserted-by":"crossref","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: densification and shrinking diameters","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.jcss.2019.08.002_br0350","first-page":"41","article-title":"Lower bounds based on the Exponential Time Hypothesis","author":"Lokshtanov","year":"2011","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.jcss.2019.08.002_br0360","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.2019.08.002_br0370","author":"Mertzios"},{"key":"10.1016\/j.jcss.2019.08.002_br0380","series-title":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence","article-title":"Sliding window temporal graph coloring","author":"Mertzios","year":"2019"},{"key":"10.1016\/j.jcss.2019.08.002_br0390","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","article-title":"Traveling salesman problems in temporal graphs","volume":"634","author":"Michail","year":"2016","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jcss.2019.08.002_br0400","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1145\/3156693","article-title":"Elements of the theory of dynamic networks","volume":"61","author":"Michail","year":"2018","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/j.jcss.2019.08.002_br0410","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","article-title":"An efficient fixed-parameter algorithm for 3-hitting set","volume":"1","author":"Niedermeier","year":"2003","journal-title":"J. Discret. Algorithms"},{"issue":"1","key":"10.1016\/j.jcss.2019.08.002_br0420","doi-asserted-by":"crossref","first-page":"121","DOI":"10.3390\/a2010121","article-title":"Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks","volume":"2","author":"Nikoletseas","year":"2009","journal-title":"Algorithms"},{"key":"10.1016\/j.jcss.2019.08.002_br0430","series-title":"Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases","first-page":"701","article-title":"The network-untangling problem: from interactions to activity timelines","author":"Rozenshtein","year":"2017"},{"issue":"1","key":"10.1016\/j.jcss.2019.08.002_br0440","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/1672308.1672329","article-title":"Characterising temporal distance and reachability in mobile and online social networks","volume":"40","author":"Tang","year":"2010","journal-title":"ACM Comput. Commun. Rev."},{"key":"10.1016\/j.jcss.2019.08.002_br0450","series-title":"Approximation Algorithms","author":"Vazirani","year":"2003"},{"key":"10.1016\/j.jcss.2019.08.002_br0460","series-title":"Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","first-page":"1517","article-title":"Revealing contact patterns among high-school students using maximal cliques in link streams","author":"Viard","year":"2015"},{"key":"10.1016\/j.jcss.2019.08.002_br0470","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","article-title":"Computing maximal cliques in link streams","volume":"609","author":"Viard","year":"2016","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jcss.2019.08.002_br0480","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.jnca.2011.11.016","article-title":"A survey on coverage and connectivity issues in wireless sensor networks","volume":"35","author":"Zhu","year":"2012","journal-title":"J. Netw. Comput. Appl."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000018308687?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000018308687?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T08:01:57Z","timestamp":1712304117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000018308687"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2]]},"references-count":48,"alternative-id":["S0022000018308687"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2019.08.002","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2020,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Temporal vertex cover with a sliding time window","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.2019.08.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}