{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:12:55Z","timestamp":1743037975857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_16","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"226-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Complexity of\u00a0Cluster Vertex Splitting and\u00a0Company"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Firbas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Dobler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Schafellner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana\u00efs","family":"Villedieu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monika","family":"Wi\u00dfmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"16_CR1","unstructured":"Abu-Khzam, F.N., et al.: Cluster editing with vertex splitting. CoRR, abs\/1901.00156v2 (2023). arxiv.org\/abs\/1901.00156v2"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Abu-Khzam, F.N., Barr, J.R., Fakhereldine, A., Shaw, P.: A greedy heuristic for cluster editing with vertex splitting. In: Proceedings of the 4th International Conference on Artificial Intelligence for Industries (AI4I 2021), pp. 38\u201341. IEEE (2021). https:\/\/doi.org\/10.1109\/AI4I51902.2021.00017","DOI":"10.1109\/AI4I51902.2021.00017"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-96151-4_1","volume-title":"Combinatorial Optimization","author":"FN Abu-Khzam","year":"2018","unstructured":"Abu-Khzam, F.N., Egan, J., Gaspers, S., Shaw, A., Shaw, P.: Cluster editing with vertex splitting. In: Lee, J., Rinaldi, G., Mahjoub, A.R. (eds.) ISCO 2018. LNCS, vol. 10856, pp. 1\u201313. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96151-4_1"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Abu-Khzam, F.N., Egan, J., Gaspers, S., Shaw, A., Shaw, P.: On the parameterized cluster editing with vertex splitting problem. CoRR, abs\/1901.00156v1 (2019). arxiv.org\/abs\/1901.00156v1","DOI":"10.1007\/978-3-319-96151-4_1"},{"key":"16_CR5","unstructured":"Arrighi, E., Bentert, M., Drange, P.G., Sullivan, B., Wolf, P.: Cluster editing with overlapping communities. In: Proceedings of the 18th International Symposium on Parameterized and Exact Computation (IPEC 2023) (2023). Accepted for publication"},{"key":"16_CR6","unstructured":"Askeland, G.: Overlapping community detection using cluster editing with vertex splitting. Master\u2019s thesis, University of Bergen (2022)"},{"key":"16_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2023.100556","volume":"48","author":"C Crespelle","year":"2023","unstructured":"Crespelle, C., Drange, P.G., Fomin, F.V., Golovach, P.A.: A survey of parameterized algorithms and the complexity of edge modification. Comput. Sci. Rev. 48, 100556 (2023). https:\/\/doi.org\/10.1016\/j.cosrev.2023.100556","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s10474-016-0586-1","volume":"149","author":"A Davoodi","year":"2016","unstructured":"Davoodi, A., Javadi, R., Omoomi, B.: Edge clique covering sum of graphs. Acta Math. Hungar. 149(1), 82\u201391 (2016). https:\/\/doi.org\/10.1007\/s10474-016-0586-1","journal-title":"Acta Math. Hungar."},{"issue":"1","key":"16_CR9","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). https:\/\/doi.org\/10.1016\/j.disopt.2010.09.006","journal-title":"Discrete Optim."},{"key":"16_CR10","doi-asserted-by":"publisher","unstructured":"Firbas, A., et al.: The complexity of cluster vertex splitting and company. CoRR, abs\/2309.00504 (2023). https:\/\/doi.org\/10.48550\/ARXIV.2309.00504","DOI":"10.48550\/ARXIV.2309.00504"},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1016\/j.csda.2006.09.035","volume":"52","author":"J Gramm","year":"2007","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R., Piepho, H.-P., Schmid, R.: Algorithms for compact letter displays: comparison and evaluation. Comput. Stat. Data Anal. 52(2), 725\u2013736 (2007). https:\/\/doi.org\/10.1016\/j.csda.2006.09.035","journal-title":"Comput. Stat. Data Anal."},{"key":"16_CR12","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a Symposium on the Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-40996-3_46","volume-title":"Algorithms and Computation","author":"G-H Lin","year":"2000","unstructured":"Lin, G.-H., Kearney, P.E., Jiang, T.: Phylogenetic k-root and steiner k-root. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 539\u2013551. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-40996-3_46"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Yang, J., Leskovec, J.: Structure and overlaps of ground-truth communities in networks. ACM Trans. Intell. Syst. Technol. 5(2), 26:1\u201326:35 (2014). https:\/\/doi.org\/10.1145\/2594454","DOI":"10.1145\/2594454"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:04:15Z","timestamp":1711569855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","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":"Cochem","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"81","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":"33","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.11","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":"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)"}}]}}