{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:54:27Z","timestamp":1743112467042,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"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_16","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"214-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Temporal Interpretation of\u00a0Cluster Editing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7874-4419","authenticated-orcid":false,"given":"Cristiano","family":"Bocci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8037-6862","authenticated-orcid":false,"given":"Chiara","family":"Capresi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5299-3073","authenticated-orcid":false,"given":"Kitty","family":"Meeks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6543-2934","authenticated-orcid":false,"given":"John","family":"Sylvester","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-319-03780-6_25","volume-title":"Combinatorial Optimization and Applications","author":"FN Abu-Khzam","year":"2013","unstructured":"Abu-Khzam, F.N.: The multi-parameterized cluster editing problem. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol. 8287, pp. 284\u2013294. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03780-6_25"},{"issue":"1\u20133","key":"16_CR2","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)","journal-title":"Mach. Learn."},{"key":"16_CR3","unstructured":"Bartier, V., Bathie, G., Bousquet, N., Heinrich, M., Pierron, T., Prieto, U.: PACE solver description: $$\\mu $$solver - heuristic track. In: Golovach, P.A., Zehavi, M. (eds.) 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, 8\u201310 September 2021, Lisbon, Portugal, volume 214 of LIPIcs, pp. 33:1\u201333:3. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bocci, C., Capresi, C., Meeks, K., Sylvester, J.: A new temporal interpretation of cluster editing. CoRR, abs\/2202.01103 (2022)","DOI":"10.2139\/ssrn.4184782"},{"key":"16_CR5","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"},{"key":"16_CR6","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). Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s00453-011-9595-1","volume":"64","author":"Y Cao","year":"2012","unstructured":"Cao, Y., Chen, J.: Cluster editing: kernelization based on edge cuts. Algorithmica 64(1), 152\u2013169 (2012)","journal-title":"Algorithmica"},{"issue":"1","key":"16_CR8","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)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR9","unstructured":"Chen, J., Molter, H., Sorge, M., Such\u00fd, O.: Cluster editing in multi-layer and temporal graphs. In: Hsu, W.-L., Lee, D.-T., Liao, C.-S. (eds.) 29th International Symposium on Algorithms and Computation, ISAAC 2018, 16\u201319 December 2018, Jiaoxi, Yilan, Taiwan, volume 123 of LIPIcs, pp. 24:1\u201324:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"16_CR10","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"},{"issue":"9","key":"16_CR11","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s00236-004-0144-0","volume":"40","author":"S Delvaux","year":"2004","unstructured":"Delvaux, S., Horsten, L.: On best transitive approximations to simple graphs. Acta Inform. 40(9), 637\u2013655 (2004)","journal-title":"Acta Inform."},{"issue":"7","key":"16_CR12","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)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Himmel, A.-S., Molter, H., Niedermeier, R., Sorge, M.: Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7(1), 35:1\u201335:16 (2017)","DOI":"10.1007\/s13278-017-0455-0"},{"issue":"15","key":"16_CR14","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)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M Kriv\u00e1nek","year":"1986","unstructured":"Kriv\u00e1nek, M., Mor\u00e1vek, J.: NP -hard problems in hierarchical-tree clustering. Acta Inform. 23(3), 311\u2013323 (1986)","journal-title":"Acta Inform."},{"key":"16_CR16","unstructured":"Li, S., Pilipczuk, M., Sorge, M.: Cluster editing parameterized above modification-disjoint $$P_3$$-packings. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, 16\u201319 March 2021, Saarbr\u00fccken, Germany (Virtual Conference), volume 187 of LIPIcs, pp. 49:1\u201349:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"1","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-020-00746-y","volume":"83","author":"J Luo","year":"2021","unstructured":"Luo, J., Molter, H., Nichterlein, A., Niedermeier, R.: Parameterized dynamic cluster editing. Algorithmica 83(1), 1\u201344 (2021)","journal-title":"Algorithmica"},{"issue":"21","key":"16_CR18","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1016\/j.ipl.2010.08.002","volume":"110","author":"B Mannaa","year":"2010","unstructured":"Mannaa, B.: Cluster editing problem for points on the real line: a polynomial time algorithm. Inf. Process. Lett. 110(21), 961\u2013965 (2010)","journal-title":"Inf. Process. Lett."},{"key":"16_CR19","unstructured":"Mertzios, G.B., Molter, H., Niedermeier, R., Zamaraev, V., Zschoche, P.: Computing maximum matchings in temporal graphs. In: Paul, C., Bl\u00e4ser, M. (eds.) 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, 10\u201313 March 2020, Montpellier, France, volume 154 of LIPIcs, pp. 27:1\u201327:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"1\u20132","key":"16_CR20","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)","journal-title":"Discret. Appl. Math."},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard, T., Latapy, M., Magnien, C.: Computing maximal cliques in link streams. Theor. Comput. Sci. 609, 245\u2013252 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Yang, Z., Algesheimer, R., Tessone, C.J.: A comparative analysis of community detection algorithms on artificial networks. Sci. Rep. 6, article no. 30750 (2016)","DOI":"10.1038\/srep30750"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T17:01:40Z","timestamp":1675702900000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_16","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)"}}]}}