{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T08:42:58Z","timestamp":1773218578438,"version":"3.50.1"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","award":["KO 3669\/5-1"],"award-info":[{"award-number":["KO 3669\/5-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","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\/100007569","name":"Carl Zeiss Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007569","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,8]]},"DOI":"10.1016\/j.jcss.2026.103784","type":"journal-article","created":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T17:05:09Z","timestamp":1772125509000},"page":"103784","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Graph clustering problems under the lens of parameterized local search"],"prefix":"10.1016","volume":"159","author":[{"given":"Jaroslav","family":"Garvardt","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7283-4982","authenticated-orcid":false,"given":"Nils","family":"Morawietz","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[]},{"given":"Mathias","family":"Weller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2026.103784_br0010","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.jda.2017.07.003","article-title":"On the complexity of multi-parameterized cluster editing","volume":"45","author":"Abu-Khzam","year":"2017","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"10.1016\/j.jcss.2026.103784_br0020","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1007\/s10107-021-01744-w","article-title":"A tight approximation algorithm for the cluster vertex deletion problem","volume":"197","author":"Aprile","year":"2023","journal-title":"Math. Program."},{"issue":"1\u20133","key":"10.1016\/j.jcss.2026.103784_br0030","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","article-title":"Correlation clustering","volume":"56","author":"Bansal","year":"2004","journal-title":"Mach. Learn."},{"key":"10.1016\/j.jcss.2026.103784_br0040","series-title":"Proceedings of the 16th International Symposium on Parameterized and Exact Computation (IPEC '21)","first-page":"33:1","article-title":"PACE solver description: \u03bc solver - heuristic track","volume":"vol. 214","author":"Bartier","year":"2021"},{"issue":"3\/4","key":"10.1016\/j.jcss.2026.103784_br0050","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1089\/106652799318274","article-title":"Clustering gene expression patterns","volume":"6","author":"Ben-Dor","year":"1999","journal-title":"J. Comput. Biol."},{"issue":"2","key":"10.1016\/j.jcss.2026.103784_br0060","first-page":"185","article-title":"Improved bounds on Bell numbers and on moments of sums of random variables","volume":"30","author":"Berend","year":"2010","journal-title":"Probab. Math. Stat."},{"key":"10.1016\/j.jcss.2026.103784_br0070","series-title":"Proceedings of the 16th International Symposium on Parameterized and Exact Computation (IPEC '21)","first-page":"31:1","article-title":"PACE solver description: KaPoCE: a heuristic cluster editing algorithm","volume":"vol. 214","author":"Bl\u00e4sius","year":"2021"},{"key":"10.1016\/j.jcss.2026.103784_br0080","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jda.2012.04.005","article-title":"A golden ratio parameterized algorithm for cluster editing","volume":"16","author":"B\u00f6cker","year":"2012","journal-title":"J. Discrete Algorithms"},{"key":"10.1016\/j.jcss.2026.103784_br0090","series-title":"Proceedings of the 27th Annual European Symposium on Algorithms (ESA '19)","first-page":"23:1","article-title":"Fine-grained complexity of k-OPT in bounded-degree graphs for solving TSP","volume":"vol. 144","author":"Bonnet","year":"2019"},{"key":"10.1016\/j.jcss.2026.103784_br0100","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.tcs.2015.07.001","article-title":"Complexity of the cluster deletion problem on subclasses of chordal graphs","volume":"600","author":"Bonomo","year":"2015","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/j.jcss.2026.103784_br0110","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","article-title":"On modularity clustering","volume":"20","author":"Brandes","year":"2008","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.jcss.2026.103784_br0120","series-title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","first-page":"1605","article-title":"Understanding the cluster linear program for correlation clustering","author":"Cao","year":"2024"},{"issue":"1","key":"10.1016\/j.jcss.2026.103784_br0130","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"},{"key":"10.1016\/j.jcss.2026.103784_br0140","series-title":"Proceedings of the 16th International Symposium on Parameterized and Exact Computation (IPEC '21)","first-page":"13:1","article-title":"Improved kernels for edge modification problems","volume":"vol. 214","author":"Cao","year":"2021"},{"issue":"1","key":"10.1016\/j.jcss.2026.103784_br0150","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."},{"key":"10.1016\/j.jcss.2026.103784_br0160","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"key":"10.1016\/j.jcss.2026.103784_br0170","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2014.05.002","article-title":"On the parameterized complexity of consensus clustering","volume":"542","author":"D\u00f6rnfelder","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103784_br0180","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-5559-1","article-title":"Fundamentals of Parameterized Complexity","author":"Downey","year":"2013"},{"key":"10.1016\/j.jcss.2026.103784_br0190","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"issue":"3","key":"10.1016\/j.jcss.2026.103784_br0200","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.103784_br0210","series-title":"Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (FCT '07)","first-page":"312","article-title":"Efficient parameterized preprocessing for cluster editing","volume":"vol. 4639","author":"Fellows","year":"2007"},{"key":"10.1016\/j.jcss.2026.103784_br0220","series-title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","first-page":"5586","article-title":"Parameterized local search for max c-cut","author":"Garvardt","year":"2023"},{"key":"10.1016\/j.jcss.2026.103784_br0230","series-title":"Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC 24)","first-page":"32:1","article-title":"When can cluster deletion with bounded weights be solved efficiently?","volume":"vol. 322","author":"Garvardt","year":"2024"},{"issue":"2","key":"10.1016\/j.jcss.2026.103784_br0240","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s00453-018-0499-1","article-title":"Turbocharging treewidth heuristics","volume":"81","author":"Gaspers","year":"2019","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2026.103784_br0250","series-title":"Proceedings of the 26th Annual AAAI Conference on Artificial Intelligence (AAAI '12)","article-title":"Don't be strict in local search!","author":"Gaspers","year":"2012"},{"key":"10.1016\/j.jcss.2026.103784_br0260","series-title":"Proceedings of the 16th International Symposium on Parameterized and Exact Computation (IPEC '21)","first-page":"34:1","article-title":"PACE Solver Description: a simplified threshold accepting approach for the cluster editing problem","volume":"vol. 214","author":"Josef Geiger","year":"2021"},{"issue":"4","key":"10.1016\/j.jcss.2026.103784_br0270","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s00224-004-1178-y","article-title":"Graph-modeled data clustering: exact algorithms for clique generation","volume":"38","author":"Gramm","year":"2005","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"10.1016\/j.jcss.2026.103784_br0280","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1007\/s00453-019-00617-1","article-title":"On the relation of strong triadic closure and cluster deletion","volume":"82","author":"Gr\u00fcttemeier","year":"2020","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2026.103784_br0290","series-title":"Proceedings of the 35th Annual AAAI Conference on Artificial Intelligence (AAAI '21)","first-page":"12328","article-title":"Efficient Bayesian network structure learning via parameterized local search on topological orderings","author":"Gr\u00fcttemeier","year":"2021"},{"issue":"8\u201310","key":"10.1016\/j.jcss.2026.103784_br0300","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.tcs.2008.10.021","article-title":"A more effective linear kernelization for cluster editing","volume":"410","author":"Guo","year":"2009","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jcss.2026.103784_br0310","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s00453-012-9685-8","article-title":"The parameterized complexity of local search for TSP, more refined","volume":"67","author":"Guo","year":"2013","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2026.103784_br0320","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."},{"key":"10.1016\/j.jcss.2026.103784_br0330","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.tcs.2012.12.049","article-title":"Incremental list coloring of graphs, parameterized by conservation","volume":"494","author":"Hartung","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103784_br0340","series-title":"Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science (MFCS '23)","first-page":"54:1","article-title":"On the complexity of computing time series medians under the move-split-merge metric","volume":"vol. 272","author":"Holznigenkemper","year":"2023"},{"key":"10.1016\/j.jcss.2026.103784_br0350","series-title":"Proceedings of the 17th International Conference and Workshops on Algorithms and Computation (WALCOM '23)","first-page":"371","article-title":"Structural parameterization of cluster deletion","volume":"vol. 13973","author":"Italiano","year":"2023"},{"issue":"6","key":"10.1016\/j.jcss.2026.103784_br0360","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1007\/s00453-025-01303-1","article-title":"Structural parameterization of cluster deletion","volume":"87","author":"Italiano","year":"2025","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2026.103784_br0370","series-title":"Proceedings of the 31st Annual AAAI Conference on Artificial Intelligence (AAAI '17)","first-page":"846","article-title":"Systematic exploration of larger local search neighborhoods for the minimum vertex cover problem","author":"Katzmann","year":"2017"},{"key":"10.1016\/j.jcss.2026.103784_br0380","series-title":"Proceedings of the 16th International Symposium on Parameterized and Exact Computation (IPEC '21)","first-page":"26:1","article-title":"The PACE 2021 parameterized algorithms and computational experiments challenge: cluster editing","volume":"vol. 214","author":"Kellerhals","year":"2021"},{"key":"10.1016\/j.jcss.2026.103784_br0390","series-title":"Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching (CPM '23)","first-page":"18:1","article-title":"On the complexity of parameterized local search for the maximum parsimony problem","volume":"vol. 259","author":"Komusiewicz","year":"2023"},{"key":"10.1016\/j.jcss.2026.103784_br0400","series-title":"Proceedings of the 17th International Symposium on Parameterized and Exact Computation (IPEC '22)","first-page":"20:1","article-title":"Parameterized local search for vertex cover: when only the search radius is crucial","volume":"vol. 249","author":"Komusiewicz","year":"2022"},{"key":"10.1016\/j.jcss.2026.103784_br0410","series-title":"Proceedings of the 37th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)","first-page":"344","article-title":"Alternative parameterizations for cluster editing","volume":"vol. 6543","author":"Komusiewicz","year":"2011"},{"issue":"15","key":"10.1016\/j.jcss.2026.103784_br0420","doi-asserted-by":"crossref","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","article-title":"Cluster editing with locally bounded modifications","volume":"160","author":"Komusiewicz","year":"2012","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"10.1016\/j.jcss.2026.103784_br0430","doi-asserted-by":"crossref","first-page":"2018","DOI":"10.1007\/s00453-021-00817-8","article-title":"Cluster deletion on interval graphs and split related graphs","volume":"83","author":"Konstantinidis","year":"2021","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2026.103784_br0440","series-title":"50 Years of Integer Programming 1958-2008 - from the Early Years to the State-of-the-Art","first-page":"29","article-title":"The Hungarian method for the assignment problem","author":"Kuhn","year":"2010"},{"key":"10.1016\/j.jcss.2026.103784_br0450","series-title":"Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 25)","first-page":"64:1","article-title":"Cluster editing on cographs and related classes","volume":"vol. 327","author":"Lafond","year":"2025"},{"key":"10.1016\/j.jcss.2026.103784_br0460","series-title":"Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS '21)","first-page":"49:1","article-title":"Cluster editing parameterized above modification-disjoint P3-packings","volume":"vol. 187","author":"Li","year":"2021"},{"issue":"1","key":"10.1016\/j.jcss.2026.103784_br0470","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00453-020-00746-y","article-title":"Parameterized dynamic cluster editing","volume":"83","author":"Luo","year":"2021","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.jcss.2026.103784_br0480","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.103784_br0490","series-title":"On the Complexity of Local Search Problems with Scalable Neighborhoods","author":"Morawietz","year":"2024"},{"key":"10.1016\/j.jcss.2026.103784_br0500","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman","year":"2004","journal-title":"Phys. Rev. E"},{"issue":"1","key":"10.1016\/j.jcss.2026.103784_br0510","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","article-title":"Graph clustering","volume":"1","author":"Schaeffer","year":"2007","journal-title":"Comput. Sci. Rev."},{"issue":"1\u20132","key":"10.1016\/j.jcss.2026.103784_br0520","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":"Discrete Appl. Math."},{"key":"10.1016\/j.jcss.2026.103784_br0530","series-title":"Proceedings of the 16th International Symposium on Parameterized and Exact Computation (IPEC '21)","first-page":"32:1","article-title":"PACE Solver Description: CluES - a heuristic solver for the cluster editing problem","volume":"vol. 214","author":"Swat","year":"2021"},{"issue":"1","key":"10.1016\/j.jcss.2026.103784_br0540","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.disopt.2010.07.003","article-title":"The parameterized complexity of k-flip local search for SAT and MAX SAT","volume":"8","author":"Szeider","year":"2011","journal-title":"Discrete Optim."},{"issue":"2","key":"10.1016\/j.jcss.2026.103784_br0550","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s00224-020-10005-w","article-title":"Faster parameterized algorithm for cluster vertex deletion","volume":"65","author":"Dekel","year":"2021","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.jcss.2026.103784_br0560","article-title":"Cluster deletion revisited","volume":"173","author":"Dekel","year":"2022","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10.1016\/j.jcss.2026.103784_br0570","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/s11336-020-09743-0","article-title":"Combining clickstream analyses and graph-modeled data clustering for identifying common response processes","volume":"86","author":"Ulitzsch","year":"2021","journal-title":"Psychometrika"},{"issue":"3","key":"10.1016\/j.jcss.2026.103784_br0580","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/s00224-016-9746-5","article-title":"Parameterizing edge modification problems above lower bounds","volume":"62","author":"van Bevern","year":"2018","journal-title":"Theory Comput. Syst."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000309?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000309?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T10:52:37Z","timestamp":1773139957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":58,"alternative-id":["S0022000026000309"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103784","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Graph clustering problems under the lens of parameterized local search","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.103784","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":"103784"}}