{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T03:10:17Z","timestamp":1774321817360,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642258770","type":"print"},{"value":"9783642258787","type":"electronic"}],"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_23","type":"book-chapter","created":{"date-parts":[[2011,12,15]],"date-time":"2011-12-15T02:23:04Z","timestamp":1323915784000},"page":"238-241","source":"Crossref","is-referenced-by-count":1,"title":["Realizing Planar Graphs as Convex Polytopes"],"prefix":"10.1007","author":[{"given":"G\u00fcnter","family":"Rote","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/0097-3165(95)90058-6","volume":"69","author":"D.M. Acketa","year":"1995","unstructured":"Acketa, D.M., \u017duni\u0107, J.D.: On the maximal number of edges of convex digital polygons included into an m\u00d7m-grid. J. Comb. Theory Ser. A\u00a069(2), 358\u2013368 (1995)","journal-title":"J. Comb. Theory Ser. A"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1090\/S0002-9947-1961-0120222-7","volume":"99","author":"G.E. Andrews","year":"1961","unstructured":"Andrews, G.E.: A lower bound for the volume of strictly convex bodies with many boundary lattice points. Trans. Amer. Math. Soc.\u00a099, 272\u2013277 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"23_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.4171\/dm\/214","volume":"11","author":"I. B\u00e1r\u00e1ny","year":"2006","unstructured":"B\u00e1r\u00e1ny, I., Rote, G.: Strictly convex drawings of planar graphs. Documenta Math.\u00a011, 369\u2013391 (2006)","journal-title":"Documenta Math."},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-642-15775-2_10","volume-title":"Algorithms \u2013 ESA 2010","author":"K. Buchin","year":"2010","unstructured":"Buchin, K., Schulz, A.: On the Number of Spanning Trees a Planar Graph can have. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 110\u2013121. Springer, Heidelberg (2010)"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0925-7721(97)00006-0","volume":"8","author":"G. Das","year":"1997","unstructured":"Das, G., Goodrich, M.T.: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees. Comput. Geom. Theory Appl.\u00a08(3), 123\u2013137 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Schulz, A.: Embedding stacked polytopes on a polynomial-size grid. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, pp. 1177\u20131187 (2011)","DOI":"10.1137\/1.9781611973082.89"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jctb.2000.2027","volume":"82","author":"L. Lov\u00e1sz","year":"2000","unstructured":"Lov\u00e1sz, L.: Steinitz representations of polyhedra and the Colin de Verdi\u00e8re number. J. Comb. Theory, Ser. B\u00a082, 223\u2013236 (2000)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1080\/14786446408643663","volume":"27","author":"J.C. Maxwell","year":"1864","unstructured":"Maxwell, J.C.: On reciprocal figures and diagrams of forces. Phil. Mag. Ser.\u00a027, 250\u2013261 (1864)","journal-title":"Phil. Mag. Ser."},{"key":"23_CR9","unstructured":"Onn, S., Sturmfels, B.: A quantitative Steinitz\u2019 theorem. In: Beitr\u00e4ge zur Algebra und Geometrie, vol.\u00a035, pp. 125\u2013129 (1994)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00454-010-9301-0","volume":"45","author":"A. Rib\u00f3 Mor","year":"2011","unstructured":"Rib\u00f3 Mor, A., Rote, G., Schulz, A.: Small grid embeddings of 3-polytopes. Discrete and Computational Geometry\u00a045, 65\u201387 (2011), http:\/\/page.mi.fuberlin.de\/rote\/Papers\/pdf\/Small+grid+embeddings+of+3-polytopes.pdf","journal-title":"Discrete and Computational Geometry"},{"key":"23_CR11","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0093761","volume-title":"Realization Spaces of Polytopes","author":"J. Richter-Gebert","year":"1996","unstructured":"Richter-Gebert, J.: Realization Spaces of Polytopes. Lecture Notes in Mathematics, vol.\u00a01643. Springer, Heidelberg (1996)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02773845","volume":"73","author":"O. Schramm","year":"1991","unstructured":"Schramm, O.: Existence and uniqueness of packings with specified combinatorics. Israel J. Math.\u00a073, 321\u2013341 (1991)","journal-title":"Israel J. Math."},{"key":"23_CR13","unstructured":"Steinitz, E.: Polyeder und Raumeinteilungen. In: Encyclop\u00e4die der mathematischen Wissenschaften, vol. III.1.2 (Geometrie), chap. IIIAB12, pp. 1\u2013139. B.\u00a0G. Teubner, Leipzig (1922)"},{"key":"23_CR14","unstructured":"Thiele, T.: Extremalprobleme f\u00fcr Punktmengen. Master\u2019s thesis, Freie Universit\u00e4t Berlin (1991)"},{"issue":"38","key":"23_CR15","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex representations of graphs. Proceedings London Mathematical Society\u00a010(38), 304\u2013320 (1960)","journal-title":"Proceedings London Mathematical Society"},{"issue":"52","key":"23_CR16","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proceedings London Mathematical Society\u00a013(52), 743\u2013768 (1963)","journal-title":"Proceedings London Mathematical Society"},{"issue":"6","key":"23_CR17","first-page":"549","volume":"1","author":"K. Voss","year":"1982","unstructured":"Voss, K., Klette, R.: On the maximal number of edges of convex digital polygons included into a square. Po\u010d\u00edta\u010de a umel\u00e1 inteligencia\u00a01(6), 549\u2013558 (1982) (in Russian)","journal-title":"Po\u010d\u00edta\u010de a umel\u00e1 inteligencia"},{"key":"23_CR18","first-page":"13","volume":"7","author":"W. Whiteley","year":"1982","unstructured":"Whiteley, W.: Motion and stresses of projected polyhedra. Structural Topology\u00a07, 13\u201338 (1982)","journal-title":"Structural Topology"},{"key":"23_CR19","unstructured":"Zickfeld, F.: Geometric and Combinatorial Structures on Graphs. Ph.D. thesis, Technical University Berlin (December 2007)"}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T21:11:05Z","timestamp":1686517865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}