{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:49:27Z","timestamp":1743007767792,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_23","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"313-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Parameterized Complexity of\u00a0s-Club with\u00a0Triangle and\u00a0Seed Constraints"],"prefix":"10.1007","author":[{"given":"Jaroslav","family":"Garvardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0829-7032","authenticated-orcid":false,"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4034-525X","authenticated-orcid":false,"given":"Frank","family":"Sommer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.cor.2019.07.003","volume":"111","author":"MT Almeida","year":"2019","unstructured":"Almeida, M.T., Br\u00e1s, R.: The maximum $$l$$-triangle $$k$$-club problem: complexity, properties, and algorithms. Comput. Oper. Res. 111, 258\u2013270 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"23_CR2","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":"8","key":"23_CR3","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"HL Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J Bourjolly","year":"2002","unstructured":"Bourjolly, J., Laporte, G., Pesant, G.: An exact algorithm for the maximum $$k$$-club problem in an undirected graph. Eur. J. Oper. Res. 138(1), 21\u201328 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1007\/s10878-016-0009-9","volume":"33","author":"FD Carvalho","year":"2017","unstructured":"Carvalho, F.D., Almeida, M.T.: The triangle $$k$$-club problem. J. Comb. Optim. 33(3), 814\u2013846 (2017)","journal-title":"J. Comb. Optim."},{"issue":"9","key":"23_CR6","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"},{"key":"23_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"23_CR8","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS, Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.dam.2014.04.016","volume":"174","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Heggernes, P., Kratsch, D., Rafiey, A.: Finding clubs in graph classes. Discret. Appl. Math. 174, 57\u201365 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.7155\/jgaa.00352","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)","journal-title":"J. Graph Algorithms Appl."},{"key":"23_CR11","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\u00fd, O.: On structural parameterizations for the 2-club problem. Discret. Appl. Math. 185, 79\u201392 (2015)","journal-title":"Discret. Appl. Math."},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-07632-4_19","volume-title":"Social Computing and Social Media","author":"R Kanawati","year":"2014","unstructured":"Kanawati, R.: Seed-centric approaches for community detection in complex networks. In: Meiselwitz, G. (ed.) SCSM 2014. LNCS, vol. 8531, pp. 197\u2013208. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07632-4_19"},{"issue":"1","key":"23_CR13","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)","journal-title":"Algorithms"},{"issue":"3","key":"23_CR14","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)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00139635","volume":"13","author":"RJ Mokken","year":"1979","unstructured":"Mokken, R.J., et al.: Cliques, clubs and clans. Qual. Quant. 13(2), 161\u2013173 (1979)","journal-title":"Qual. Quant."},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.ejor.2012.10.021","volume":"226","author":"J Pattillo","year":"2013","unstructured":"Pattillo, J., Youssef, N., Butenko, S.: On clique relaxation models in network analysis. Eur. J. Oper. Res. 226(1), 9\u201318 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"23_CR17","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."},{"issue":"2","key":"23_CR18","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.ejor.2011.10.027","volume":"218","author":"A Veremyev","year":"2012","unstructured":"Veremyev, A., Boginski, V.: Identifying large robust network clusters via new compact formulations of maximum $$k$$-club problems. Eur. J. Oper. Res. 218(2), 316\u2013326 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Whang, J.J., Gleich, D.F., Dhillon, I.S.: Overlapping community detection using seed set expansion. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management (CIKM 2013), pp. 2099\u20132108. ACM (2013)","DOI":"10.1145\/2505515.2505535"},{"issue":"2","key":"23_CR20","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ejor.2017.05.020","volume":"263","author":"O Yezerska","year":"2017","unstructured":"Yezerska, O., Pajouh, F.M., Butenko, S.: On biconnected and fragile subgraphs of low diameter. Eur. J. Oper. Res. 263(2), 390\u2013400 (2017)","journal-title":"Eur. J. Oper. Res."}],"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-031-06678-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:06:51Z","timestamp":1653779211000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","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":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"41% - 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)"}}]}}