{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:24Z","timestamp":1759639044233,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030752415"},{"type":"electronic","value":"9783030752422"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75242-2_15","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:22:29Z","timestamp":1620141749000},"page":"216-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering"],"prefix":"10.1007","author":[{"given":"Aleksander","family":"Figiel","sequence":"first","affiliation":[]},{"given":"Anne-Sophie","family":"Himmel","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,4]]},"reference":[{"issue":"3\u20134","key":"15_CR1","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1007\/s00453-011-9492-7","volume":"62","author":"R van Bevern","year":"2012","unstructured":"van Bevern, R., Moser, H., Niedermeier, R.: Approximation and tidying - a problem kernel for $$s$$-plex cluster vertex deletion. Algorithmica 62(3\u20134), 930\u2013950 (2012). https:\/\/doi.org\/10.1007\/s00453-011-9492-7","journal-title":"Algorithmica"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-39053-1_5","volume-title":"The Nature of Computation. Logic, Algorithms, Applications","author":"S B\u00f6cker","year":"2013","unstructured":"B\u00f6cker, S., Baumbach, J.: Cluster editing. In: Bonizzoni, P., Brattka, V., L\u00f6we, B. (eds.) CiE 2013. LNCS, vol. 7921, pp. 33\u201344. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39053-1_5"},{"issue":"52","key":"15_CR3","doi-asserted-by":"publisher","first-page":"5467","DOI":"10.1016\/j.tcs.2009.05.006","volume":"410","author":"S B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q.B.A., Tru\u00df, A.: Going weighted: parameterized algorithms for cluster editing. Theoret. Comput. Sci. 410(52), 5467\u20135480 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.05.006","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: evaluation and experiments. Algorithmica 60(2), 316\u2013334 (2011). https:\/\/doi.org\/10.1007\/s00453-009-9339-7","journal-title":"Algorithmica"},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28(1), 277\u2013305 (2014). https:\/\/doi.org\/10.1137\/120880240","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","volume":"58","author":"A Boral","year":"2016","unstructured":"Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: A fast branching algorithm for cluster vertex deletion. Theory Comput. Syst. 58(2), 357\u2013376 (2016). https:\/\/doi.org\/10.1007\/s00224-015-9631-7","journal-title":"Theory Comput. Syst."},{"key":"15_CR7","unstructured":"Crespelle, C., Drange, P.G., Fomin, F.V., Golovach, P.A.: A survey of parameterized algorithms and the complexity of edge modification. CoRR, abs\/2001.06867 (2020). https:\/\/arxiv.org\/abs\/2001.06867"},{"key":"15_CR8","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Dondi, R., Lafond, M.: On the tractability of covering a graph with 2-clubs. In: Gasieniec, L.A., Jansson, J., Levcopoulos, C. (eds.) FCT 2019. LNCS, vol. 11651, pp. 243\u2013257. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25027-0_17","DOI":"10.1007\/978-3-030-25027-0_17"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.7155\/jgaa.00491","volume":"23","author":"R Dondi","year":"2019","unstructured":"Dondi, R., Mauri, G., Sikora, F., Zoppis, I.: Covering a graph with clubs. J. Graph Algorithms Appl. 23(2), 271\u2013292 (2019). https:\/\/doi.org\/10.7155\/jgaa.00491","journal-title":"J. Graph Algorithms Appl."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2019.03.045","volume":"777","author":"R Dondi","year":"2019","unstructured":"Dondi, R., Mauri, G., Zoppis, I.: On the tractability of finding disjoint clubs in a network. Theoret. Comput. Sci. 777, 243\u2013251 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.03.045","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Doucha, M., Kratochv\u00edl, J.: Cluster vertex deletion: a parameterization between vertex cover and clique-width. In: Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012). LNCS, vol. 7464, pp. 348\u2013359. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/s00453-011-9492-7","DOI":"10.1007\/s00453-011-9492-7"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.disopt.2010.09.006","volume":"8","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graph-based data clustering with overlaps. Discrete Optim. 8(1), 2\u201317 (2011)","journal-title":"Discrete Optim."},{"key":"15_CR14","unstructured":"Figiel, A., Himmel, A., Nichterlein, A., Niedermeier, R.: On 2-clubs in graph-based data clustering: theory and algorithm engineering. CoRR, abs\/2006.14972 (2020). https:\/\/arxiv.org\/abs\/2006.14972"},{"issue":"10\u201311","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1016\/j.dam.2013.01.016","volume":"161","author":"Y Gao","year":"2013","unstructured":"Gao, Y., Hare, D.R., Nastos, J.: The parametric complexity of graph diameter augmentation. Discrete Appl. Math. 161(10\u201311), 1626\u20131631 (2013). https:\/\/doi.org\/10.1016\/j.dam.2013.01.016","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00224-004-1178-y","volume":"38","author":"J Gramm","year":"2005","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: exact algorithms for clique generation. Theory Comput. Syst. 38(4), 373\u2013392 (2005). https:\/\/doi.org\/10.1007\/s00224-004-1178-y","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1137\/090767285","volume":"24","author":"J Guo","year":"2010","unstructured":"Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: A more relaxed model for graph-based data clustering: $$s$$-plex cluster editing. SIAM J. Discrete Math. 24(4), 1662\u20131683 (2010). https:\/\/doi.org\/10.1137\/090767285","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-19084-6_5","volume-title":"Learning and Intelligent Optimization","author":"S Hartung","year":"2015","unstructured":"Hartung, S., Hoos, H.H.: Programming by optimisation meets parameterised algorithmics: a case study for cluster editing. In: Dhaenens, C., Jourdan, L., Marmion, M.-E. (eds.) LION 2015. LNCS, vol. 8994, pp. 43\u201358. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19084-6_5"},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-33293-7_22","volume":"19","author":"S Hartung","year":"2015","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A.: Parameterized algorithmics and computational experiments for finding 2-clubs. J. Graph Algorithms Appl. 19(1), 155\u2013190 (2015). https:\/\/doi.org\/10.1007\/978-3-642-33293-7_22","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196\u2013217 (2010). https:\/\/doi.org\/10.1007\/s00224-008-9150-x","journal-title":"Theory Comput. Syst."},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"36780","DOI":"10.1109\/ACCESS.2018.2852275","volume":"6","author":"S Jia","year":"2018","unstructured":"Jia, S., et al.: Viewing the meso-scale structures in protein-protein interaction networks using 2-clubs. IEEE Access 6, 36780\u201336797 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2852275","journal-title":"IEEE Access"},{"issue":"15","key":"15_CR22","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discrete Appl. Math. 160(15), 2259\u20132270 (2012). https:\/\/doi.org\/10.1016\/j.dam.2012.05.019","journal-title":"Discrete Appl. Math."},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53174-7_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"C Komusiewicz","year":"2016","unstructured":"Komusiewicz, C., Nichterlein, A., Niedermeier, R.: Parameterized algorithmics for graph modification problems: on interactions with heuristics. In: Mayr, E.W. (ed.) WG 2015. LNCS, vol. 9224, pp. 3\u201315. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53174-7_1"},{"issue":"3","key":"15_CR24","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1016\/j.ejor.2018.12.006","volume":"275","author":"C Komusiewicz","year":"2019","unstructured":"Komusiewicz, C., Nichterlein, A., Niedermeier, R., Picker, M.: Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments. Eur. J. Oper. Res. 275(3), 846\u2013864 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.12.006","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"Liu, H., Zhang, P., Zhu, D.: On editing graphs into 2-club clusters. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM\/FAW 2012. LNCS, vol. 7285, pp. 235\u2013246. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29700-7_22","DOI":"10.1007\/978-3-642-29700-7_22"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-03898-8_22","volume-title":"Parameterized and Exact Computation","author":"D Lokshtanov","year":"2013","unstructured":"Lokshtanov, D., Misra, N., Philip, G., Ramanujan, M.S., Saurabh, S.: Hardness of $$r$$-dominating set on graphs of diameter $$(r + 1)$$. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 255\u2013267. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_22"},{"key":"15_CR27","doi-asserted-by":"publisher","unstructured":"Misra, N., Panolan, F., Saurabh, S.: Subexponential algorithm for d-cluster edge deletion: exception or rule? J. Comput. Syst. Sci. 113, 150\u2013162 (2020). https:\/\/doi.org\/10.1016\/j.jcss.2020.05.008","DOI":"10.1016\/j.jcss.2020.05.008"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-78757-0_14","volume-title":"Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics","author":"S Pasupuleti","year":"2008","unstructured":"Pasupuleti, S.: Detection of protein complexes in protein interaction networks using $$n$$-clubs. In: Marchiori, E., Moore, J.H. (eds.) EvoBIO 2008. LNCS, vol. 4973, pp. 153\u2013164. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78757-0_14"},{"key":"15_CR29","doi-asserted-by":"publisher","unstructured":"Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Truss, A., B\u00f6cker, S.: Exact and heuristic algorithms for weighted cluster editing. In: Proceedings of the 6th Computational Systems Bioinformatics Conference (CSB 2007), pp. 391\u2013401. World Scientific (2007). https:\/\/doi.org\/10.1142\/9781860948732_0040","DOI":"10.1142\/9781860948732_0040"},{"issue":"5","key":"15_CR30","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s11590-011-0311-5","volume":"6","author":"A Sch\u00e4fer","year":"2012","unstructured":"Sch\u00e4fer, A., Komusiewicz, C., Moser, H., Niedermeier, R.: Parameterized computational complexity of finding small-diameter subgraphs. Optim. Lett. 6(5), 883\u2013891 (2012). https:\/\/doi.org\/10.1007\/s11590-011-0311-5","journal-title":"Optim. Lett."},{"issue":"1\u20132","key":"15_CR31","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144(1\u20132), 173\u2013182 (2004)","journal-title":"Discrete Appl. Math."},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Tsur, D.: Faster parameterized algorithm for cluster vertex deletion. CoRR, abs\/1901.07609 (2019)","DOI":"10.1016\/j.ipl.2019.03.009"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75242-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T15:28:58Z","timestamp":1620142138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75242-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030752415","9783030752422"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75242-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}