{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:06Z","timestamp":1725502026066},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775362"},{"type":"electronic","value":"9783540775379"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77537-9_34","type":"book-chapter","created":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T14:50:55Z","timestamp":1201704655000},"page":"345-351","source":"Crossref","is-referenced-by-count":2,"title":["Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices"],"prefix":"10.1007","author":[{"given":"Hazel","family":"Everett","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Lazard","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"34_CR1","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."},{"issue":"4","key":"34_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/74074.74088","volume":"20","author":"M. Chrobak","year":"1989","unstructured":"Chrobak, M., Karloff, H.: A lower bound on the size of universal sets for planar graphs. SIGACT News\u00a020(4), 83\u201386 (1989)","journal-title":"SIGACT News"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica\u00a010, 41\u201351 (1990)","journal-title":"Combinatorica"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2004.04.002","volume":"30","author":"E. Giacomo Di","year":"2005","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Curve-constrained drawings of planar graphs. Computational Geometry\u00a030, 1\u201323 (2005)","journal-title":"Computational Geometry"},{"issue":"2","key":"34_CR5","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"},{"issue":"1","key":"34_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"},{"issue":"2","key":"34_CR7","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. Inf. Process. Lett.\u00a092(2), 95\u201398 (2004)","journal-title":"Inf. Process. Lett."},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J. Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graph and Combinatorics\u00a017, 717\u2013728 (2001)","journal-title":"Graph and Combinatorics"},{"unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990. Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pp. 138\u2013148 (1990)","key":"34_CR9"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77537-9_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:15:55Z","timestamp":1619522155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77537-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775362","9783540775379"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77537-9_34","relation":{},"subject":[]}}