{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:07:04Z","timestamp":1780675624812,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","funder":[{"name":"National Natural Science Foundation of China","award":["62372095"],"award-info":[{"award-number":["62372095"]}]},{"name":"National Natural Science Foundation of China","award":["62502078"],"award-info":[{"award-number":["62502078"]}]},{"name":"Postdoctoral Fellowship Program of CPSF","award":["GZC20251102"],"award-info":[{"award-number":["GZC20251102"]}]},{"name":"European Union","award":["GA#101126560"],"award-info":[{"award-number":["GA#101126560"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,4,13]]},"DOI":"10.1145\/3774904.3792250","type":"proceedings-article","created":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T13:28:36Z","timestamp":1777296516000},"page":"822-833","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Sustained Vertex Cover on Temporal Graphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2742-5562","authenticated-orcid":false,"given":"Junqiang","family":"Peng","sequence":"first","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1669-285X","authenticated-orcid":false,"given":"Tian","family":"Bai","sequence":"additional","affiliation":[{"name":"Department of Informatics, University of Bergen, Bergen, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2322-750X","authenticated-orcid":false,"given":"Jingyang","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1012-2373","authenticated-orcid":false,"given":"Mingyu","family":"Xiao","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,4,12]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Temporal Vertex Cover with a Sliding Time Window","volume":"107","author":"Akrida Eleni C.","year":"2018","unstructured":"Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, and Viktor Zamaraev. 2018. Temporal Vertex Cover with a Sliding Time Window. In ICALP, Vol. 107. 148:1-148:14.","journal-title":"ICALP"},{"key":"e_1_3_2_1_2_1","first-page":"2084","article-title":"Algorithmic Aspects of Temporal Betweenness","author":"Bu\u00df Sebastian","year":"2020","unstructured":"Sebastian Bu\u00df, Hendrik Molter, Rolf Niedermeier, and Maciej Rymar. 2020. Algorithmic Aspects of Temporal Betweenness. In KDD. 2084-2092.","journal-title":"KDD."},{"key":"e_1_3_2_1_3_1","unstructured":"Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest and Clifford Stein. 2022. Introduction to algorithms."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118919"},{"key":"e_1_3_2_1_6_1","first-page":"271","article-title":"Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel $2k$ Kernelization for Vertex Cover","author":"Dehne Frank K. H. A.","year":"2004","unstructured":"Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond, and Peter Shaw. 2004. Greedy Localization, Iterative Compression, Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel $2k$ Kernelization for Vertex Cover. In IWPEC. 271-280.","journal-title":"IWPEC."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1865971"},{"key":"e_1_3_2_1_8_1","first-page":"5333","article-title":"Minimizing Reachability Times on Temporal Graphs via Shifting Labels","author":"Deligkas Argyrios","year":"2023","unstructured":"Argyrios Deligkas, Eduard Eiben, and George Skretas. 2023. Minimizing Reachability Times on Temporal Graphs via Shifting Labels. In IJCAI. 5333-5340.","journal-title":"IJCAI."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629620"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114040"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2025.103679"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-024-05993-8"},{"key":"e_1_3_2_1_13_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"1999","unstructured":"Rodney G. Downey and Michael R. Fellows. 1999. Parameterized Complexity."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-022-10069-w"},{"key":"e_1_3_2_1_15_1","first-page":"2037","article-title":"Disentangling the Computational Complexity of Network Untangling","author":"Froese Vincent","year":"2022","unstructured":"Vincent Froese, Pascal Kunz, and Philipp Zschoche. 2022. Disentangling the Computational Complexity of Network Untangling. In IJCAI. 2037-2043.","journal-title":"IJCAI."},{"key":"e_1_3_2_1_16_1","first-page":"1260","article-title":"Mining Temporal Networks","author":"Gionis Aristides","year":"2024","unstructured":"Aristides Gionis, Lutz Oettershagen, and Ilie Sarpe. 2024. Mining Temporal Networks. In WWW. 1260-1263.","journal-title":"WWW."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90562-4"},{"key":"e_1_3_2_1_18_1","unstructured":"Gurobi Optimization LLC. 2024. Gurobi Optimizer Reference Manual."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.08.009"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21259"},{"key":"e_1_3_2_1_21_1","first-page":"1","article-title":"A Faster Algorithm for Vertex Cover Parameterized by Solution Size","volume":"289","author":"Harris David G.","year":"2024","unstructured":"David G. Harris and N. S. Narayanaswamy. 2024. A Faster Algorithm for Vertex Cover Parameterized by Solution Size. In STACS, Vol. 289. 40:1-40:18.","journal-title":"STACS"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17404"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.04.002"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-017-0455-0"},{"key":"e_1_3_2_1_25_1","unstructured":"Petter Holme. 2018. Temporal Networks. In Enc. Soc. Netw. Anal. Min."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335364"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.06.019"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Dean Lusher Johan Koskinen and Garry Robins. 2013. Exponential random graph models for social networks: Theory methods and applications.","DOI":"10.1017\/CBO9780511894701"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2328668"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2021.08.004"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2023.04.005"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017667"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3156693"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580222"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00717-5"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.030"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.06.001"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108144"}],"event":{"name":"WWW '26: The ACM Web Conference 2026","location":"Dubai United Arab Emirates","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2026"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3774904.3792250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:52:21Z","timestamp":1780674741000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3774904.3792250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,12]]},"references-count":39,"alternative-id":["10.1145\/3774904.3792250","10.1145\/3774904"],"URL":"https:\/\/doi.org\/10.1145\/3774904.3792250","relation":{},"subject":[],"published":{"date-parts":[[2026,4,12]]},"assertion":[{"value":"2026-04-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}