Information Technology Reference
In-Depth Information
References
1. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for the Visualization of
Graphs. Prentice-Hall (1999)
2. Brewer, C.: ColorBrewer - Color Advice for Maps,
http://www.colorbrewer2.org
3. Chernobelskiy, R., Cunningham, K.I., Goodrich, M.T., Kobourov, S.G., Trott, L.: Force-
directed lombardi-style graph drawing. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034,
pp. 320-331. Springer, Heidelberg (2011)
4. Davis, T.A., Hu, Y.: University of Florida Sparse Matrix Collection. ACM Transaction on
Mathematical Software 38, 1-18 (2011)
5. Di Battista, G., Vismara, L.: Angles of planar triangular graphs. In: Proceedingsofthe
Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 431-437.
ACM, New York (1993)
6. Didimo, W., Eades, P., Liotta, G.: Drawinggraphs with right angle crossings. Theor. Comput.
Sci. 412(39), 5156-5166 (2011)
7. Dillencourt, M.B., Eppstein, D., Goodrich, M.T.: Choosing colors for geometric graphs via
color space embeddings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372,
pp. 294-305. Springer, Heidelberg (2007)
8. Duncan, C., Eppstein, D., Goodrich, M.T., Kobourov, S., Nollenburg, M.: Lombardi drawings
of graphs. J. Graph Algorithms and Applications 16, 85-108 (2012)
9. Gansner, E.R., Hu, Y., Kobourov, S.: Visualizing Graphs and Clusters as Maps. IEEE Com-
puter Graphics and Applications 30, 54-66 (2010)
10. Gansner, E.R., North, S.: An open graph visualization system and its applications to software
engineering.Software-Practice & Experience 30, 1203-1233 (2000)
11. Garg, A., Tamassia, R.: Planar drawingsandangular resolution: Algorithms and bounds. In:
van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 12-23. Springer, Heidelberg (1994)
12. Hu, Y., Kobourov, S., Veeramoni, S.: On maximum differential graph coloring.In:Bran-
des, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 274-286. Springer, Heidelberg
(2011)
13. Hu, Y., Shi, L. (2014),
http://arxiv.org/abs/1409.0436
14. Huang,W.:Using eye tracking to investigate graph layout effects. In: 2007 6th International
Asia-Pacific SymposiumonVisualization, APVIS 2007, pp. 97-100 (2007)
15. Huang,W.,Hong, S.-H., Eades, P.: Effects of crossing angles. In: Proceedings of IEEE Pa-
cific Visualization Symposium, pp. 41-46. IEEE (2008)
16. Jianu,R.,Rusu, A., Fabian, A.J., Laidlaw, D.H.: A coloring solution to the edge crossing
problem. In: Proceedings of the 13th International Conference in Information Visualization
(iV 2009), pp. 691-696. IEEE Computer Society (2009)
17. Moscovich, T., Chevalier, F., Henry, N., Pietriga, E., Fekete, J.: Topology-aware navigation
in large networks. In: CHI 2009: Proceedings of the 27th International Conference on Human
Factors in Computing Systems, pp. 2319-2328. ACM, New York (2009)
18. Purchase, H.C.: Which aesthetic has the greatest effect on human understanding?In:DiBat-
tista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248-261. Springer, Heidelberg (1997)
19. Purchase, H.C., Carrington, D., Allder, J.-A.: Experimenting with aesthetics-based graph
layout. In: Anderson, M., Cheng, P., Haarslev, V. (eds.) Diagrams 2000. LNCS (LNAI),
vol. 1889, pp. 498-501. Springer, Heidelberg (2000)
20. Purchase, H.C., Hamer, J., Nollenburg, M., Kobourov, S.G.: On the usability of lombardi
graph drawings. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 451-
462. Springer, Heidelberg (2013)
21. Ware, C., Purchase, H., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthet-
ics. Information Visualization 1(2), 103-110 (2002)
