{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:03:12Z","timestamp":1725552192275},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314257"},{"type":"electronic","value":"9783540316671"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11618058_11","type":"book-chapter","created":{"date-parts":[[2006,1,20]],"date-time":"2006-01-20T04:56:50Z","timestamp":1137733010000},"page":"111-116","source":"Crossref","is-referenced-by-count":2,"title":["How to Embed a Path onto Two Sets of Points"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Trotta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"11_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\u00f1ver, G., Noy, M., Ramos, P.A.: Bipartite embeddings of trees in the plane. Discrete Applied Mathematics\u00a093(2-3), 141\u2013148 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"11_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. Discrete Mathematics\u00a084, 101\u2013103 (1990)","journal-title":"Discrete Mathematics"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book-embeddability of series-parallel digraphs. Algorithmica (to appear)","DOI":"10.1007\/s00453-005-1185-7"},{"key":"11_CR4","series-title":"Contempory Mathematics","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. Contempory Mathematics, vol.\u00a0342. American Mathematical Society, Providence (2004)"},{"key":"11_CR5","series-title":"Algorithms and Combinatories","volume-title":"Discrete and Computational Geometry","author":"A. Kanenko","year":"2003","unstructured":"Kanenko, A., Kano, M.: Discrete geometry on red and blue points in the plane - a survey. In: Discrete and Computational Geometry. Algorithms and Combinatories, vol.\u00a025. Springer, Heidelberg (2003)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. Journal of Graph Algorithms and Applications\u00a06(1), 115\u2013129 (2002)","journal-title":"Journal of Graph Algorithms and Applications"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11618058_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T12:42:25Z","timestamp":1552480945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11618058_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314257","9783540316671"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11618058_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}