Area-Efficient Static and Incremental Graph Drawings (1997)

Cached

Download Links

by Therese C. Biedl , Michael Kaufmann
Citations:26 - 6 self

Documents Related by Co-Citation

10958 D.S.: Computers and Intractibility: A Guide to the Theory of NP-Completeness – M R Garey, Johnson - 1979
418 Combinatorial Algorithms for Integrated Circuit Layout – T Lengauer - 1990
8543 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest - 1990
63 A Better Heuristic for Orthogonal Graph Drawings – Therese Biedl, Goos Kant - 1998
1433 Reducibility among combinatorial problems – R Karp - 1972
532 Network Flows – R K Ahuja, T Magnanti, J Orlin - 1993
515 A Framework for Dynamic Graph Drawing – Robert F. Cohen, G. Di Battista, R. Tamassia, Ioannis G. Tollis - 1992
1693 The Probabilistic Method – Noga Alon, Joel Spencer - 1992
2010 I.: The Unified Modeling Language User Guide – G Booch, J Rumbaugh, Jaconbson - 1999