Information Technology Reference
In-Depth Information
References
1. Alam, J., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Pupyrev, S.: Balanced circle pack-
ings for planar graphs. Arxiv report arxiv.org/abs/1408.4902 (2014)
2. Bannister, M.J., Devanny, W.E., Eppstein, D., Goodrich, M.T.: The Galois complexity of
graph drawing:Whynumerical solutions are ubiquitous for force-directed, spectral, and cir-
cle packing drawings. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp.
149-161. Springer, Heidelberg (2014)
3. Bern, M., Eppstein, D.: Optimal Mobius transformations for information visualization and
meshing. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp.
14-25. Springer, Heidelberg (2001)
4. Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. Th.
Appl. 9(1-2), 3-24 (1998)
5. Brightwell, G., Scheinerman, E.: Representations of planar graphs. SIAM J. Discrete
Math. 6(2), 214-229 (1993)
6. Chen, G., Yu,X.:Long cycles in 3-connected graphs. J. Comb. Theory B 86(1), 80-99 (2002)
7. Collins, C.R., Stephenson, K.: A circle packing algorithm. Comput. Geom. Th. Appl. 25(3),
233-256 (2003)
8. Dolev, D., Leighton, T., Trickey, H.: Planar embedding of planar graphs. Advances in Com-
puting Research 2, 147-161 (1984)
9. Duncan, C.A., Gansner, E.R., Hu, Y.F., Kaufmann, M., Kobourov, S.G.: Optimal polygonal
representation of planar graphs. Algorithmica 63(3), 672-691 (2012)
10. Eppstein, D.: Planar Lombardi drawingsforsubcubic graphs. In: Didimo, W., Patrignani, M.
(eds.) GD 2012. LNCS, vol. 7704, pp. 126-137. Springer, Heidelberg (2013)
11. Eppstein, D., Holten, D., L offler, M., N ollenburg, M., Speckmann, B., Verbeek, K.: Strict
confluent drawing. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 352-
363. Springer, Heidelberg (2013)
12. de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: On triangle contact graphs. Combina-
torics, Probability & Computing 3(2), 233-246 (1994)
13. Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. Bell System Technical Jour-
nal 38(4), 933-967 (1959)
14. Gon¸alves, D., Leveque, B., Pinlou,A.:Triangle contact representations and duality. Discrete
Comput. Geom. 48(1), 239-254 (2012)
15. Hlineny, P.: Classes and recognition of curve contact graphs. J. Comb. Theory B 74(1), 87-
103 (1998)
16. Koebe, P.: Kontaktprobleme der konformen Abbildung.Ber.Sachs. Akad. Wiss. Leipzig,
Math.-Phys. Kl. 88, 141-164 (1936)
17. Luo, F.: Rigidity of polyhedral surfaces, III. Geometry & Topology 15(4), 2299-2319 (2011)
18. Malitz, S.M., Papakostas, A.: On the angular resolution of planar graphs. SIAM J. Discrete
Math. 7(2), 172-183 (1994)
19. Mohar, B.: A polynomial time circle packing algorithm. Discrete Math. 117(1-3), 257-263
(1993)
20. Nesetril, J., Ossona de Mendez, P.: Sparsity: Graphs, Structures, and Algorithms. Springer
(2012)
21. Nievergelt, J., Reingold, E.M.: Binary search trees of bounded balance. SIAM J. Comput. 2,
33-43 (1973)
