{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:25:41Z","timestamp":1725643541299},"publisher-location":"Berlin, Heidelberg","reference-count":14,"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_8","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"75-85","source":"Crossref","is-referenced-by-count":5,"title":["Small Point Sets for Simply-Nested Planar Graphs"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Squarcella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Open problem garden, http:\/\/garden.irmacs.sfu.ca"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"2005","DOI":"10.7155\/jgaa.00100","volume":"9","author":"C. Bachmaier","year":"2005","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M.: Radial level planarity testing and embedding in linear time. Journal of Graph Algorithms and Applications\u00a09 (2005)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM\u00a041, 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"3","key":"8_CR4","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 in a point set. Computat. Geom. Th. Appl.\u00a023(3), 303\u2013312 (2002)","journal-title":"Computat. Geom. Th. Appl."},{"issue":"2","key":"8_CR5","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. J. Graph Alg. Appl.\u00a010(2), 353\u2013366 (2006)","journal-title":"J. Graph Alg. Appl."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Karloff, H.: A lower bound on the size of universal sets for planar graphs \u00a020, 83\u201386 (1989)","DOI":"10.1145\/74074.74088"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0925-7721(98)00016-9","volume":"11","author":"M. Chrobak","year":"1998","unstructured":"Chrobak, M., Nakano, S.: Minimum-width grid drawings of plane graphs. Computational Geometry\u00a011(1), 29\u201354 (1998)","journal-title":"Computational Geometry"},{"issue":"5","key":"8_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0020-0190(90)90053-Z","volume":"35","author":"R.J. Cimikowski","year":"1990","unstructured":"Cimikowski, R.J.: Finding hamiltonian cycles in certain planar graphs. Information Processing Letters\u00a035(5), 249\u2013254 (1990)","journal-title":"Information Processing Letters"},{"key":"8_CR9","unstructured":"Demaine, E.D., Mitchell, J.S.B., O\u2019Rourke, J.: The open problems project, http:\/\/maven.smith.edu\/~orourke\/TOPP\/"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix","year":"1990","unstructured":"Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"Gritzmann, P., Pach, B.M.J., Pollack, R.: Embedding a planar triangulation with vertices at specified positions. Amer. Math. Mont.\u00a098, 165\u2013166 (1991)","journal-title":"Amer. Math. Mont."},{"issue":"2","key":"8_CR12","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"},{"key":"8_CR13","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1990, pp. 138\u2013148 (1990)"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","volume":"38","author":"M. Yannakakis","year":"1989","unstructured":"Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci.\u00a038, 36\u201367 (1989)","journal-title":"J. Comput. Syst. Sci."}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T19:29:25Z","timestamp":1561058965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}