1. Battista, G.D., Eades, P.: Algorithms for drawing graphs: an annotated bibliography. Computational Geometry. 4, 235–282 (1994)

   Article MATH MathSciNet  Google Scholar 

2. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, New Jersey, USA (1999)

   MATH  Google Scholar 

3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press and McGraw-Hill, New York, USA (2001)

   MATH  Google Scholar 

4. Cruz, I.F., Twarog, J.P.: 3D Graph Drawing with Simulated Annealing. In: Proceedings of the Symposium on Graph Drawing, pp. 162–165. Springer-Verlag, London, UK (1995)

   Google Scholar 

5. Davidson, R., Harel, D.: Drawing Graphs Nicely Using Simulated Annealing, ACM Transactions on Graphics. 15, 301–331 (1996)

   Article  Google Scholar 

6. Dijksta, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik. 1, 269–271 (1959)

   Article MathSciNet  Google Scholar 

7. Dolulil, J., Katreniakova, J.: Edge Routing with Fixed Node Positions. In: Proceedings of the 12th International Conference Information Visualisation, pp. 626–631. IEEE Computer Society Washington, DC, USA (2008)

   Chapter  Google Scholar 

8. Dwyer, T., Marriott, K., Wybrow, M.: Integrating edge routing into force-directed layout. In: Proceedings 14th Intl. Symp. Graph Drawing (GD ’06), pp. 8–19. Springer-Verlag, Berlin, Heidelberg (2007)

   Google Scholar 

9. Eades, P.: A heuristic for graph drawing. Congressus Numerantium. 42, 149–160 (1984)

   MathSciNet  Google Scholar 

10. Eades, P., Huang, M.L.: Navigating Clustered Graphs using Force-Directed Methods, Journal of Graph Algorithms and Applications. 4, 157–181 (2000)

    MATH  Google Scholar 

11. Eades, P., Lai, W., Misue, K., Sugiyama, K.: Layout adjustment and the mental map. Journal of Visual Languages and Computing. 6, 83–210 (1995)

    Google Scholar 

12. Forster, M.: Crossings in Clustered Level Graphs, Ph.D.Dissertation (2004)

    Google Scholar 

13. Healy, P., Nikolov, N.S.: Graph Drawing. Springer-Verlag, Berlin, Heidelberg (2006)

    Book MATH  Google Scholar 

14. Huang, X., Lai, W., Sajeev, A.S.M., Gao, J.: A new algorithm for removing node overlapping in graph visualization. Information Sciences. 177, 2821–2844 (2007)

    Article MATH MathSciNet  Google Scholar 

15. Kakoulis, K.G., Tollis, I.G.: A unified approach to labeling graphical features. In: Proceedings 14th Annual ACM Symposium of Computational Geometry (SoCG’98), pp. 347–356. ACM New York, NY, USA (1998)

    Google Scholar 

16. Kaufmann, M., Dorothea, W.: Drawing graphs, methods and models. Springer-Verlag, Berlin, Heidelberg (2001)

    Book MATH  Google Scholar 

17. Korb, K.B., Nicholson, A.E.: Bayesian Artificial Intelligence. Chapman & Hall, London, UK (2004)

    MATH  Google Scholar 

18. Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. American Mathematical Society. 7, 48–50 (1956)

    Article MathSciNet  Google Scholar 

19. Kumar, P., Zhang, K.: Social Network Analysis of Online Marketplaces. In: Proceedings IEEE International Conference on e-Business Engineering, pp. 363–367. IEEE Computer Society Washington, DC, USA (2007)

    Google Scholar 

20. Kumar, P., Zhang, K., Wang, Y.: Visualization of Clustered Directed Acyclic Graphs without Node Overlapping. In: Proceedings 12th International Conference on Information Visualization, pp. 38–43. IEEE Computer Society Washington, DC, USA (2008)

    Chapter  Google Scholar 

21. Kumar, P., Zhang K.: Visualization of Clustered Directed Acyclic Graphs with Node Interleaving. In: Proceedings of the 24th Annual ACM Symposium on Applied Computing (SAC ‘09), pp. 1800–1805. ACM New York, NY, USA (2009)

    Chapter  Google Scholar 

22. Kumar, P., Zhang, K.: Node Overlap Removal in Clustered Directed Acyclic Graphs. Journal of Visual Languages and Computing (JVLC). Article in press, doi:10.1016/j.jvlc.2009.04.007 (2009)

    Google Scholar 

23. Lai, W.: Layout Adjustment and Boundary Detection for a Diagram. In: Proceedings of Computer Graphics International (CGI ’01), pp. 351–354. IEEE Computer Society Washington, DC, USA (2001)

    Chapter  Google Scholar 

24. Lai, W., Eades, P.: Removing edge-node intersections in drawings of graphs. Information Processing Letters. 81, 105–110 (2002)

    Article MATH MathSciNet  Google Scholar 

25. Larson, R.C., Li, V.O.K.: Finding minimum rectilinear distance paths in the paths in the presence of barriers. Networks. 11, 285–304 (1981)

    Article MATH MathSciNet  Google Scholar 

26. Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks. 14, 393–410 (1984)

    Article MATH MathSciNet  Google Scholar 

27. Leiserson, C.E.: Fat-Trees: Universal Networks for Hardware-Efficient Supercomputing. IEEE Transactions on Computers. 34, 892–901 (1985)

    Google Scholar 

28. Leymann, F.: Web Services Flow Language (WSFL 1.0), IBM (2001)

    Google Scholar 

29. Li, W., Eades, P., Nikolov, N.: Using spring algorithms to remove node overlapping. In: Proceedings of the 2005 Asia-Pacific symposium on Information visualization (APVIS ’05), pp. 131–140. Australian Computer Society, Inc. Darlinghurst, Australia (2005)

    Google Scholar 

30. Lozano-Perez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Communications of ACM. 22, 22560–22570 (1979)

    Article  Google Scholar 

31. Marriott, K., Stuckey, P., Vam, T., He, W.: Removing Node Overlapping in Graph Layout Using Constrained Optimization. Constraints. 8, 143–171 (2003)

    Article MATH MathSciNet  Google Scholar 

32. Nascimento, H.A.D., Eades, P.: User Hints for map labeling. Journal of Visual Languages and Computing. 19, 39–74 (2008)

    Article  Google Scholar 

33. Papakostas, A., Tollis, I.G.: Interactive Orthogonal Graph Drawing. IEEE Transactions on Computers. 47, 1297–1309 (1998)

    Article MathSciNet  Google Scholar 

34. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal. 36, 1389–1401 (1957)

    Google Scholar 

35. Purchase, H.C., Cohen, R.F., James, M.: Validating Graph Drawing Aesthetics. In: Proceedings of the Symposium on Graph Drawing (GD ’95), pp. 435–446. Springer-Verlag, London, UK (1995)

    Google Scholar 

36. Quigley A., Eades, P.: Graph Drawing, Clustering, and Visual Abstraction. In: Proceedings of the 8th International Symposium on Graph Drawing (GD ’00), pp. 197–210. Springer-Verlag, Berlin, Heidelberg (2000)

    Google Scholar 

37. Taylor, M., Rodgers, P.: Applying Graphical Design Techniques to Graph Visualization. In: Proceedings of the Ninth International Conference on Information Visualization (IV ’05), pp. 651–656. IEEE Computer Society Washington, DC, USA (2005)

    Chapter  Google Scholar 

38. ConceptDraw,http://www.conceptdraw.com/en/products/cd5/main.php

39. Home of Graphdrawing,http://www.graphdrawing.org

40. Graphviz - Graph Visualization Software,http://www.graphviz.org

41. Microsoft Office Online – Visio,http://office.microsoft.com/en-us/visio/default.aspx

42. yWorks,http://www.yworks.com/products/yfiles/doc/developers-guide/index.html

Download references