{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:11:19Z","timestamp":1779448279147,"version":"3.53.1"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T00:00:00Z","timestamp":1772928000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.tcs.2026.115848","type":"journal-article","created":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T16:45:00Z","timestamp":1773074700000},"page":"115848","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Triangle-covered graphs: Algorithms, complexity, and structure"],"prefix":"10.1016","volume":"1072","author":[{"given":"Amirali","family":"Madani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1274-4598","authenticated-orcid":false,"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8232-2502","authenticated-orcid":false,"given":"Bobby","family":"Miraftab","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6378-7742","authenticated-orcid":false,"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115848_bib0001","article-title":"Sparse graphs with local covering conditions on edges","author":"Chakraborti","year":"2026","journal-title":"To appear in J. Graph Theory"},{"issue":"3","key":"10.1016\/j.tcs.2026.115848_bib0002","doi-asserted-by":"crossref","first-page":"191","DOI":"10.7155\/jgaa.00527","article-title":"Bounds and algorithms for graph trusses","volume":"24","author":"Burkhardt","year":"2020","journal-title":"J. Graph Algorith. Appl."},{"key":"10.1016\/j.tcs.2026.115848_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.cosrev.2023.100556","article-title":"A survey of parameterized algorithms and the complexity of edge modification","volume":"48","author":"Crespelle","year":"2023","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"10.1016\/j.tcs.2026.115848_bib0004","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/s00453-011-9595-1","article-title":"Cluster editing: kernelization based on edge cuts","volume":"64","author":"Cao","year":"2012","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/j.tcs.2026.115848_bib0005","doi-asserted-by":"crossref","first-page":"1354","DOI":"10.1137\/19M1286712","article-title":"Extremal graphs with local covering conditions","volume":"34","author":"Chakraborti","year":"2020","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"10.1016\/j.tcs.2026.115848_bib0006","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.jcss.2011.04.001","article-title":"A 2k- kernel for the cluster editing problem","volume":"78","author":"Chen","year":"2012","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10.1016\/j.tcs.2026.115848_bib0007","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1137\/090767285","article-title":"A more relaxed model for graph-based data clustering: s-plex cluster editing","volume":"24","author":"Guo","year":"2010","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.115848_bib0008","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","article-title":"Cluster graph modification problems","volume":"144","author":"Shamir","year":"2004","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.tcs.2026.115848_bib0009","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.jcss.2022.10.002","article-title":"Building large k-cores from sparse graphs","volume":"132","author":"Fomin","year":"2023","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115848_bib0010","series-title":"Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6\u201310, 2018, Proceedings","first-page":"78","article-title":"Can we create large k-cores by adding few edges?","volume":"10846","author":"Chitnis","year":"2018"},{"issue":"14","key":"10.1016\/j.tcs.2026.115848_bib0011","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1093\/bioinformatics\/btg232","article-title":"CLICK and EXPANDER: a system for clustering and visualizing gene expression data","volume":"19","author":"Sharan","year":"2003","journal-title":"Bioinform."},{"key":"10.1016\/j.tcs.2026.115848_bib0012","series-title":"Algorithms and Discrete Applied Mathematics - 11th International Conference, CALDAM 2025, Coimbatore, India, February 13\u201315, 2025, Proceedings","first-page":"185","article-title":"Algorithms and hardness results for the (3, 1)-cover problem","volume":"15536","author":"Madani","year":"2025"},{"key":"10.1016\/j.tcs.2026.115848_bib0013","article-title":"Algorithms and hardness results for the (k,l)-cover problem","volume":"abs\/2502.02572","author":"Madani","year":"2025","journal-title":"CoRR"},{"key":"10.1016\/j.tcs.2026.115848_sbref0013","article-title":"Sage mathematics software (version 10.4)","author":"Stein","year":"2024","journal-title":"Sage Develop. Team"},{"key":"10.1016\/j.tcs.2026.115848_bib0015","series-title":"Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31\u2013June 03, 2014","first-page":"624","article-title":"Analytical approach to parallel repetition","author":"Dinur","year":"2014"},{"issue":"6","key":"10.1016\/j.tcs.2026.115848_bib0016","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","article-title":"A note on finding the bridges of a graph","volume":"2","author":"Tarjan","year":"1974","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.tcs.2026.115848_bib0017","series-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"Dubhashi","year":"2009"},{"issue":"2","key":"10.1016\/j.tcs.2026.115848_bib0018","first-page":"114","article-title":"Some algorithms on cactus graphs","volume":"2","author":"Das","year":"2012","journal-title":"Ann. Pure Appl. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001076?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001076?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:02:54Z","timestamp":1779447774000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":18,"alternative-id":["S0304397526001076"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115848","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Triangle-covered graphs: Algorithms, complexity, and structure","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115848","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 B.V.","name":"copyright","label":"Copyright"}],"article-number":"115848"}}