Information Technology Reference
In-Depth Information
3. Angelini, P., Didimo, W., Kobourov, S., Mchedlidze, T., Roselli, V., Symvonis, A., Wis-
math, S.: Monotone drawingsofgraphs with fixed embedding. To appear in Algorithmica,
4. Arkin, E.M., Connelly, R., Mitchell, J.S.: On monotone paths among obstacles with applica-
tions to planning assemblies. In: Proc. 5th Ann. ACM Symp. Comput. Geom. (SoCG 1989),
pp. 334-343 (1989)
5. Barany, I., Rote, G.: Strictly convex drawingsofplanargraphs. Doc. Math. 11, 369-391
(2006)
6. Carlson, J., Eppstein, D.: Trees with convex faces and optimal angles. In: Kaufmann, M.,
Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 77-88. Springer, Heidelberg (2007)
7. Dhandapani, R.: Greedy drawingsoftriangulations. Discrete Comput. Geom. 43(2), 375-392
(2010)
8. Hardy, G., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford Uni-
versity Press (1979)
9. Hossain, M. I., Rahman, M. S.: Monotone Grid DrawingsofPlanar Graphs. In: Chen, J.,
Hopcroft, J.E., Wang, J. (eds.) FAW 2014. LNCS, vol. 8497, pp. 105-116. Springer, Heidel-
berg (2014)
10. Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. Discrete
Comput. Geom. 44(3), 686-705 (2010)
11. N ollenburg,M.,Prutkin, R.: Euclidean greedy drawings of trees. In: Bodlaender, H.L., Ital-
iano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 767-778. Springer, Heidelberg (2013)
