Author:
Demaine Erik D.,Schulz André
Funder
Deutsche Forschungsgemeinschaft (DE)
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference29 articles.
1. 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–279 (1963)
2. Acketa, D.M., Žuníć, J.D.: On the maximal number of edges of convex digital polygons included into an
$$m\times m$$
m
×
m
-grid. J. Combin. Theory Ser. A 69(2), 358–368 (1995)
3. Bárány, I., Rote, G.: Strictly convex drawings of planar graphs. Doc. Math. 11, 369–391 (2006)
4. Buchin, K., Schulz, A.: On the number of spanning trees a planar graph can have. In: de Berg, M., Meyer, U. (eds.) Algorithms—ESA. Part I. Lectrue Notes in Computer Science, vol. 6346, pp. 110–121. Springer, Berlin (2010)
5. 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’96), pp. 319–328. ACM, New York (1996)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献