{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T20:34:03Z","timestamp":1767299643586,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"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-79987-8_11","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"152-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Algorithms and Complexity of s-Club Cluster Vertex Deletion"],"prefix":"10.1007","author":[{"given":"Dibyayan","family":"Chakraborty","sequence":"first","affiliation":[]},{"given":"L. Sunil","family":"Chandran","sequence":"additional","affiliation":[]},{"given":"Sajith","family":"Padinhatteeri","sequence":"additional","affiliation":[]},{"given":"Raji R.","family":"Pillai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-62592-5_80","volume-title":"Algorithms and Complexity","author":"P Alimonti","year":"1997","unstructured":"Alimonti, P., Kann, V.: Hardness of approximating problems on cubic graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 288\u2013298. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62592-5_80"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-642-12200-2_53","volume-title":"LATIN 2010: Theoretical Informatics","author":"Y Asahiro","year":"2010","unstructured":"Asahiro, Y., Miyano, E., Samizo, K.: Approximating maximum diameter-bounded subgraphs. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 615\u2013626. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12200-2_53"},{"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)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00224-002-1004-3","volume":"36","author":"D Bera","year":"2003","unstructured":"Bera, D., Pal, M., Pal, T.K.: An efficient algorithm for finding all hinge vertices on trapezoid graphs. Theor. Comput. Syst. 36(1), 17\u201327 (2003)","journal-title":"Theor. Comput. Syst."},{"doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Kloks, T., Kratsch, D., M\u00fcller, H.: Treewidth and minimum fill-in on d-trapezoid graphs. In: Graph Algorithms And Applications I, pp. 139\u2013161. World Scientific (2002)","key":"11_CR5","DOI":"10.1142\/9789812777638_0008"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2018.05.039","volume":"745","author":"Y Cao","year":"2018","unstructured":"Cao, Y., Ke, Y., Otachi, Y., You, J.: Vertex deletion problems on chordal graphs. Theor. Comput. Sci. 745, 75\u201386 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"11_CR7","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/s00607-012-0263-3","volume":"95","author":"M Chang","year":"2013","unstructured":"Chang, M., Hung, L., Lin, C., Su, P.: Finding large $$k$$-clubs in undirected graphs. Computing 95(9), 739\u2013758 (2013)","journal-title":"Computing"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0166-218X(92)90296-M","volume":"35","author":"P Damaschke","year":"1992","unstructured":"Damaschke, P.: Distances in cocomparability graphs and their powers. Discrete Appl. Math. 35(1), 67\u201372 (1992)","journal-title":"Discrete Appl. Math."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-58218-5_13","volume-title":"Algorithm Theory \u2014 SWAT \u201994","author":"S Felsner","year":"1994","unstructured":"Felsner, S., M\u00fcller, R., Wernisch, L.: Trapezoid graphs and generalizations, geometry and algorithms. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol. 824, pp. 143\u2013154. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58218-5_13"},{"doi-asserted-by":"crossref","unstructured":"Figiel, A., Himmel, A., Nichterlein, A., Niedermeier, R.: On 2-clubs in graph-based data clustering: theory and algorithm engineering. arXiv preprint arXiv:2006.14972 (2020)","key":"11_CR10","DOI":"10.1007\/978-3-030-75242-2_15"},{"unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1978)","key":"11_CR11"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.dam.2014.11.026","volume":"185","author":"S Hartung","year":"2015","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A., Such\u1ef3, O.: On structural parameterizations for the 2-club problem. Discrete Appl. Math. 185, 79\u201392 (2015)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1023\/A:1008791627588","volume":"18","author":"M Hota","year":"2001","unstructured":"Hota, M., Pal, M., Pal, T.K.: An efficient algorithm for finding a maximum weight k-independent set on trapezoid graphs. Comput. Optim. Appl. 18(1), 49\u201362 (2001)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"11_CR14","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. Theor. Comput. Syst. 47(1), 196\u2013217 (2010)","journal-title":"Theor. Comput. Syst."},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2- $$\\varepsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-319-08404-6_28","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"E K\u00f6hler","year":"2014","unstructured":"K\u00f6hler, E., Mouatadid, L.: Linear time LexDFS on cocomparability graphs. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 319\u2013330. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_28"},{"issue":"6","key":"11_CR17","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.ipl.2015.12.001","volume":"116","author":"E K\u00f6hler","year":"2016","unstructured":"K\u00f6hler, E., Mouatadid, L.: A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. Inf. Process. Lett. 116(6), 391\u2013395 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"11_CR18","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0097539703437855","volume":"36","author":"D Kratsch","year":"2006","unstructured":"Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying algorithms for recognizing interval graphs and permutation graphs. SIAM J. Comput. 36(2), 326\u2013353 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR20","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_CR21","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2012.02.042","volume":"438","author":"GB Mertzios","year":"2012","unstructured":"Mertzios, G.B.: The recognition of triangle graphs. Theor. Comput. Sci. 438, 34\u201347 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR22","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"},{"doi-asserted-by":"crossref","unstructured":"Sau, I., Souza, U.S.: Hitting forbidden induced subgraphs on bounded treewidth graphs. arXiv preprint arXiv:2004.08324 (2020)","key":"11_CR23","DOI":"10.1016\/j.ic.2021.104812"},{"unstructured":"Sch\u00e4fer, A.: Exact algorithms for s-club finding and related problems. PhD thesis, Friedrich-Schiller-University Jena (2009)","key":"11_CR24"},{"issue":"5","key":"11_CR25","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)","journal-title":"Optim. Lett."},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.dam.2019.11.009","volume":"282","author":"A Takaoka","year":"2020","unstructured":"Takaoka, A.: A recognition algorithm for simple-triangle graphs. Discrete Appl. Math. 282, 196\u2013207 (2020)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 253\u2013264 (1978)","key":"11_CR27","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T01:56:30Z","timestamp":1672624590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_11","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":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","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":"107","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":"38","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":"36% - 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.1","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":"9.1","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":"The workshop 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)"}}]}}