{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:39:12Z","timestamp":1767339552249},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_18","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T08:03:51Z","timestamp":1233734631000},"page":"181-192","source":"Crossref","is-referenced-by-count":5,"title":["Hamiltonian Alternating Paths on Bicolored Double-Chains"],"prefix":"10.1007","author":[{"given":"Josef","family":"Cibulka","sequence":"first","affiliation":[]},{"given":"Jan","family":"Kyn\u010dl","sequence":"additional","affiliation":[]},{"given":"Viola","family":"M\u00e9sz\u00e1ros","sequence":"additional","affiliation":[]},{"given":"Rudolf","family":"Stola\u0159","sequence":"additional","affiliation":[]},{"given":"Pavel","family":"Valtr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_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., Garc\u00eda, J., Hernandez, G., Noy, M., Ramos, P.: Bipartite embeddings of trees in the plane. Discrete Appl. Math.\u00a093, 141\u2013148 (1999)","journal-title":"Discrete Appl. Math."},{"key":"18_CR2","unstructured":"Abellanas, M., Garc\u00eda, J., Hurtado, F., Tejel, J.: Caminos alternantes (in Spanish). In: Proc. X Encuentros de Geometr\u00eda Computacional, Sevilla, pp. 7\u201312 (2003) (English version available on Ferran Hurtado\u2019s web page)"},{"key":"18_CR3","volume-title":"Research Problems in Discrete Geometry","author":"P. Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, Heidelberg (2005)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0925-7721(00)00010-9","volume":"16","author":"A. Garc\u00eda","year":"2000","unstructured":"Garc\u00eda, A., Noy, M., Tejel, J.: Lower bounds on the number of crossing-free subgraphs of K\n                  \n                    N\n                  . Comput. Geom.\u00a016, 211\u2013221 (2000)","journal-title":"Comput. Geom."},{"key":"18_CR5","series-title":"Algorithms Comb.","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-642-55566-4_25","volume-title":"Discrete and computational geometry, The Goodman-Pollack Festschrift","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., et al. (eds.) Discrete and computational geometry, The Goodman-Pollack Festschrift. Algorithms Comb., vol.\u00a025, pp. 551\u2013570. Springer, Heidelberg (2003)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1090\/conm\/342\/06134","volume":"342","author":"A. Kaneko","year":"2004","unstructured":"Kaneko, A., Kano, M., Suzuki, K.: Path coverings of two sets of points in the plane. Pach, J. (ed.), Towards a Theory of Geometric Graphs, Contemporary Mathematics\u00a0342, 99\u2013111 (2004)","journal-title":"Pach, J. (ed.), Towards a Theory of Geometric Graphs, Contemporary Mathematics"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-31843-9_34","volume-title":"Graph Drawing","author":"J. Kyn\u010dl","year":"2005","unstructured":"Kyn\u010dl, J., Pach, J., T\u00f3th, G.: Long Alternating Paths in Bicolored Point Sets. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 340\u2013348. Springer, Heidelberg (2005); Also to appear in a special volume of Discrete Mathematics honouring the 60th birthday of M. Simonovits"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T23:54:22Z","timestamp":1551743662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}