{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:22Z","timestamp":1759639042134,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031231001"},{"type":"electronic","value":"9783031231018"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-23101-8_11","type":"book-chapter","created":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T20:18:53Z","timestamp":1671481133000},"page":"159-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Parameterized Complexity of\u00a0s-club Cluster Deletion Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4481-698X","authenticated-orcid":false,"given":"Giacomo","family":"Ortali","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7088-920X","authenticated-orcid":false,"given":"Tommaso","family":"Piselli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9192-2067","authenticated-orcid":false,"given":"Alessandra","family":"Tappini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"11_CR1","unstructured":"Abu-Khzam, F.N., Makarem, N., Shehab, M.: An improved fixed-parameter algorithm for 2-club cluster edge deletion. CoRR. arXiv:2107.01133 (2021)"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Alba, R.: A graph-theoretic definition of a sociometric clique. J. Math. Soc. 3, 113\u2013126 (1973). https:\/\/doi.org\/10.1080\/0022250X.1973.9989826","DOI":"10.1080\/0022250X.1973.9989826"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10878-005-1857-x","volume":"10","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S., Trukhanov, S.: Novel approaches for analyzing biological networks. J. Comb. Optim. 10(1), 23\u201339 (2005). https:\/\/doi.org\/10.1007\/s10878-005-1857-x","journal-title":"J. Comb. Optim."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1007\/978-1-4419-7997-1_9","volume-title":"Handbook of Combinatorial Optimization","author":"B Balasundaram","year":"2013","unstructured":"Balasundaram, B., Pajouh, F.M.: Graph theoretic clique relaxations and applications. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 1559\u20131598. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_9"},{"issue":"1\u20133","key":"11_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004). https:\/\/doi.org\/10.1023\/B:MACH.0000033116.57574.95","journal-title":"Mach. Learn."},{"issue":"3\/4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. J. Comput. Biol. 6(3\/4), 281\u2013297 (1999). https:\/\/doi.org\/10.1089\/106652799318274","journal-title":"J. Comput. Biol."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jda.2012.04.005","volume":"16","author":"S B\u00f6cker","year":"2012","unstructured":"B\u00f6cker, S.: A golden ratio parameterized algorithm for cluster editing. J. Discrete Algorithms 16, 79\u201389 (2012). https:\/\/doi.org\/10.1016\/j.jda.2012.04.005","journal-title":"J. Discrete Algorithms"},{"issue":"6","key":"11_CR8","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996). https:\/\/doi.org\/10.1137\/S0097539793251219","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358\u2013402 (1996). https:\/\/doi.org\/10.1006\/jagm.1996.0049","journal-title":"J. Algorithms"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-030-79987-8_11","volume-title":"Combinatorial Algorithms","author":"D Chakraborty","year":"2021","unstructured":"Chakraborty, D., Chandran, L.S., Padinhatteeri, S., Pillai, R.R.: Algorithms and complexity of s-club cluster vertex deletion. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 152\u2013164. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_11"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jcss.2011.04.001","volume":"78","author":"J Chen","year":"2012","unstructured":"Chen, J., Meng, J.: A 2k kernel for the cluster editing problem. J. Comput. Syst. Sci. 78(1), 211\u2013220 (2012). https:\/\/doi.org\/10.1016\/j.jcss.2011.04.001","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-030-25027-0_17","volume-title":"Fundamentals of Computation Theory","author":"R Dondi","year":"2019","unstructured":"Dondi, R., Lafond, M.: On the tractability of covering a graph with 2-clubs. In: G\u0105sieniec, 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"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science, 1st Edition. Springer (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"7","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1016\/j.jcss.2014.04.015","volume":"80","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing with a small number of clusters. J. Comput. Syst. Sci. 80(7), 1430\u20131447 (2014). https:\/\/doi.org\/10.1016\/j.jcss.2014.04.015","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3390\/a9010021","volume":"9","author":"C Komusiewicz","year":"2016","unstructured":"Komusiewicz, C.: Multivariate algorithmics for finding cohesive subnetworks. Algorithms 9(1), 21 (2016). https:\/\/doi.org\/10.3390\/a9010021","journal-title":"Algorithms"},{"issue":"15","key":"11_CR17","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. Discret. Appl. Math. 160(15), 2259\u20132270 (2012). https:\/\/doi.org\/10.1016\/j.dam.2012.05.019","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0326-0","volume":"6","author":"S Laan","year":"2016","unstructured":"Laan, S., Marx, M., Mokken, R.J.: Close communities in social networks: boroughs and 2-clubs. Soc. Netw. Anal. Min. 6(1), 1\u201316 (2016). https:\/\/doi.org\/10.1007\/s13278-016-0326-0","journal-title":"Soc. Netw. Anal. Min."},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-29700-7_22","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"H Liu","year":"2012","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"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.jcss.2020.05.008","volume":"113","author":"N Misra","year":"2020","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","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"11_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"R Mokken","year":"1979","unstructured":"Mokken, R.: Cliques, clubs and clans. Qual. Quan. Int. J. Methodol. 13(2), 161\u2013173 (1979). https:\/\/doi.org\/10.1007\/BF00139635","journal-title":"Qual. Quan. Int. J. Methodol."},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-016-0345-x","volume":"6","author":"RJ Mokken","year":"2016","unstructured":"Mokken, R.J., Heemskerk, E.M., Laan, S.: Close communication and 2-clubs in corporate networks: europe 2010. Soc. Netw. Anal. Min. 6(1), 1\u201319 (2016). https:\/\/doi.org\/10.1007\/s13278-016-0345-x","journal-title":"Soc. Netw. Anal. Min."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Montecchiani, F., Ortali, G., Piselli, T., Tappini, A.: On the parameterized complexity of the s-club cluster edge deletion problem. CoRR. arXiv:2205.10834 (2022)","DOI":"10.1007\/978-3-031-23101-8_11"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. algorithmic aspects of tree-width. J. Algorithms 7(3), 309\u2013322 (1986)","DOI":"10.1016\/0196-6774(86)90023-4"},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"SE Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007). https:\/\/doi.org\/10.1016\/j.cosrev.2007.05.001","journal-title":"Graph clustering. Comput. Sci. Rev."},{"key":"11_CR26","unstructured":"Sch\u00e4fer, A.: Exact algorithms for $$s$$-club finding and related problems. Diploma thesis, Friedrich-Schiller-Universit\u00e4t Jena (2009)"},{"issue":"1\u20132","key":"11_CR27","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. Discret. Appl. Math. 144(1\u20132), 173\u2013182 (2004). https:\/\/doi.org\/10.1016\/j.dam.2004.01.007","journal-title":"Discret. Appl. Math."},{"issue":"11","key":"11_CR28","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z Wu","year":"1993","unstructured":"Wu, Z., Leahy, R.M.: An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 15(11), 1101\u20131113 (1993). https:\/\/doi.org\/10.1109\/34.244673","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2023: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23101-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:05:40Z","timestamp":1673049940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23101-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031231001","9783031231018"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23101-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ics.science.upjs.sk\/sofsem2023\/","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":"43","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":"26","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":"60% - 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":"6-7","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)"}}]}}