Algorithmic patterns for orthogonal graph drawing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1547, Issue , 1999, Pages 138-152

  Gelfand, Natasha ^a   Tamassia, Roberto ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348124765     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_11     Document Type: Conference Paper

References (19)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows. Prentice Hall, 1993.
2. P. Bertolazzi, G. Di Battista, and G. Liotta. Parametric graph drawing. IEEE Trans. Softw. Eng., 21(8):662-673, 1995.
3. S. Bridgeman, A. Garg, and R. Tamassia. A graph drawing and translation service on the WWW. In S. C. North, editor, Graph Drawing (Proc. GD’96), Lecture Notes Comput. Sci. Springer-Verlag, 1997.
4. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing:. Prentice- Hall, 1998.
5. G. Di Battista, G. Liotta, and F. Vargiu. Diagram Server. J. Visual Lang. Comput., 6(3):275-298, 1995. (special issue on Graph Visualization, edited by I. F. Cruz and P. Eades).
6. ffgraph homepage. http://www.fmi.uni-passau.de/~friedric/ffgraph/main.shtml.
7. B. Flaming. Practical Algorithms in C++. Coriolis Group Book, 1995.
8. G. Gallo and M. G. Scutella. Towards a programming environment for combinatorial optimization: a case study oriented to max-flow computations. ORSA J. Computing, 5:120-133, 1994.
9. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns. Addison- Wesley, 1995.
10. N. Gelfand, M. T. Goodrich, and R. Tamassia. Teaching data structure design patterns. In Proc. 29th ACM SIGCSE Tech. Sympos., pages 331-335, 1998.
11. M. T. Goodrich and R. Tamassia. Data Structures and Algorithms in Java. John Wiley, New York, NY, 1998.
12. GDToolkit homepage. http://www.inf.uniroma3.it/people/gdb/wp12/GDT.html.
13. M. Himsolt. The Graphlet system. Lecture Notes in Computer Science, 1190, 1997.
14. H. Lauer, M. Ettrich, and K. Soukup. GraVis—system demonstration. Lecture Notes in Computer Science, 1353, 1997.
15. LEDA homepage. http://www.mpi-sb.mpg.de/LEDA/.
16. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-444, 1987.
17. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61-79, 1988.
18. R. Tamassia, L. Vismara, and J. E. Baker. A case study in algorithm engineering for geometric computing. In G. F. Italiano and S. Orlando, editors, Proc. Workshop on Algorithm Engineering, 1997. http://www.dsi.unive.it/~wae97/proceedings/.
19. K. Weihe. Reuse of algorithms: Still a challenge to object-oriented programming. In Proc. OOPSLA-97, pages 34-48. ACM Press, 1997.