{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:22:25Z","timestamp":1743088945543,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319272603"},{"type":"electronic","value":"9783319272610"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","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":[[2015]]},"DOI":"10.1007\/978-3-319-27261-0_32","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T06:24:59Z","timestamp":1448519099000},"page":"383-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Alternating Paths and Cycles of Minimum Length"],"prefix":"10.1007","author":[{"given":"William S.","family":"Evans","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"issue":"2\u20133","key":"32_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(99)00042-6","volume":"93","author":"M Abellanas","year":"1999","unstructured":"Abellanas, M., Garcia-Lopez, J., Hern\u00e1ndez-Pe\u00f1alver, G., Noy, M., Ramos, P.A.: Bipartite embeddings of trees in the plane. Discr. Appl. Math. 93(2\u20133), 141\u2013148 (1999)","journal-title":"Discr. Appl. Math."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(90)90276-N","volume":"84","author":"J Akiyama","year":"1990","unstructured":"Akiyama, J., Urrutia, J.: Simple alternating path problem. Discr. Math. 84, 101\u2013103 (1990)","journal-title":"Discr. Math."},{"issue":"2\u20133","key":"32_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2008.08.004","volume":"408","author":"M Badent","year":"2008","unstructured":"Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. Theor. Comput. Sci. 408(2\u20133), 129\u2013142 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR4","unstructured":"Bastert, O., Fekete, S.P.: Geometrische Verdrahtungsprobleme. Technical Report 96\u2013247, Universit\u00e4t zu K\u00f6ln (1996)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-03841-4_33","volume-title":"Graph Drawing","author":"TM Chan","year":"2013","unstructured":"Chan, T.M., Hoffmann, H.-F., Kiazyk, S., Lubiw, A.: Minimum length embedding of planar graphs at fixed vertex locations. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 376\u2013387. Springer, Heidelberg (2013)"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-36763-2_26","volume-title":"Graph Drawing","author":"F Frati","year":"2013","unstructured":"Frati, F., Glisse, M., Lenhart, W.J., Liotta, G., Mchedlidze, T., Nishat, R.I.: Point-set embeddability of 2-colored trees. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 291\u2013302. Springer, Heidelberg (2013)"},{"issue":"1","key":"32_CR7","first-page":"29","volume":"12","author":"E Di Giacomo","year":"2008","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Trotta, F., Wismath, S.K.: k-colored point-set embeddability of outerplanar graphs. J. Graph Alg. and Appl. 12(1), 29\u201349 (2008)","journal-title":"J. Graph Alg. and Appl."},{"issue":"4","key":"32_CR8","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1007\/s00453-008-9255-2","volume":"57","author":"E Di Giacomo","year":"2010","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: Drawing colored graphs with constrained vertex positions and few bends per edge. Algorithmica 57(4), 796\u2013818 (2010)","journal-title":"Algorithmica"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/PL00009441","volume":"21","author":"A Kaneko","year":"1999","unstructured":"Kaneko, A., Kano, M.: Straight-line embeddings of two rooted trees in the plane. Disc. Comp. Geometry 21(4), 603\u2013613 (1999)","journal-title":"Disc. Comp. Geometry"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0166-218X(99)00191-2","volume":"101","author":"A Kaneko","year":"2000","unstructured":"Kaneko, A., Kano, M.: Straight line embeddings of rooted star forests in the plane. Discr. Appl. Math. 101, 167\u2013175 (2000)","journal-title":"Discr. Appl. Math."},{"key":"32_CR11","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55566-4_25","volume-title":"Discrete and Computational Geometry","author":"A Kaneko","year":"2003","unstructured":"Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane - a survey-. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry. Algorithms and Combinatorics, vol. 25. Springer, New York (2003)"},{"key":"32_CR12","volume-title":"Towards a Theory of Geometric Graph","author":"A Kaneko","year":"2004","unstructured":"Kaneko, A., Kano, M., Suzuki, K.: Path coverings of two sets of points in the plane. In: Pach, J. (ed.) Towards a Theory of Geometric Graph, vol. 342. American Mathematical Society, Providence (2004)"},{"key":"32_CR13","unstructured":"Kaneko, A., Kano, M., Tokunaga, S.: Straight-line embeddings of three rooted trees in the plane. In: Canadian Conference on Computational Geometry, CCCG 1998 (1998)"},{"key":"32_CR14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1142\/S021819590000005X","volume":"10","author":"A Kaneko","year":"2000","unstructured":"Kaneko, A., Kano, M., Yoshimoto, K.: Alternating hamilton cycles with minimum number of crossing in the plane. Int. J. Comp. Geometry Appl. 10, 73\u201378 (2000)","journal-title":"Int. J. Comp. Geometry Appl."},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Comb. 17, 717\u2013728 (2001)","journal-title":"Graphs Comb."},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: The Euclidean traveling salesman problem is NP-complete. Theor. Comp. Sci. 4, 237\u2013244 (1977)","journal-title":"Theor. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27261-0_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T22:48:56Z","timestamp":1599864536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27261-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319272603","9783319272610"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27261-0_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}