{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:53:22Z","timestamp":1725677602706},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","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-29700-7_2","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"13-25","source":"Crossref","is-referenced-by-count":2,"title":["Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs"],"prefix":"10.1007","author":[{"given":"Jiun-Jie","family":"Wang","sequence":"first","affiliation":[]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00453-006-0177-6","volume":"47","author":"N. Bonichon","year":"2007","unstructured":"Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected planar graph. Algorithmica\u00a047, 399\u2013420 (2007)","journal-title":"Algorithmica"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-11805-0_17","volume-title":"Graph Drawing","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Di Battista, G., Frati, F.: Succinct Greedy Drawings Do Not Always Exist. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 171\u2013182. Springer, Heidelberg (2010)"},{"issue":"1","key":"2_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.7155\/jgaa.00197","volume":"14","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawing of triangulations. Journal of Graph Algorithms and Applications\u00a014(1), 19\u201351 (2010)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"2_CR4","unstructured":"Rote, G.: Strictly Convex Drawings of Planar Graphs. In: Proc. 16th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA 2005, pp. 728\u2013734 (2005)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Cao, L., Strelzoff, A., Sun, J.Z.: On succinctness of geometric greedy routing in Euclidean plane. In: Proc. ISPAN, pp. 326\u2013331 (2009)","DOI":"10.1109\/I-SPAN.2009.20"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/A:1010604726900","volume":"18","author":"S. Felsner","year":"2001","unstructured":"Felsner, S.: Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes. Order\u00a018, 19\u201337 (2001)","journal-title":"Order"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-642-10631-6_79","volume-title":"Algorithms and Computation","author":"M.T. Goodrich","year":"2009","unstructured":"Goodrich, M.T., Strash, D.: Succinct Greedy Geometric Routing in the Euclidean Plane. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 781\u2013791. Springer, Heidelberg (2009)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"He, X., Zhang, H.: Succinct Convex Greedy Drawing of 3-Connected Plane Graphs. In: SODA 2011 (2011)","DOI":"10.1137\/1.9781611973082.115"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s00454-009-9227-6","volume":"44","author":"T. Leighton","year":"2010","unstructured":"Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. Discrete Comput. Geom.\u00a044(3), 686\u2013705 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"334","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theoretical Computer Science\u00a0334(1), 3\u201314 (2005)","journal-title":"Theoretical Computer Science"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W. Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order\u00a05, 323\u2013343 (1989)","journal-title":"Order"},{"key":"2_CR12","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: in Proc. 1st ACM-SIAM Symp. Discrete Algorithms, pp. 138\u2013148 (1990)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:34:29Z","timestamp":1558312469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}