{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:25:28Z","timestamp":1742919928255,"version":"3.40.3"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_4","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"37-51","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Walking Through Waypoints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7402-2662","authenticated-orcid":false,"given":"Saeed","family":"Akhoondian Amiri","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4635-4480","authenticated-orcid":false,"given":"Klaus-Tycho","family":"Foerster","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"issue":"2","key":"4_CR1","first-page":"73","volume":"3","author":"T Akiyama","year":"1980","unstructured":"Akiyama, T., Nishizeki, T., Saito, N.: NP-completeness of the Hamiltonian cycle problem for bipartite graphs. J. Inf. Process. 3(2), 73\u201376 (1980)","journal-title":"J. Inf. Process."},{"key":"4_CR2","unstructured":"Amiri, S.A., Foerster, K.-T., Jacob, R., Schmid, S.: Charting the complexity landscape of waypoint routing. arXiv preprint arXiv:1705.00055 (2017)"},{"key":"4_CR3","unstructured":"Amiri, S.A., Foerster, K.-T., Schmid, S.: Walking through waypoints. arXiv preprint arXiv:1708.09827 (2017)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-319-06686-8_5","volume-title":"Computer Science - Theory and Applications","author":"S Akhoondian Amiri","year":"2014","unstructured":"Akhoondian Amiri, S., Golshani, A., Kreutzer, S., Siebertz, S.: Vertex disjoint paths in upward planar graphs. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J.\u00c9., Vereshchagin, N.K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 52\u201364. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06686-8_5"},{"issue":"6\u20137","key":"4_CR5","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.comgeo.2008.11.004","volume":"42","author":"EM Arkin","year":"2009","unstructured":"Arkin, E.M., Fekete, S.P., Islam, K., Meijer, H., Mitchell, J.S.B., Rodr\u00edguez, Y.N., Polishchuk, V., Rappaport, D., Xiao, H.: Not being (super) thin or solid is hard: a study of grid hamiltonicity. Comput. Geom. 42(6\u20137), 582\u2013605 (2009)","journal-title":"Comput. Geom."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23(1), 11\u201324 (1989)","journal-title":"Discrete Appl. Math."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeld, T., Taslaman, N.: Shortest cycle through specified elements. In: Proceedings of SODA (2012)","DOI":"10.1137\/1.9781611973099.139"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Shortest two disjoint paths in polynomial time. In: Proceedings of ICALP (2014)","DOI":"10.1007\/978-3-662-43948-7_18"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: An approximation algorithm for treewidth. In: Proceedings of FOCS (2013)","DOI":"10.1109\/FOCS.2013.60"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/3-540-19488-6_110","volume-title":"Automata, Languages and Programming","author":"HL Bodlaender","year":"1988","unstructured":"Bodlaender, H.L.: Dynamic programming on graphs with bounded treewidth. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol. 317, pp. 105\u2013118. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19488-6_110"},{"issue":"1\u20132","key":"4_CR11","first-page":"1","volume":"11","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11(1\u20132), 1\u201321 (1993)","journal-title":"Acta Cybern."},{"issue":"6","key":"4_CR12","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":"4_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ic.2014.12.008","volume":"243","author":"HL Bodlaender","year":"2015","unstructured":"Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86\u2013111 (2015)","journal-title":"Inf. Comput."},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s00453-012-9662-2","volume":"68","author":"G Borradaile","year":"2014","unstructured":"Borradaile, G., Demaine, E.D., Tazari, S.: Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. Algorithmica 68(2), 287\u2013311 (2014)","journal-title":"Algorithmica"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45579-5_17","volume-title":"Computers and Games","author":"M Buro","year":"2001","unstructured":"Buro, M.: Simple Amazons endgames and their connection to Hamilton circuits in cubic subgrid graphs. In: Marsland, T., Frank, I. (eds.) CG 2000. LNCS, vol. 2063, pp. 250\u2013261. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45579-5_17"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/s00453-007-9129-z","volume":"54","author":"C Chekuri","year":"2009","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: A note on multiflows and treewidth. Algorithmica 54(3), 400\u2013412 (2009)","journal-title":"Algorithmica"},{"key":"4_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M.: The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable. In: Proceedings of FOCS (2013)","DOI":"10.1145\/2591796.2591852"},{"issue":"2","key":"4_CR19","first-page":"19","volume":"7","author":"EC de Verdi\u00e8re","year":"2011","unstructured":"de Verdi\u00e8re, E.C., Schrijver, A.: Shortest vertex-disjoint two-face paths in planar graphs. ACM Trans. Algorithms (TALG) 7(2), 19 (2011)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"4_CR20","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. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0166-218X(97)00121-2","volume":"85","author":"T Eilam-Tzoreff","year":"1998","unstructured":"Eilam-Tzoreff, T.: The disjoint shortest paths problem. Discrete Appl. Math. 85(2), 113\u2013138 (1998)","journal-title":"Discrete Appl. Math."},{"key":"4_CR22","unstructured":"Ene, A., Mnich, M., Pilipczuk, M., Risteski, A.: On routing disjoint paths in bounded treewidth graphs. In: Proceedings of SWAT (2016)"},{"key":"4_CR23","unstructured":"ETSI: Network functions virtualisation. White Paper, October 2013"},{"key":"4_CR24","unstructured":"ETSI: Network functions virtualisation (NFV); use cases. http:\/\/www.etsi.org\/deliver\/etsi_gs\/NFV\/001_099\/001\/01.01.01_60\/gs_NFV001v010101p.pdf (2014)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-319-49259-9_11","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"G Even","year":"2016","unstructured":"Even, G., Medina, M., Patt-Shamir, B.: On-line path computation and function placement in SDNs. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 131\u2013147. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_11"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-319-48314-6_24","volume-title":"Structural Information and Communication Complexity","author":"G Even","year":"2016","unstructured":"Even, G., Rost, M., Schmid, S.: An approximation algorithm for path computation and function placement in SDNs. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 374\u2013390. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48314-6_24"},{"issue":"12","key":"4_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2559899.2560327","volume":"11","author":"N Feamster","year":"2013","unstructured":"Feamster, N., Rexford, J., Zegura, E.: The road to SDN. Queue 11(12), 1\u201321 (2013)","journal-title":"Queue"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-73556-4_38","volume-title":"Combinatorial Optimization and Applications","author":"M Fellows","year":"2007","unstructured":"Fellows, M., Fomin, F.V., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 366\u2013377. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73556-4_38"},{"issue":"1","key":"4_CR29","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s00224-014-9569-1","volume":"58","author":"T Fenner","year":"2016","unstructured":"Fenner, T., Lachish, O., Popa, A.: Min-sum 2-paths problems. Theor. Comp. Sys. 58(1), 94\u2013110 (2016)","journal-title":"Theor. Comp. Sys."},{"issue":"1","key":"4_CR30","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0020-0190(92)90128-I","volume":"42","author":"H Fleischner","year":"1992","unstructured":"Fleischner, H., Woeginger, G.J.: Detecting cycles through three fixed vertices in a graph. Inf. Process. Lett. 42(1), 29\u201333 (1992)","journal-title":"Inf. Process. Lett."},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Foerster, K.-T., Parham, M., Schmid, S.: A walk in the clouds: routing through VNFs on bidirected networks. In: Proceedings of ALGOCLOUD (2017)","DOI":"10.1007\/978-3-319-74875-7_2"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"4_CR33","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"12","author":"A Itai","year":"1982","unstructured":"Itai, A., Perl, Y., Shiloach, Y.: The complexity of finding maximum disjoint paths with length constraints. Networks 12(3), 277\u2013286 (1982)","journal-title":"Networks"},{"issue":"1","key":"4_CR34","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5(1), 45\u201368 (1975)","journal-title":"Networks"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-68891-4_26","volume-title":"Integer Programming and Combinatorial Optimization","author":"K Kawarabayashi","year":"2008","unstructured":"Kawarabayashi, K.: An improved algorithm for finding cycles through elements. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 374\u2013384. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68891-4_26"},{"issue":"3","key":"4_CR36","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1137\/0221032","volume":"21","author":"S Khuller","year":"1992","unstructured":"Khuller, S., Mitchell, S.G., Vazirani, V.V.: Processor efficient parallel algorithms for the two disjoint paths problem and for finding a kuratowski homeomorph. SIAM J. Comput. 21(3), 486\u2013506 (1992)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"4_CR37","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1137\/0220022","volume":"20","author":"S Khuller","year":"1991","unstructured":"Khuller, S., Schieber, B.: Efficient parallel algorithms for testing k-connectivity and finding disjoint s-t paths in graphs. SIAM J. Comput. 20(2), 352\u2013375 (1991)","journal-title":"SIAM J. Comput."},{"key":"4_CR38","doi-asserted-by":"crossref","unstructured":"Klein, P.N., Marx, D.: A subexponential parameterized algorithm for subset TSP on planar graphs. In: Proceedings of SODA (2014)","DOI":"10.1137\/1.9781611973402.131"},{"key":"4_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth, Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-10631-6_31","volume-title":"Algorithms and Computation","author":"Y Kobayashi","year":"2009","unstructured":"Kobayashi, Y., Sommer, C.: On shortest disjoint paths in planar graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 293\u2013302. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_31"},{"key":"4_CR41","volume-title":"Paths, Flows, and VLSI-Layout","author":"A Schrijver","year":"1990","unstructured":"Schrijver, A., Lovasz, L.: Paths, Flows, and VLSI-Layout. Springer-Verlag New York, Inc., Secaucus (1990). Korte, B., Promel, H.J., Graham, R.L. (eds.). ISBN 0387526854"},{"issue":"2","key":"4_CR42","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ipl.2003.09.016","volume":"89","author":"D Marx","year":"2004","unstructured":"Marx, D.: List edge multicoloring in graphs with few cycles. Inf. Process. Lett. 89(2), 85\u201390 (2004)","journal-title":"Inf. Process. Lett."},{"key":"4_CR43","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, 177\u2013186 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"4_CR44","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/18.212275","volume":"39","author":"RG Ogier","year":"1993","unstructured":"Ogier, R.G., Rutenburg, V., Shacham, N.: Distributed algorithms for computing shortest pairs of disjoint paths. IEEE Trans. Inf. Theory 39(2), 443\u2013455 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-10704-5_18","volume-title":"Graph Theory and Algorithms","author":"T Ohtsuki","year":"1981","unstructured":"Ohtsuki, T.: The two disjoint path problem and wire routing design. In: Saito, N., Nishizeki, T. (eds.) Graph Theory and Algorithms. LNCS, vol. 108, pp. 207\u2013216. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10704-5_18"},{"issue":"2","key":"4_CR46","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the traveling salesman problem. J. Algorithms 5(2), 231\u2013246 (1984)","journal-title":"J. Algorithms"},{"issue":"3","key":"4_CR47","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1142\/S0129054100000247","volume":"11","author":"L Perkovi\u0107","year":"2000","unstructured":"Perkovi\u0107, L., Reed, B.A.: An improved algorithm for finding tree decompositions of small width. Int. J. Found. Comput. Sci. 11(3), 365\u2013371 (2000)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR48","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors .XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65\u2013110 (1995)","DOI":"10.1006\/jctb.1995.1006"},{"key":"4_CR49","unstructured":"Rost, M., Schmid, S.: Service chain and virtual network embeddings: approximations using randomized rounding. arXiv preprint arXiv:1604.02180 (2016)"},{"issue":"4","key":"4_CR50","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/357401.357402","volume":"2","author":"JH Saltzer","year":"1984","unstructured":"Saltzer, J.H., Reed, D.P., Clark, D.D.: End-to-end arguments in system design. ACM Trans. Comput. Syst. 2(4), 277\u2013288 (1984)","journal-title":"ACM Trans. Comput. Syst."},{"key":"4_CR51","unstructured":"Scheffler, P.: A practical linear time algorithm for disjoint paths in graphs with bounded tree-width. Technical report, TU Berlin (1994)"},{"issue":"4","key":"4_CR52","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1137\/S0097539792224061","volume":"23","author":"A Schrijver","year":"1994","unstructured":"Schrijver, A.: Finding k disjoint paths in a directed planar graph. SIAM J. Comput. 23(4), 780\u2013788 (1994)","journal-title":"SIAM J. Comput."},{"key":"4_CR53","doi-asserted-by":"crossref","unstructured":"Seb\u00f6, A., van Zuylen, A.: The salesman\u2019s improved paths: A 3\/2+1\/34 approximation. In: Proceedings of FOCS (2016)","DOI":"10.1109\/FOCS.2016.21"},{"issue":"3","key":"4_CR54","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","volume":"29","author":"DP Seymour","year":"1980","unstructured":"Seymour, D.P.: Disjoint paths in graphs. Discrete Math. 29(3), 293\u2013309 (1980)","journal-title":"Discrete Math."},{"issue":"3","key":"4_CR55","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y Shiloach","year":"1980","unstructured":"Shiloach, Y.: A polynomial solution to the undirected two paths problem. J. ACM 27(3), 445\u2013456 (1980)","journal-title":"J. ACM"},{"issue":"4","key":"4_CR56","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s11276-005-1765-0","volume":"11","author":"A Srinivas","year":"2005","unstructured":"Srinivas, A., Modiano, E.: Finding minimum energy disjoint paths in wireless ad-hoc networks. Wireless Netw. 11(4), 401\u2013417 (2005)","journal-title":"Wireless Netw."},{"issue":"4","key":"4_CR57","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C Thomassen","year":"1980","unstructured":"Thomassen, C.: 2-linked graphs. Europ. J. Comb. 1(4), 371\u2013378 (1980)","journal-title":"Europ. J. Comb."}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:00:46Z","timestamp":1709827246000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}