Interactive orthogonal graph drawing: Algorithms and bounds

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

Volumn 1353, Issue , 1997, Pages 111-123

  Fößmeier, Ulrich ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

GRAPH DRAWING; LOWER BOUNDS; ORTHOGONAL GRAPHS; QUALITY MEASURES;

DRAWING (GRAPHICS);

EID: 84890124744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_55     Document Type: Conference Paper

References (15)

1. Biedl, T.C., New Lower Bounds for Orthogonal Graph Drawings, Proceedings on GD’95, Passau, 28-39, 1995.
2. Biedl, T.C., Orthogonal Graph Drawing, Algorithms and Lower Bounds, Diploma Thesis TU Berlin, 1995.
3. Batini, C., E. Nardelli and R. Tamassia, A Layout Algorithm for Data-Flow Diagrams, IEEE Trans. on Software Engineering, Vol. SE-12 (4), 538-546, 1986.
4. Batini, C., M. Talamo and R. Tamassia, Computer Aided Layout of Entity- Relationship Diagrams, The Journal of Systems and Software, Vol. 4, 163-173, 1984.
5. CPLEX optimization, Inc. Using the CPLEX Base System. CPLEX Optimization, Inc., 1995.
6. DiBattista G., P. Eades, R. Tamassia and I.G. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory and Applications, vol. 4, no 5, 235-282, 1994.
7. Fößmeier U., Interactive Orthogonal Graph Drawing: Algorithms and Bounds, Technical Report WSI-97-12, University of Tübingen.
8. Garg, A., R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Proceedings of GD’94, Princeton, 286-297, 1994.
9. Jahrmarkt, F., Knickminimierende Verfahren für interaktives orthogonales Graphenzeichnen, Diplomarbeit Universität Tübingen, 1997 (in German language).
10. Kramer M.R., J. van Leeuwen, The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits, Advances in Computer Research, Vol. 2: VLSI Theory, Jai Press, Reading, MA, 129-146, 1992.
11. Misue, K., P. Eades, W. Lai and K. Sugiyama, Layout Adjustment and the Mental Map, Journal of Visual Languages and Computing, vol. 6, 183-210, 1995.
12. Papakostas, A., J. M. Six, I. G. Tollis, Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing, Proceedings on GD’96, Berkeley, 371-386, 1996.
13. Papakostas, A. and I.G. Tollis, Issues in Interactive Orthogonal Graph Drawing, Proceedings on GD’95, Passau, 419-430, 1995.
14. Papakostas, A. and I.G. Tollis, Improved Algorithms and Bounds for Orthogonal Drawings, Proceedings on GD’94, Princeton, 40-51, 1994.
15. Valiant, L. G., Universality considerations in VLSI circuits, IEEE Trans. Comput., C-30, 135-140, 1981.