![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Graph Algorithms and Applications, Volume 4
Volume 4, Number 1, 2000
- Magnús M. Halldórsson
:
Approximations of Weighted Independent Set and Hereditary Subset Problems. 1-16
Volume 4, Number 2, 2000
- George He, Jiping Liu, Cheng Zhao:
Approximation Algorithms for Some Graph Partitioning Problems. 1-11
Volume 4, Number 3, 2000
- Giuseppe Liotta, Sue Whitesides:
Guest Editors' Foreword. 1-3 - Michael B. Dillencourt, David Eppstein, Daniel S. Hirschberg:
Geometric Thickness of Complete Graphs. 5-17 - Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs. 19-46 - Stina S. Bridgeman, Roberto Tamassia:
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms. 47-74 - Janet M. Six, Konstantinos G. Kakoulis, Ioannis G. Tollis:
Techniques for the Refinement of Orthogonal Graph Drawings. 75-103 - Giuseppe Di Battista, Maurizio Patrignani, Francesco Vargiu:
A Split & Push Approach to 3D Orthogonal Drawing. 105-133 - Ulrik Brandes, Dorothea Wagner:
Using Graph Layout to Visualize Train Interconnection Data. 135-155 - Peter Eades, Mao Lin Huang
:
Navigating Clustered Graphs Using Force-Directed Methods. 157-181 - Ulrik Brandes, Vanessa Kääb, Andres Löh
, Dorothea Wagner, Thomas Willhalm:
Dynamic WWW Structures in 3D. 183-191
Volume 4, Number 4, 2000
- Susanne E. Hambrusch, Chuan-Ming Liu, Hyeong-Seok Lim:
Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees. 1-26
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.