{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:16:04Z","timestamp":1774419364727,"version":"3.50.1"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100011264","name":"FP7 People: Marie-Curie Actions","doi-asserted-by":"publisher","award":["631163.11"],"award-info":[{"award-number":["631163.11"]}],"id":[{"id":"10.13039\/100011264","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["677651,714704"],"award-info":[{"award-number":["677651,714704"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["551145\/14,1456\/18,551145\/14"],"award-info":[{"award-number":["551145\/14,1456\/18,551145\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["NI 369\/17"],"award-info":[{"award-number":["NI 369\/17"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["949707"],"award-info":[{"award-number":["949707"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"crossref","award":["17-20065S"],"award-info":[{"award-number":["17-20065S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]},{"name":"OP VVV MEYS","award":["CZ.02.1.01\/0.0\/0.0\/16 019\/0000765"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16 019\/0000765"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00224-024-10174-y","type":"journal-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T12:01:50Z","timestamp":1720008110000},"page":"1239-1290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Cluster Editing for Multi-Layer and Temporal\u00a0Graphs"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8163-1327","authenticated-orcid":false,"given":"Jiehua","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4590-798X","authenticated-orcid":false,"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7394-3147","authenticated-orcid":false,"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7236-8336","authenticated-orcid":false,"given":"Ond\u0159ej","family":"Such\u00fd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"10174_CR1","unstructured":"Chen, J., Molter, H., Sorge, M., Such\u00fd, O.: Cluster editing in multi-layer and temporal graphs. In: Proceedings of the 29th International Symposium on Algorithms and Computation (ISAAC \u201918). LIPIcs, vol. 123. pp. 24:1\u201324:13. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"1\u20132","key":"10174_CR2","doi-asserted-by":"crossref","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":"10174_CR3","doi-asserted-by":"crossref","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, 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"10174_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., Baumbach, J.: Cluster Editing. In: Proceedings of the 9th Conference on Computability in Europe (CiE \u201913). LNCS, vol. 7921. pp. 33\u201344. Springer (2013)","DOI":"10.1007\/978-3-642-39053-1_5"},{"issue":"4","key":"10174_CR5","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/s00224-004-1178-y","volume":"38","author":"J Gramm","year":"2005","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory of Computing Systems 38(4), 373\u2013392 (2005)","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"10174_CR6","doi-asserted-by":"crossref","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":"7","key":"10174_CR7","doi-asserted-by":"crossref","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":"10174_CR8","doi-asserted-by":"crossref","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, 2259\u20132270 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"10174_CR9","doi-asserted-by":"crossref","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":"3","key":"10174_CR10","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1007\/s00224-016-9746-5","volume":"62","author":"R van Bevern","year":"2018","unstructured":"van Bevern, R., Froese, V., Komusiewicz, C.: Parameterizing edge modification problems above lower bounds. Theor. Comput. Syst. 62(3), 739\u2013770 (2018)","journal-title":"Theor. Comput. Syst."},{"key":"10174_CR11","unstructured":"Li S., Pilipczuk M., Sorge M.: Cluster editing parameterized above modification-disjoint $${P}_3$$-packings. In: B\u00e4ser, M., Monmege, B. (eds.) Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 187. pp. 49:1\u201349:16. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"10174_CR12","unstructured":"Kellerhals, L., Koana, T., Nichterlein, A., Zschoche, P.: The pace 2021 parameterized algorithms and computational experiments challenge: Cluster editing. In: 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). LIPIcs, vol. 214. pp. 26:1\u201326:18. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik"},{"issue":"3","key":"10174_CR13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/2854006.2854013","volume":"44","author":"J Kim","year":"2015","unstructured":"Kim, J., Lee, J.-G.: Community detection in multi-layer graphs: A survey. ACM SIGMOD Rec. 44(3), 37\u201348 (2015)","journal-title":"ACM SIGMOD Rec."},{"issue":"5","key":"10174_CR14","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1007\/s10618-017-0528-8","volume":"31","author":"A Tagarelli","year":"2017","unstructured":"Tagarelli, A., Amelio, A., Gullo, F.: Ensemble-based community detection in multilayer networks. Data Min. Knowl. Disc. 31(5), 1506\u20131543 (2017)","journal-title":"Data Min. Knowl. Disc."},{"key":"10174_CR15","doi-asserted-by":"crossref","unstructured":"Tang, W., Lu, Z., Dhillon, I.S.: Clustering with Multiple Graphs. In: Proceedings of the 9th IEEE International Conference on Data Mining (ICDM \u201909). pp. 1016\u20131021. IEEE Computer Society (2009)","DOI":"10.1109\/ICDM.2009.125"},{"key":"10174_CR16","doi-asserted-by":"crossref","unstructured":"Tantipathananandh C., Berger-Wolf, T.Y.: Finding Communities in Dynamic Social Networks. In: Proceedings of the 11th IEEE International Conference on Data Mining (ICDM \u201911). pp. 1236\u20131241. IEEE Computer Society (2011)","DOI":"10.1109\/ICDM.2011.67"},{"key":"10174_CR17","doi-asserted-by":"crossref","unstructured":"Tantipathananandh, C., Berger-Wolf, T.Y., Kempe, D.: A Framework for Community Identification in Dynamic Social Networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201907). pp. 717\u2013726. ACM (2007)","DOI":"10.1145\/1281192.1281269"},{"issue":"2","key":"10174_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3172867","volume":"51","author":"G Rossetti","year":"2018","unstructured":"Rossetti, G., Cazabet, R.: Community discovery in dynamic networks: a survey. ACM Computing Surveys (CSUR) 51(2), 1\u201337 (2018)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"10174_CR19","doi-asserted-by":"crossref","unstructured":"Bocci, C., Capresi, C., Meeks, K., Sylvester, J.: A new temporal interpretation of cluster editing. In: Proceedings of the 33rd International Workshop on Combinatorial Algorithms (IWOCA \u201922). LNCS, vol. 13270. pp. 214\u2013227. Springer (2022)","DOI":"10.1007\/978-3-031-06678-8_16"},{"key":"10174_CR20","doi-asserted-by":"crossref","unstructured":"Yuvaraj, M., Dey, A.K., Lyubchich, V., Gel, Y.R., Poor, H.V.: Topological clustering of multilayer networks. Proc. Nat. Acad. Sci. 118(21), (2021)","DOI":"10.1073\/pnas.2019994118"},{"key":"10174_CR21","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.tcs.2021.04.002","volume":"868","author":"K Heeger","year":"2021","unstructured":"Heeger, K., Himmel, A., Kammer, F., Niedermeier, R., Renken, M., Sajenko, A.: Multistage graph problems on a global budget. Theoret. Comput. Sci. 868, 46\u201364 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"10174_CR22","doi-asserted-by":"crossref","unstructured":"Cai, L., Ye, J.: Dual connectedness of edge-bicolored graphs and beyond. In: Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS\u00a0\u201914). LNCS, vol. 8635. pp. 141\u2013152. Springer (2014)","DOI":"10.1007\/978-3-662-44465-8_13"},{"issue":"3","key":"10174_CR23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1093\/comnet\/cnu016","volume":"2","author":"M Kivel\u00e4","year":"2014","unstructured":"Kivel\u00e4, M., Arenas, A., Barthelemy, M., Gleeson, J.P., Moreno, Y., Porter, M.A.: Multilayer networks. J. Complex Netw. 2(3), 203\u2013271 (2014)","journal-title":"J. Complex Netw."},{"issue":"2","key":"10174_CR24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1017\/nws.2019.13","volume":"7","author":"R Bredereck","year":"2019","unstructured":"Bredereck, R., Komusiewicz, C., Kratsch, S., Molter, H., Niedermeier, R., Sorge, M.: Assessing the computational complexity of multi-layer subgraph detection. Netw. Sci. 7(2), 215\u2013241 (2019)","journal-title":"Netw. Sci."},{"issue":"3","key":"10174_CR25","doi-asserted-by":"crossref","first-page":"032805","DOI":"10.1103\/PhysRevE.92.032805","volume":"92","author":"V Nicosia","year":"2015","unstructured":"Nicosia, V., Latora, V.: Measuring and modeling correlations in multiplex networks. Phys. Rev. E 92(3), 032805 (2015)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"10174_CR26","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/TAI.2021.3065894","volume":"2","author":"G Chao","year":"2021","unstructured":"Chao, G., Sun, S., Bi, J.: A survey on multiview clustering. IEEE Trans. Artif. Intell. 2(2), 146\u2013168 (2021)","journal-title":"IEEE Trans. Artif. Intell."},{"issue":"2","key":"10174_CR27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.26599\/BDMA.2018.9020003","volume":"1","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Wang, H.: Multi-view clustering: A survey. Big Data Mining Anal. 1(2), 83\u2013107 (2018)","journal-title":"Big Data Mining Anal."},{"key":"10174_CR28","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.neucom.2020.02.104","volume":"402","author":"L Fu","year":"2020","unstructured":"Fu, L., Lin, P., Vasilakos, A.V., Wang, S.: An overview of recent multi-view clustering. Neurocomputing 402, 148\u2013161 (2020)","journal-title":"Neurocomputing"},{"issue":"1","key":"10174_CR29","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/s11336-020-09743-0","volume":"86","author":"E Ulitzsch","year":"2021","unstructured":"Ulitzsch, E., He, Q., Ulitzsch, V., Molter, H., Nichterlein, A., Niedermeier, R., Pohl, S.: Combining clickstream analyses and graph-modeled data clustering for identifying common response processes. Psychometrika 86(1), 190\u2013214 (2021)","journal-title":"Psychometrika"},{"key":"10174_CR30","doi-asserted-by":"crossref","unstructured":"Holme, P.: Modern temporal network theory: a colloquium. The European Physical Journal B 88(9), 234:1\u2013234:30 (2015)","DOI":"10.1140\/epjb\/e2015-60657-4"},{"issue":"3","key":"10174_CR31","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"key":"10174_CR32","doi-asserted-by":"crossref","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. 8(1), 61:1\u201361:29 (2018)","DOI":"10.1007\/s13278-018-0537-7"},{"issue":"4","key":"10174_CR33","first-page":"239","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: An algorithmic perspective. Int. Math. 12(4), 239\u2013280 (2016)","journal-title":"Int. Math."},{"key":"10174_CR34","doi-asserted-by":"crossref","unstructured":"Fluschnik, T., Niedermeier, R., Rohm, V.: Philipp: Multistage vertex cover. Theory Comput. Syst. 66(2), 454\u2013483 (2022)","DOI":"10.1007\/s00224-022-10069-w"},{"key":"10174_CR35","unstructured":"Bampis E., Escoffier B., Lampis M., Paschos V.T.: Multistage matchings. In: Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT \u201918). LIPIcs, vol. 101. pp. 7:1\u20137:13. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"3","key":"10174_CR36","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1016\/j.ipm.2018.03.005","volume":"56","author":"N Dakiche","year":"2019","unstructured":"Dakiche, N., Tayeb, F.B.-S., Slimani, Y., Benatchba, K.: Tracking community evolution in social networks: A survey. Inf. Process. Manag. 56(3), 1084\u20131102 (2019)","journal-title":"Inf. Process. Manag."},{"key":"10174_CR37","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer (2013)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"10174_CR38","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, vol. XIV. Springer (2006)"},{"key":"10174_CR39","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"10174_CR40","doi-asserted-by":"crossref","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"key":"10174_CR41","first-page":"79","volume":"16","author":"S B\u00f6cker","year":"2012","unstructured":"B\u00f6cker, S.: A golden ratio parameterized algorithm for Cluster Editing. J. Disc. Algo. 16, 79\u201389 (2012)","journal-title":"J. Disc. Algo."},{"issue":"1","key":"10174_CR42","doi-asserted-by":"crossref","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":"10174_CR43","doi-asserted-by":"crossref","unstructured":"Dehne F., Fellows M., Rosamond F., Shaw P.: Greedy Localization, Iterative Compression, and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting, and a Novel $$2k$$ Kernelization for Vertex Cover. In: Proceedings of 1st International Workshop on Parameterized and Exact Computation (IWPEC\u00a0\u201904). LNCS, vol. 3162. pp. 271\u2013280. Springer (2004)","DOI":"10.1007\/978-3-540-28639-4_24"},{"key":"10174_CR44","doi-asserted-by":"crossref","unstructured":"Himmel, A., 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"},{"key":"10174_CR45","doi-asserted-by":"crossref","unstructured":"Bentert, M., Himmel, A., Molter, H., Morik, M., Niedermeier, R., Saitenmacher, R.: Listing all maximal $$k$$-plexes in temporal graphs. ACM J. Exp. Algorithmics 24(1), 13:1\u201313:27 (2019)","DOI":"10.1145\/3325859"},{"key":"10174_CR46","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 609, 245\u2013252 (2016)","journal-title":"Theoret. Comput. Sci."},{"issue":"S1","key":"10174_CR47","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1017\/nws.2020.38","volume":"9","author":"H Molter","year":"2021","unstructured":"Molter, H., Niedermeier, R., Renken, M.: Isolation concepts applied to temporal clique enumeration. Netw. Sci. 9(S1), 83\u2013105 (2021)","journal-title":"Netw. Sci."},{"key":"10174_CR48","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.tcs.2019.03.031","volume":"806","author":"T Fluschnik","year":"2020","unstructured":"Fluschnik, T., Molter, H., Niedermeier, R., Renken, M., Zschoche, P.: Temporal graph classes: A view through temporal separators. Theoret. Comput. Sci. 806, 197\u2013218 (2020)","journal-title":"Theoret. Comput. Sci."},{"key":"10174_CR49","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.jcss.2019.07.006","volume":"107","author":"P Zschoche","year":"2020","unstructured":"Zschoche, P., Fluschnik, T., Molter, H., Niedermeier, R.: The complexity of finding separators in temporal graphs. J. Comput. Syst. Sci. 107, 72\u201392 (2020)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10174_CR50","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci. 64(4), 820\u2013842 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"9","key":"10174_CR51","doi-asserted-by":"crossref","first-page":"2754","DOI":"10.1007\/s00453-021-00831-w","volume":"83","author":"A Casteigts","year":"2021","unstructured":"Casteigts, A., Himmel, A., Molter, H., Zschoche, P.: Finding temporal paths under waiting time constraints. Algorithmica 83(9), 2754\u20132802 (2021)","journal-title":"Algorithmica"},{"key":"10174_CR52","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.jcss.2021.03.005","volume":"120","author":"GB Mertzios","year":"2021","unstructured":"Mertzios, G.B., Molter, H., Zamaraev, V.: Sliding window temporal graph coloring. J. Comput. Syst. Sci. 120, 97\u2013115 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"10174_CR53","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.jcss.2019.08.002","volume":"107","author":"EC Akrida","year":"2020","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G., Zamaraev, V.: Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci. 107, 108\u2013123 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"10174_CR54","unstructured":"Mertzios G.B., Molter H., Niedermeier R., Zamaraev V., Zschoche P.: Computing maximum matchings in temporal graphs. In: Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS \u201920). LIPIcs, vol. 154. pp. 27:1\u201327:14. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"10174_CR55","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.tcs.2019.03.026","volume":"806","author":"J Baste","year":"2020","unstructured":"Baste, J., Bui-Xuan, B.-M., Roux, A.: Temporal matching. Theoret. Comput. Sci. 806, 184\u2013196 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10174_CR56","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/3265027","volume":"10","author":"A Agrawal","year":"2018","unstructured":"Agrawal, A., Lokshtanov, D., Mouawad, A.E., Saurabh, S.: Simultaneous feedback vertex set: A parameterized perspective. ACM Trans. Comput. Theor. 10(4), 18 (2018)","journal-title":"ACM Trans. Comput. Theor."},{"issue":"4","key":"10174_CR57","doi-asserted-by":"crossref","first-page":"1416","DOI":"10.1007\/s00453-018-0478-6","volume":"81","author":"GB Mertzios","year":"2019","unstructured":"Mertzios, G.B., Michail, O., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. Algorithmica 81(4), 1416\u20131449 (2019)","journal-title":"Algorithmica"},{"key":"10174_CR58","unstructured":"Erlebach, T., Kammer, F., Luo, K., Sajenko, A., Spooner, J.T.: Two moves per time step make a difference. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP \u201919). LIPIcs, vol. 132. pp. 141:1\u2013141:14. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"10174_CR59","unstructured":"Casteigts, A., Peters, J., Schoeters, J.: Temporal cliques admit sparse spanners. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP \u201919). LIPIcs, vol. 132. pp. 134:1\u2013134:14. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"10174_CR60","doi-asserted-by":"crossref","unstructured":"Gupta, A., Talwar, K., Wieder, U.: Changing bases: Multistage optimization for matroids and matchings. In: Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP\u00a0\u201914). LNCS, vol. 8572. pp. 563\u2013575. Springer (2014)","DOI":"10.1007\/978-3-662-43948-7_47"},{"key":"10174_CR61","doi-asserted-by":"crossref","unstructured":"Chimani, M., Troost, N., Wiedera, T.: Approximating multistage matching problems. Algorithmica 1\u201319 (2022)","DOI":"10.1007\/s00453-022-00951-x"},{"issue":"2","key":"10174_CR62","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/s00224-022-10069-w","volume":"66","author":"T Fluschnik","year":"2022","unstructured":"Fluschnik, T., Niedermeier, R., Rohm, V., Zschoche, P.: Multistage vertex cover. Theory Comput. Syst. 66(2), 454\u2013483 (2022)","journal-title":"Theory Comput. Syst."},{"key":"10174_CR63","unstructured":"Fluschnik, T., Niedermeier,R., Schubert, C., Zschoche, P.: Multistage $$s$$-$$t$$ path: Confronting similarity with dissimilarity in temporal graphs. In: Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC \u201920). LIPIcs, vol. 181, pp. 43:1\u201343:16. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"key":"10174_CR64","unstructured":"Fluschnik, T., Kunz, P.: Bipartite temporal graphs and the parameterized complexity of multistage 2-coloring. In: Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND \u201922). LIPIcs, vol. 221. pp. 16:1\u201316:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"10174_CR65","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.jcss.2022.01.002","volume":"126","author":"E Bampis","year":"2022","unstructured":"Bampis, E., Escoffier, B., Teiller, A.: Multistage knapsack. J. Comput. Syst. Sci. 126, 106\u2013118 (2022)","journal-title":"J. Comput. Syst. Sci."},{"key":"10174_CR66","doi-asserted-by":"crossref","unstructured":"Bampis E., Escoffier B., Kononov A.: LP-based algorithms for multistage minimization problems. In: Proceedings of the 18th International Workshop on Approximation and Online Algorithms (WAOA \u201920). LNCS, vol. 12806. pp. 1\u201315. Springer (2020)","DOI":"10.1007\/978-3-030-80879-2_1"},{"key":"10174_CR67","unstructured":"Bredereck, R., Fluschnik, T., Kaczmarczyk A.: Multistage committee election. (2020) arXiv:2005.02300"},{"key":"10174_CR68","doi-asserted-by":"crossref","unstructured":"Fluschnik, T.: A multistage view on 2-satisfiability. In: Proceedings of the 12th International Conference on Algorithms and Complexity (CIAC \u201921). LNCS, vol. 12701. pp. 231\u2013244. Springer (2021)","DOI":"10.1007\/978-3-030-75242-2_16"},{"key":"10174_CR69","unstructured":"Kellerhals, L., Renken, M., Zschoche, P.: Parameterized algorithms for diverse multistage problems. In: Proceedings of the 29th Annual European Symposium on Algorithms (ESA \u201921). LIPIcs, vol. 204. pp. 55:1\u201355:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"issue":"4","key":"10174_CR70","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.jcss.2010.07.005","volume":"77","author":"N Betzler","year":"2011","unstructured":"Betzler, N., Guo, J., Komusiewicz, C., Niedermeier, R.: Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4), 774\u2013789 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"10174_CR71","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2014.05.002","volume":"542","author":"M D\u00f6rnfelder","year":"2014","unstructured":"D\u00f6rnfelder, M., Guo, J., Komusiewicz, C., Weller, M.: On the parameterized complexity of consensus clustering. Theoret. Comput. Sci. 542, 71\u201382 (2014)","journal-title":"Theoret. Comput. Sci."},{"key":"10174_CR72","unstructured":"Dey, T.K., Rossi, A., Sidiropoulos, A.: Temporal clustering. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA \u201917). LIPIcs, vol. 87. pp. 34:1\u201334:14. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"3","key":"10174_CR73","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"M K\u0159iv\u00e1nek","year":"1986","unstructured":"K\u0159iv\u00e1nek, M., Mor\u00e1vek, J.: NP-hard problems in hierarchical-tree clustering. Acta Informatica 23(3), 311\u2013323 (1986)","journal-title":"Acta Informatica"},{"issue":"1\u20132","key":"10174_CR74","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics Quart. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logistics Quart."},{"key":"10174_CR75","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.tcs.2015.04.023","volume":"589","author":"L Bulteau","year":"2015","unstructured":"Bulteau, L., Chen, J., Faliszewski, P., Niedermeier, R., Talmon, N.: Combinatorial voter control in elections. Theoret. Comput. Sci. 589, 99\u2013120 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10174_CR76","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"10174_CR77","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoret. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10174_CR78","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/120880240","volume":"28","author":"HL Bodlaender","year":"2014","unstructured":"Bodlaender, H.L., Jansen, B.M., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discret. Math. 28(1), 277\u2013305 (2014)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10174-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10174-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10174-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T09:55:15Z","timestamp":1729850115000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10174-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":78,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["10174"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10174-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,3]]},"assertion":[{"value":"16 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}