Peter Eades

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Crossing Minimization Problems of Drawing Bipartite Graphs in Two Clusters.

[BibT_eX]

[DOI]

Lanbo Zheng

Le Song

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

Using MoneyColor to Represent Financial Data.

[BibT_eX]

[DOI]

Xiaobin Shen

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

Using Spring Algorithms to Remove Node Overlapping.

[BibT_eX]

[DOI]

Wanchun Li

Nikola S. Nikolov

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

How People Read Graphs.

[BibT_eX]

[DOI]

Weidong Huang

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

Automatic Camera Path Generation for Graph Navigation in 3D.

[BibT_eX]

[DOI]

Adel Ahmed

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2005

A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization.

[BibT_eX]

[DOI]

Xiaodi Huang

Proceedings of the Computer Science 2005, 2005

2004

Drawing Graphs.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

Linkless symmetric drawings of series parallel digraphs.

[BibT_eX]

[DOI]

Jonathan Hillman

Comput. Geom., 2004

Using MoneyTree To Represent Financial Data.

[BibT_eX]

[DOI]

Xiaobin Shen

Proceedings of the 8th International Conference on Information Visualisation, 2004

A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

Towards area requirements for drawing hierarchically planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

An Edge-Splitting Algorithm in Planar Graphs.

[BibT_eX]

[DOI]

Hiroshi Nagamochi

J. Comb. Optim., 2003

On-Line Visualization and Navigation of the Global Web Structure.

[BibT_eX]

[DOI]

Int. J. Softw. Eng. Knowl. Eng., 2003

Skewness of Graphs with Small Cutsets.

[BibT_eX]

[DOI]

Graham Farr

Graphs Comb., 2003

Drawing Trees Symmetrically in Three Dimensions.

[BibT_eX]

[DOI]

Algorithmica, 2003

MoneyTree: Ambient Information Visualization Of Financial Data.

[BibT_eX]

[DOI]

Xiaobin Shen

Proceedings of the Visual Information Processing 2003, 2003

Symmetric Layout of Disconnected Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

HexGraph: Applying Graph Drawing Algorithms to the Game of Hex.

[BibT_eX]

[DOI]

Colin Murray

Carsten Friedrich

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Graph Drawing Contest Report.

[BibT_eX]

[DOI]

Franz-Josef Brandenburg

Ulrik Brandes

Joe Marks

Proceedings of the Graph Drawing, 11th International Symposium, 2003

User Hints for Map Labelling.

[BibT_eX]

[DOI]

Proceedings of the Computer Science 2003, 2003

2002

Foreword.

[BibT_eX]

[DOI]

Ding-Zhu Du

Theor. Comput. Sci., 2002

Graph Drawing in Motion.

[BibT_eX]

[DOI]

Carsten Friedrich

J. Graph Algorithms Appl., 2002

Removing edge-node intersections in drawings of graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Width-restricted layering of acyclic digraphs with consideration of dummy nodes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Symmetric drawings of triconnected planar graphs.

[BibT_eX]

[DOI]

Brendan D. McKay

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Visualising a Fund Manager Flow Graph with Columns and Worms.

[BibT_eX]

[DOI]

Tim Dwyer

Proceedings of the International Conference on Information Visualisation, 2002

A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing.

[BibT_eX]

Proceedings of the Soft Computing Systems - Design, Management and Applications, 2002

2001

User Hints for Directed Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Graphs in Software Visualization - Introduction.

[BibT_eX]

[DOI]

Petra Mutzel

Proceedings of the Software Visualization, 2001

2000

Spring algorithms and symmetry.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Navigating Clustered Graphs Using Force-Directed Methods.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2000

Three-dimensional orthogonal graph drawing algorithms.

[BibT_eX]

[DOI]

Antonios Symvonis

Discret. Appl. Math., 2000

Drawing series parallel digraphs symmetrically.

[BibT_eX]

[DOI]

Sang Ho Lee

Comput. Geom., 2000

A System for Graph Clustering Based on User Hints.

[BibT_eX]

[DOI]

Proceedings of the Visualisation 2000, 2000

Graph Library Design.

[BibT_eX]

[DOI]

François Bertault

Proceedings of the 20st International Conference of the Chilean Computer Science Society (SCCC 2000), 2000

An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

FADE: Graph Drawing, Clustering, and Visual Abstraction.

[BibT_eX]

[DOI]

Aaron J. Quigley

Proceedings of the Graph Drawing, 8th International Symposium, 2000

An Algorithm for Finding Three Dimensional Symmetry in Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

The Marey Graph Animation Tool Demo.

[BibT_eX]

[DOI]

Carsten Friedrich

Proceedings of the Graph Drawing, 8th International Symposium, 2000

Drawing Hypergraphs in the Subset Standard (Short Demo Paper).

[BibT_eX]

[DOI]

François Bertault

Proceedings of the Graph Drawing, 8th International Symposium, 2000

A Multi-agent Approach using A-Teams for Graph Drawing.

[BibT_eX]

Candido Ferreira Xavier de Mendonça Neto

Proceedings of the ISCA 9th International Conference on Intelligent Systems, 2000

1999

Drawing Clustered Graphs on an Orthogonal Grid.

[BibT_eX]

[DOI]

Hiroshi Nagamochi

J. Graph Algorithms Appl., 1999

Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

Graph Drawing: Algorithms for the Visualization of Graphs

[BibT_eX]

Prentice-Hall, ISBN: 0-13-301615-3, 1999

Graph Drawing Algorithms.

[BibT_eX]

[DOI]

Petra Mutzel

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm.

[BibT_eX]

[DOI]

Junhu Wang

J. Vis. Lang. Comput., 1998

WebOFDAV - Navigating and Visualizing the Web On-Line with Animated Context Swapping.

[BibT_eX]

[DOI]

Comput. Networks, 1998

Finding Planar Geometric Automorphisms in Planar Graphs.

[BibT_eX]

[DOI]

Sang Ho Lee

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs.

[BibT_eX]

[DOI]

Hiroshi Nagamochi

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

A Fully Animated Interactive System for Clustering and Navigating Huge Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

Routing Drawings in Diagram Displays.

[BibT_eX]

[DOI]

Proceedings of the Third Asian Pacific Computer and Human Interaction, 1998

1997

Three-Dimensional Graph Drawing.

[BibT_eX]

[DOI]

Algorithmica, 1997

Area Requirements for Drawing Hierarchically Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

Joe Marks

Stephen C. North

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Finding the Best Viewpoints for Three-Dimensional Graph Drawings.

[BibT_eX]

[DOI]

Michael E. Houle

Richard Webber

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Drawing Clustered Graphs on an Orthogonal Grid.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Online Animated Graph Drawing for Web Navigation.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

The Logic Engine and the Realization Problem for Nearest Neighbor Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs.

[BibT_eX]

Nord. J. Comput., 1996

The Techniques of Komolgorov and Bardzin for Three-Dimensional Orthogonal Graph Drawings.

[BibT_eX]

[DOI]

Charles Stirk

Inf. Process. Lett., 1996

An Algorithm for Drawing a Hierarchical Graph.

[BibT_eX]

[DOI]

Roberto Tamassia

Int. J. Comput. Geom. Appl., 1996

The Realization Problem for Euclidean Minimum Spanning Trees in NP-Hard.

[BibT_eX]

[DOI]

Algorithmica, 1996

Graph Drawing Methods.

[BibT_eX]

[DOI]

Proceedings of the Conceptual Structures: Knowledge Representation as Interlingua, 1996

Two Algorithms for Three Dimensional Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Antonios Symvonis

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Multilevel Visualization of Clustered Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995

Layout Adjustment and the Mental Map.

[BibT_eX]

[DOI]

J. Vis. Lang. Comput., 1995

Guest editors' foreword.

[BibT_eX]

[DOI]

Isabel F. Cruz

J. Vis. Lang. Comput., 1995

A heuristic for the feedback arc set problem.

[BibT_eX]

[DOI]

Australas. J Comb., 1995

Nearest Neighbour Graph Realizability is NP-hard.

[BibT_eX]

[DOI]

Proceedings of the LATIN '95: Theoretical Informatics, 1995

Graph-Drawing Contest Report.

[BibT_eX]

[DOI]

Joe Marks

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

Vertex Splitting and Tension-Free Layout

[BibT_eX]

[DOI]

Candido Ferreira Xavier de Mendonça Neto

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

Drawing Stressed Planar Graphs in Three Dimensions.

[BibT_eX]

[DOI]

Patrick Garvan

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

Planarity for Clustered Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

How to Draw a Planar Clustered Graph.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Drawing Graphs in Two Layers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Algorithms for Drawing Graphs: an Annotated Bibliography.

[BibT_eX]

[DOI]

Comput. Geom., 1994

Edge Crossings in Drawings of Bipartite Graphs.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Algorithmica, 1994

Integration of Declarative and Algorithmic Approaches for Layout Creation.

[BibT_eX]

[DOI]

Tao Lin

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Volume upper bounds for 3D graph drawing.

[BibT_eX]

[DOI]

Proceedings of the 1994 Conference of the Centre for Advanced Studies on Collaborative Research, October 31, 1994

1993

Algorithms for drawing trees (abstract).

[BibT_eX]

[DOI]

SIGACT News, 1993

The complexity of computing minimum separating polygons.

[BibT_eX]

[DOI]

David Rappaport

Pattern Recognit. Lett., 1993

A Fast and Effective Heuristic for the Feedback Arc Set Problem.

[BibT_eX]

[DOI]

W. F. Smyth

Inf. Process. Lett., 1993

Two Tree Drawing Conventions.

[BibT_eX]

[DOI]

Tao Lin

Int. J. Comput. Geom. Appl., 1993

Performance Guarantees for Motion Planning with Temporal Uncertainty.

[BibT_eX]

Nicholas C. Wormald

Aust. Comput. J., 1993

1992

Minimum Size h-v Drawings.

[BibT_eX]

Tao Lin

Proceedings of the Advanced Visual Interfaces - Proceedings of the International Workshop, 1992

1990

Fixed edge-length graph drawing is NP-hard.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Discret. Appl. Math., 1990

1989

How to draw a directed graph.

[BibT_eX]

[DOI]

Proceedings of the IEEE Workshop on Visual Languages, 1989

1984

Some Hamilton Paths and a Minimal Change Algorithm.

[BibT_eX]

[DOI]

Michael Hickey

Ronald C. Read

J. ACM, 1984

An Algorithm for Generating Subsets of Fixed Size With a Strong Minimal Change Property.

[BibT_eX]

[DOI]

Brendan D. McKay

Inf. Process. Lett., 1984

1983

A lower-bound for the number of productions required for a certain class of languages.

[BibT_eX]

[DOI]

Brian Alspach

Gordon Rose

Discret. Appl. Math., 1983

1981

On Optimal Trees.

[BibT_eX]

[DOI]