{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:36:57Z","timestamp":1766378217191,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T00:00:00Z","timestamp":1490054400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft (DE)","doi-asserted-by":"publisher","award":["SCHU 2458\/2-1"],"award-info":[{"award-number":["SCHU 2458\/2-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s00454-017-9887-6","type":"journal-article","created":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T03:28:55Z","timestamp":1490153335000},"page":"782-809","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Embedding Stacked Polytopes on a Polynomial-Size Grid"],"prefix":"10.1007","volume":"57","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"issue":"2","key":"9887_CR1","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1090\/S0002-9947-1963-0143105-7","volume":"106","author":"GE Andrews","year":"1963","unstructured":"Andrews, G.E.: A lower bound for the volume of strictly convex bodies with many boundary lattice points. Trans. Am. Math. Soc. 106(2), 270\u2013279 (1963)","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"9887_CR2","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/0097-3165(95)90058-6","volume":"69","author":"DM Acketa","year":"1995","unstructured":"Acketa, D.M., \u017dun\u00ed\u0107, J.D.: On the maximal number of edges of convex digital polygons included into an $$m\\times m$$ m \u00d7 m -grid. J. Combin. Theory Ser. A 69(2), 358\u2013368 (1995)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9887_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. Doc. Math. 11, 369\u2013391 (2006)","journal-title":"Doc. Math."},{"key":"9887_CR4","first-page":"110","volume-title":"Algorithms\u2014ESA. Part I. Lectrue Notes in Computer Science","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.) Algorithms\u2014ESA. Part I. Lectrue Notes in Computer Science, vol. 6346, pp. 110\u2013121. Springer, Berlin (2010)"},{"key":"9887_CR5","doi-asserted-by":"publisher","unstructured":"Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions (preliminary version). In: Proceedings of the 12th Symposium on Computational Geometry (SoCG\u201996), pp. 319\u2013328. ACM, New York (1996)","DOI":"10.1145\/237218.237401"},{"issue":"3","key":"9887_CR6","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. 8(3), 123\u2013137 (1997)","journal-title":"Comput. Geom."},{"key":"9887_CR7","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12971-1","volume-title":"Triangulations","author":"JA Loera De","year":"2010","unstructured":"De Loera, J.A., Rambau, J., Santos, F.: Triangulations. Algorithms and Computation in Mathematics, vol. 25. Springer, Berlin (2010)"},{"key":"9887_CR8","doi-asserted-by":"publisher","unstructured":"Demaine, E.D., Schulz, A.: Embedding stacked polytopes on a polynomial-size grid. In: Randall, D. (ed.) Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 1177\u20131187. SIAM, Philadelphia (2011)","DOI":"10.1137\/1.9781611973082.89"},{"key":"9887_CR9","series-title":"Lecture Notes in Computer Science","first-page":"212","volume-title":"Graph Drawing","author":"P Eades","year":"1995","unstructured":"Eades, P., Garvan, P.: Drawing stressed planar graphs in three dimensions. In: Brandenburg, F.J. (ed.) Graph Drawing. Lecture Notes in Computer Science, vol. 1027, pp. 212\u2013223. Springer, Berlin (1995)"},{"issue":"4","key":"9887_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01758769","volume":"7","author":"JE Hopcroft","year":"1992","unstructured":"Hopcroft, J.E., Kahn, P.J.: A paradigm for robust geometric algorithms. Algorithmica 7(4), 339\u2013380 (1992)","journal-title":"Algorithmica"},{"key":"9887_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.comgeo.2016.03.004","volume":"56","author":"A Igamberdiev","year":"2016","unstructured":"Igamberdiev, A., Schulz, A.: A duality transform for constructing small grid embeddings of 3d polytopes. Comput. Geom. 56, 19\u201336 (2016)","journal-title":"Comput. Geom."},{"issue":"2","key":"9887_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jctb.2000.2027","volume":"82","author":"L Lov\u00e1sz","year":"2001","unstructured":"Lov\u00e1sz, L.: Steinitz representations of polyhedra and the Colin de Verdi\u00e8re number. J. Combin. Theory Ser. B 82(2), 223\u2013236 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"9887_CR13","doi-asserted-by":"publisher","unstructured":"Mondal, D., Nishat, R.I., Rahman, Md.S., Alam, M.J.: Minimum-area drawings of plane 3-trees. J. Graph Algorithms Appl. 15(2), 177\u2013204 (2011)","DOI":"10.7155\/jgaa.00222"},{"issue":"1","key":"9887_CR14","first-page":"125","volume":"35","author":"S Onn","year":"1994","unstructured":"Onn, S., Sturmfels, B.: A quantitative Steinitz\u2019 theorem. Beitr\u00e4ge Algebra Geom. 35(1), 125\u2013129 (1994)","journal-title":"Beitr\u00e4ge Algebra Geom."},{"key":"9887_CR15","unstructured":"Pak, I., Wilson, S.: A quantitative Steinitz theorem for plane triangulations. http:\/\/arxiv.org\/abs\/1311.0558 (2013)"},{"key":"9887_CR16","unstructured":"Rib\u00f3 Mor, A.: Realization and counting problems for planar structures: trees and linkages, polytopes and polyominoes. PhD thesis, Freie Universit\u00e4t, Berlin (2006)"},{"issue":"1","key":"9887_CR17","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 Comput. Geom. 45(1), 65\u201387 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"9887_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","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. 1643. Springer, Berlin (1996)"},{"issue":"4","key":"9887_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1090\/S0273-0979-1995-00604-X","volume":"32","author":"J Richter-Gebert","year":"1995","unstructured":"Richter-Gebert, J., Ziegler, G.M.: Realization spaces of 4-polytopes are universal. Bull. Am. Math. Soc. (N.S.) 32(4), 403\u2013412 (1995)","journal-title":"Bull. Am. Math. Soc. (N.S.)"},{"issue":"4","key":"9887_CR20","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/PL00009434","volume":"21","author":"K Rybnikov","year":"1999","unstructured":"Rybnikov, K.: Stresses and liftings of cell-complexes. Discrete Comput. Geom. 21(4), 481\u2013517 (1999)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"9887_CR21","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. 73(3), 321\u2013341 (1991)","journal-title":"Israel J. Math."},{"issue":"1","key":"9887_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.7155\/jgaa.00216","volume":"15","author":"A Schulz","year":"2011","unstructured":"Schulz, A.: Drawing 3-polytopes with good vertex resolution. J. Graph Algorithms Appl. 15(1), 33\u201352 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"9887_CR23","unstructured":"Steinitz, E.: Polyeder und Raumeinteilungen. Encyclop\u00e4die der mathematischen Wissenschaften. IIIAB12 (Geometrie), pp. 1\u2013139. B.G. Teubner, Leipzig (1922)"},{"key":"9887_CR24","doi-asserted-by":"publisher","unstructured":"Tarjan, R.E.: Linking and cutting trees. In: Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics, Chapter 5, vol. 44, pp. 59\u201370. SIAM, Philadelphia (1983)","DOI":"10.1137\/1.9781611970265.ch5"},{"key":"9887_CR25","unstructured":"Thiele, T.: Extremalprobleme f\u00fcr Punktmengen. Master\u2019s thesis, Freie Universit\u00e4t Berlin, Berlin (1991)"},{"key":"9887_CR26","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"WT Tutte","year":"1960","unstructured":"Tutte, W.T.: Convex representations of graphs. Proc. Lond. Math. Soc. 10, 304\u2013320 (1960)","journal-title":"Proc. Lond. Math. Soc."},{"key":"9887_CR27","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 13, 743\u2013767 (1963)","journal-title":"Proc. Lond. Math. Soc."},{"key":"9887_CR28","unstructured":"Zickfeld, F.: Geometric and combinatorial structures on graphs. PhD thesis, Technische Universit\u00e4t Berlin, Berlin (2007)"},{"key":"9887_CR29","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"GM Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9887-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-017-9887-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-017-9887-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T19:15:26Z","timestamp":1692731726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-017-9887-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,21]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9887"],"URL":"https:\/\/doi.org\/10.1007\/s00454-017-9887-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2017,3,21]]}}}