Sciweavers

GD
1998
Springer
13 years 9 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
GD
1998
Springer
13 years 9 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
GD
1998
Springer
13 years 9 months ago
Graph Multidrawing: Finding Nice Drawings Without Defining Nice
This report proposes a
Therese C. Biedl, Joe Marks, Kathy Ryall, Sue Whit...
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
13 years 9 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann
GD
2001
Springer
13 years 9 months ago
A Short Note on the History of Graph Drawing
The origins of chart graphics (e.g., bar charts and line charts) are well known, with the seminal event being the publication of William Playfair´s (1759-1823) ¨The Commercial a...
Eriola Kruja, Joe Marks, Ann Blair, Richard C. Wat...
GD
2001
Springer
13 years 9 months ago
GraphML Progress Report
Following a workshop on graph data formats held with the 8th Symposium on Graph Drawing (GD 2000), a task group was formed to propose a format for graphs and graph drawings that me...
Ulrik Brandes, Markus Eiglsperger, Ivan Herman, Mi...
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
13 years 9 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
INFOVIS
2002
IEEE
13 years 9 months ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Yehuda Koren, Liran Carmel, David Harel
GD
2003
Springer
13 years 10 months ago
Visualizing Related Metabolic Pathways in Two and a Half Dimensions
We propose a method for visualizing a set of related metabolic pathways using 21 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of eac...
Ulrik Brandes, Tim Dwyer, Falk Schreiber
GD
2003
Springer
13 years 10 months ago
Selected Open Problems in Graph Drawing
Abstract. In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research i...
Franz-Josef Brandenburg, David Eppstein, Michael T...