{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:30Z","timestamp":1781078250341,"version":"3.54.1"},"publisher-location":"Cham","reference-count":65,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030420703","type":"print"},{"value":"9783030420710","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-42071-0_6","type":"book-chapter","created":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T17:02:44Z","timestamp":1587574964000},"page":"49-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["As Time Goes By: Reflections on Treewidth for Temporal Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2203-4386","authenticated-orcid":false,"given":"Till","family":"Fluschnik","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4590-798X","authenticated-orcid":false,"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1703-1236","authenticated-orcid":false,"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1450-1901","authenticated-orcid":false,"given":"Malte","family":"Renken","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9846-0600","authenticated-orcid":false,"given":"Philipp","family":"Zschoche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Chechik, S., Delling, D., Goldberg, A.V., Werneck, R.F.: On dynamic approximate shortest paths for planar graphs with worst-case costs. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), pp. 740\u2013753. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch53"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-17402-6_2","volume-title":"Algorithms and Complexity","author":"EC Akrida","year":"2019","unstructured":"Akrida, E.C., Mertzios, G.B., Spirakis, P.G.: The temporal explorer who returns to the base. In: Heggernes, P. (ed.) CIAC 2019. LNCS, vol. 11485, pp. 13\u201324. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17402-6_2"},{"key":"6_CR3","doi-asserted-by":"publisher","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."},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a $$k$$-tree. SIAM J. Algebraic Discrete Methods 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"key":"6_CR6","unstructured":"Axiotis, K., Fotakis, D.: On the size and the approximability of minimum temporally connected subgraphs. In: Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). LIPIcs, vol. 55, pp. 149:1\u2013149:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3325859","volume":"24","author":"M Bentert","year":"2019","unstructured":"Bentert, M., Himmel, A.S., Molter, H., Morik, M., Niedermeier, R., Saitenmacher, R.: Listing all maximal $$k$$-plexes in temporal graphs. ACM J. Exp. Algorithmics 24(1), 1\u201313 (2019)","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"1\u20132","key":"6_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2011.08.013","volume":"160","author":"N Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R., Uhlmann, J.: On bounded-degree vertex deletion parameterized by treewidth. Discrete Appl. Math. 160(1\u20132), 53\u201360 (2012)","journal-title":"Discrete Appl. Math."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-57899-4_45","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"HL Bodlaender","year":"1994","unstructured":"Bodlaender, H.L.: Dynamic algorithms for graphs with treewidth 2. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 112\u2013124. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-57899-4_45"},{"issue":"1\u20132","key":"6_CR10","first-page":"1","volume":"11","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11(1\u20132), 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S1571-0653(05)80116-7","volume":"5","author":"HL Bodlaender","year":"2000","unstructured":"Bodlaender, H.L.: The algorithmic theory of treewidth. Electron. Notes Discrete Math. 5, 27\u201330 (2000)","journal-title":"Electron. Notes Discrete Math."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A $$c^k n$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/S0097539795289859","volume":"27","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Hagerup, T.: Parallel algorithms with optimal speedup for bounded treewidth. SIAM J. Comput. 27(6), 1725\u20131746 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/S089548019223992X","volume":"8","author":"HL Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Kloks, T., Kratsch, D.: Treewidth and pathwidth of permutation graphs. SIAM J. Discrete Math. 8(4), 606\u2013616 (1995)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"6_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00008","volume":"2","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., Kloks, T., Kratsch, D., M\u00fcller, H.: Treewidth and minimum fill-in on $$d$$-trapezoid graphs. J. Graph Algorithms Appl. 2(5), 1\u201323 (1998)","journal-title":"J. Graph Algorithms Appl."},{"issue":"7","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.1016\/j.ic.2011.04.003","volume":"209","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations II. Lower bounds. Inf. Comput. 209(7), 1103\u20131119 (2011)","journal-title":"Inf. Comput."},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/0406014","volume":"6","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L., M\u00f6hring, R.H.: The pathwidth and treewidth of cographs. SIAM J. Discrete Math. 6(2), 181\u2013188 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"1\u20133","key":"6_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0166-218X(97)00031-0","volume":"79","author":"HL Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Treewidth for graphs with small chordality. Discrete Appl. Math. 79(1\u20133), 45\u201361 (1997)","journal-title":"Discrete Appl. Math."},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2018.10.016","volume":"142","author":"HL Bodlaender","year":"2019","unstructured":"Bodlaender, H.L., van der Zanden, T.C.: On exploring always-connected temporal graphs of small pathwidth. Inf. Process. Lett. 142, 68\u201371 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1137\/S0097539799359683","volume":"31","author":"V Bouchitt\u00e9","year":"2001","unstructured":"Bouchitt\u00e9, V., Todinca, I.: Treewidth and minimum fill-in: grouping the minimal separators. SIAM J. Comput. 31(1), 212\u2013232 (2001)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"6_CR23","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1080\/17445760.2012.668546","volume":"27","author":"A Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distrib. Syst. 27(5), 387\u2013408 (2012)","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"6_CR24","unstructured":"Casteigts, A., Himmel, A.S., Molter, H., Zschoche, P.: The computational complexity of finding temporal paths under waiting time constraints. CoRR abs\/1909.06437 (2019)"},{"key":"6_CR25","unstructured":"Casteigts, A., Peters, J.G., Schoeters, J.: Temporal cliques admit sparse spanners. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). LIPIcs, vol. 132, pp. 134:1\u2013134:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"6_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977619","volume-title":"Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach","author":"B Courcelle","year":"2012","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press, Cambridge (2012)"},{"key":"6_CR27","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, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"3","key":"6_CR28","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","volume":"30","author":"DP Dailey","year":"1980","unstructured":"Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math. 30(3), 289\u2013293 (1980)","journal-title":"Discrete Math."},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Deligkas, A., Potapov, I.: Optimizing reachability sets in temporal graphs by delaying. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020). AAAI Press (2020, to appear)","DOI":"10.1609\/aaai.v34i06.6533"},{"key":"6_CR30","unstructured":"Dell, H., Husfeldt, T., Jansen, B.M.P., Kaski, P., Komusiewicz, C., Rosamond, F.A.: The first parameterized algorithms and computational experiments challenge. In: Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC 2016). LIPIcs, vol. 63, pp. 30:1\u201330:9. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"6_CR31","unstructured":"Dell, H., Komusiewicz, C., Talmon, N., Weller, M.: The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration. In: Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). LIPIcs, vol. 89, pp. 30:1\u201330:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"6_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-79723-4_9","volume-title":"Parameterized and Exact Computation","author":"M Dom","year":"2008","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated domination and covering: a parameterized perspective. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 78\u201390. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79723-4_9"},{"key":"6_CR33","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"key":"6_CR34","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. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"12","key":"6_CR35","doi-asserted-by":"publisher","first-page":"3597","DOI":"10.1007\/s00453-018-0408-7","volume":"80","author":"P Dvor\u00e1k","year":"2018","unstructured":"Dvor\u00e1k, P., Knop, D.: Parameterized complexity of length-bounded cuts and multicuts. Algorithmica 80(12), 3597\u20133617 (2018)","journal-title":"Algorithmica"},{"key":"6_CR36","unstructured":"Enright, J., Meeks, K., Mertzios, G., Zamaraev, V.: Deleting edges to restrict the size of an epidemic in temporal networks. In: Proceedings of the 44nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), pp. 57:1\u201357:15. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"6_CR37","unstructured":"Enright, J., Meeks, K., Skerman, F.: Changing times to optimise reachability in temporal graphs. CoRR abs\/1802.05905 (2018)"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-662-47672-7_36","volume-title":"Automata, Languages, and Programming","author":"T Erlebach","year":"2015","unstructured":"Erlebach, T., Hoffmann, M., Kammer, F.: On temporal graph exploration. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 444\u2013455. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47672-7_36. Updated version available at https:\/\/arxiv.org\/abs\/1504.07976v2"},{"key":"6_CR39","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 2019). LIPIcs, vol. 132, pp. 141:1\u2013141:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"6_CR40","unstructured":"Erlebach, T., Spooner, J.T.: Faster exploration of degree-bounded temporal graphs. In: Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). LIPIcs, vol. 117, pp. 36:1\u201336:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"6_CR41","unstructured":"Erlebach, T., Spooner, J.T.: A game of cops and robbers on graphs with periodic edge-connectivity. CoRR abs\/1908.06828 (2019)"},{"key":"6_CR42","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2012.10.029","volume":"469","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Mans, B., Santoro, N.: On the exploration of time-varying networks. Theor. Comput. Sci. 469, 53\u201368 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR43","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. TTCSAES, vol. XIV. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"6_CR44","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jcss.2018.12.002","volume":"106","author":"T Fluschnik","year":"2019","unstructured":"Fluschnik, T., Kratsch, S., Niedermeier, R., Sorge, M.: The parameterized complexity of the minimum shared edges problem. J. Comput. Syst. Sci. 106, 23\u201348 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR45","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 806, 197\u2013218 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR46","unstructured":"Fluschnik, T., Niedermeier, R., Rohm, V., Zschoche, P.: Multistage vertex cover. In: Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC 2019). LIPIcs, vol. 148, pp. 14:1\u201314:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"6_CR47","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-030-36683-4_38","volume-title":"Complex Networks and Their Applications VIII","author":"V Froese","year":"2020","unstructured":"Froese, V., Jain, B., Niedermeier, R., Renken, M.: Comparing temporal graphs using dynamic time warping. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) COMPLEX NETWORKS 2019. SCI, vol. 882, pp. 469\u2013480. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36683-4_38"},{"issue":"2","key":"6_CR48","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.jda.2009.05.002","volume":"8","author":"E Gassner","year":"2010","unstructured":"Gassner, E.: The Steiner forest problem revisited. J. Discrete Algorithms 8(2), 154\u2013163 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"6_CR49","unstructured":"Himmel, A.S.: Algorithmic investigations into temporal paths. Master thesis, TU Berlin, April 2018"},{"key":"6_CR50","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-030-36683-4_40","volume-title":"Complex Networks and Their Applications VIII","author":"A-S Himmel","year":"2020","unstructured":"Himmel, A.-S., Bentert, M., Nichterlein, A., Niedermeier, R.: Efficient computation of optimal temporal walks under waiting-time constraints. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) COMPLEX NETWORKS 2019. SCI, vol. 882, pp. 494\u2013506. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36683-4_40"},{"issue":"1","key":"6_CR51","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"AS Himmel","year":"2017","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)","journal-title":"Soc. Netw. Anal. Min."},{"key":"6_CR52","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. CoRR abs\/1108.1780 (2011)"},{"key":"6_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth, Computations and Approximations","author":"T Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"key":"6_CR54","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2013.12.024","volume":"554","author":"B Mans","year":"2014","unstructured":"Mans, B., Mathieson, L.: On the treewidth of dynamic graphs. Theor. Comput. Sci. 554, 217\u2013228 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"6_CR55","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jgt.20085","volume":"49","author":"D Marx","year":"2005","unstructured":"Marx, D.: NP-completeness of list coloring and precoloring extension on the edges of planar graphs. J. Graph Theory 49(4), 313\u2013324 (2005)","journal-title":"J. Graph Theory"},{"issue":"5","key":"6_CR56","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1016\/j.dam.2008.04.002","volume":"157","author":"D Marx","year":"2009","unstructured":"Marx, D.: Complexity results for minimum sum edge coloring. Discrete Appl. Math. 157(5), 1034\u20131045 (2009)","journal-title":"Discrete Appl. Math."},{"key":"6_CR57","unstructured":"Mertzios, G.B., Molter, H., Niedermeier, R., Zamaraev, V., Zschoche, P.: Computing maximum matchings in temporal graphs. CoRR abs\/1905.05304 (2019). To appear in Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. LIPIcs, vol. 154, pp. 27:1\u201327:14 (2020)"},{"key":"6_CR58","doi-asserted-by":"crossref","unstructured":"Mertzios, G.B., Molter, H., Zamaraev, V.: Sliding window temporal graph coloring. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI 2019), pp. 7667\u20137674. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33017667"},{"issue":"3","key":"6_CR59","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(92)90041-S","volume":"41","author":"J Misra","year":"1992","unstructured":"Misra, J., Gries, D.: A constructive proof of Vizing\u2019s theorem. Inf. Process. Lett. 41(3), 131\u2013133 (1992)","journal-title":"Inf. Process. Lett."},{"key":"6_CR60","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-36683-4_42","volume-title":"Complex Networks and Their Applications VIII","author":"H Molter","year":"2020","unstructured":"Molter, H., Niedermeier, R., Renken, M.: Enumerating isolated cliques in temporal networks. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) COMPLEX NETWORKS 2019. SCI, vol. 882, pp. 519\u2013531. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-36683-4_42"},{"key":"6_CR61","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"1\u20133","key":"6_CR62","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(01)00223-2","volume":"115","author":"T Nishizeki","year":"2001","unstructured":"Nishizeki, T., Vygen, J., Zhou, X.: The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Appl. Math. 115(1\u20133), 177\u2013186 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"6_CR63","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"PD Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Comb. Theory Series B 58(1), 22\u201333 (1993)","journal-title":"J. Comb. Theory Series B"},{"key":"6_CR64","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":"6_CR65","doi-asserted-by":"publisher","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 small separators in temporal graphs. J. Comput. Syst. Sci. 107, 72\u201392 (2020)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Treewidth, Kernels, and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42071-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,18]],"date-time":"2022-12-18T14:02:52Z","timestamp":1671372172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-42071-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030420703","9783030420710"],"references-count":65,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42071-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}