{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:25:48Z","timestamp":1725643548406},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_6","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"52-63","source":"Crossref","is-referenced-by-count":3,"title":["Orthogeodesic Point-Set Embedding of Trees"],"prefix":"10.1007","author":[{"given":"Emilio","family":"Di Giacomo","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]},{"given":"Radoslav","family":"Fulek","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Krug","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2-3","key":"6_CR1","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. Theoretical Computer Science\u00a0408(2-3), 129\u2013142 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Bra\u00df","year":"2007","unstructured":"Bra\u00df, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom.\u00a036(2), 117\u2013130 (2007)","journal-title":"Comput. Geom."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(01)00069-4","volume":"23","author":"P. Bose","year":"2002","unstructured":"Bose, P.: On embedding an outer-planar graph on a point set. Computational Geometry: Theory and Applications\u00a023, 303\u2013312 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00002","volume":"2","author":"P. Bose","year":"1997","unstructured":"Bose, P., McAllister, M., Snoeyink, J.: Optimal algorithms to embed trees in a point set. Journal of Graph Algorithms and Applications\u00a02(1), 1\u201315 (1997)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.endm.2008.06.005","volume":"31","author":"F.J. Brandenburg","year":"2008","unstructured":"Brandenburg, F.J.: Drawing planar graphs on $\\frac{8}{9}n^2$ area. Electronic Notes in Discrete Mathematics\u00a031, 37\u201340 (2008)","journal-title":"Electronic Notes in Discrete Mathematics"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.7155\/jgaa.00132","volume":"10","author":"S. Cabello","year":"2006","unstructured":"Cabello, S.: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. Journal of Graph Algorithms and Applications\u00a010(2), 353\u2013366 (2006)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-642-25011-8_14","volume-title":"IWOCA 2011","author":"E. Giacomo Di","year":"2011","unstructured":"Di Giacomo, E., Grilli, L., Krug, M., Liotta, G., Rutter, I.: Hamiltonian Orthogeodesic Alternating Paths. In: Iliopoulos, C.S. (ed.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 170\u2013181. Springer, Heidelberg (2011)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1007\/s00453-008-9255-2","volume":"57","author":"E. Giacomo Di","year":"2010","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: Drawing colored graphs with constrained vertex positions and few bends per edge. Algorithmica\u00a057, 796\u2013818 (2010)","journal-title":"Algorithmica"},{"key":"6_CR9","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Mathematica\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Mathematica"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/s00454-009-9149-3","volume":"43","author":"H. Everett","year":"2010","unstructured":"Everett, H., Lazard, S., Liotta, G., Wismath, S.: Universal sets of n points for one-bend drawings of planar graphs with n vertices. Discrete and Computational Geometry\u00a043, 272\u2013288 (2010)","journal-title":"Discrete and Computational Geometry"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Fink, M., Haunert, J.-H., Mchedlidze, T., Spoerhase, J., Wolff, A.: Drawing graphs with vertices at specified positions and crossings at large angles. pre-print, arXiv:1107.4970v1 (July 2011)","DOI":"10.1007\/978-3-642-25878-7_43"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Di Giacomo, E., Frati, F., Fulek, R., Grilli, L., Krug, M.: Orthogeodesic point-set embedding of trees. Technical Report 2011-24, Kalrsruhe Institute of Technology, KIT (2011)","DOI":"10.1007\/978-3-642-25878-7_6"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified points. Amer. Math. Monthly\u00a098(2), 165\u2013166 (1991)","journal-title":"Amer. Math. Monthly"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-11805-0_21","volume-title":"Graph Drawing","author":"B. Katz","year":"2010","unstructured":"Katz, B., Krug, M., Rutter, I., Wolff, A.: Manhattan-Geodesic Embedding of Planar Graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 207\u2013218. Springer, Heidelberg (2010)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","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"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ipl.2004.06.009","volume":"92","author":"M. Kurowski","year":"2004","unstructured":"Kurowski, M.: A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs. Information Processing Letters\u00a092(2), 95\u201398 (2004)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T23:29:27Z","timestamp":1561073367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}