Graph Drawing: Symposium on Graph Drawing, GD '95 Passau, Germany, September 20–22, 1995 Proceedings

Quasi-planar graphs have a linear number of edges....Pages 1-7
Universal 3-Dimensional visibility representations for graphs....Pages 8-19
KGB a customizable graph browser....Pages 20-23
Adocs: a drawing system for generic combinatorial structures....Pages 24-27
New lower bounds for orthogonal graph drawings....Pages 28-39
The effect of graph layout on inference from social network data....Pages 40-51
Drawing nice projections of objects in space....Pages 52-63
Optimal algorithms to embed trees in a point set....Pages 64-75
An experimental comparison of force-directed and randomized graph drawing algorithms....Pages 76-87
On the complexity of recognizing intersection and touching graphs of disks....Pages 88-98
Fast interactive 3-D graph visualization....Pages 99-110
GD-Workbench: A system for prototyping and testing graph drawing algorithms....Pages 111-122
CABRI-Graph: A tool for research and teaching in graph theory....Pages 123-126
Graph folding: Extending detail and context viewing into a tool for subgraph comparisons....Pages 127-139
Upward numbering testing for triconnected graphs....Pages 140-151
On a visibility representation of graphs....Pages 152-161
3D graph drawing with simulated annealing....Pages 162-165
The botanical beauty of random binary trees....Pages 166-177
The strength of weak proximity (extended abstract)....Pages 178-189
COMAIDE: Information visualization using cooperative 3D diagram layout....Pages 190-201
Vertex splitting and tension-free layout....Pages 202-211
Drawing stressed planar graphs in three dimensions....Pages 212-223
Graph-Drawing contest report....Pages 224-233
New results on a visibility representation of graphs in 3D....Pages 234-241
Generalized fisheye views of graphs....Pages 242-253
Drawing high degree graphs with low bend numbers....Pages 254-266
The drawing of configurations....Pages 267-276
Upward drawings on planes and spheres....Pages 277-286
Grid embedding of 4-connected plane graphs....Pages 287-299
Recognizing leveled-planar dags in linear time....Pages 300-311
Contact graphs of curves....Pages 312-323
On representations of some thickness-two graphs....Pages 324-332
Drawing force-directed graphs using Optigraph....Pages 333-336
Exact and heuristic algorithms for 2-layer straightline crossing minimization....Pages 337-348
Constraint-based spring-model algorithm for graph layout....Pages 349-360
Layout algorithms of graph-like diagrams for GRADE windows graphic editors....Pages 361-364
Grid intersection and box intersection graphs on surfaces....Pages 365-372
How to draw outerplanar minimum weight triangulations....Pages 373-384
Portable graph layout and editing....Pages 385-395
A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs....Pages 396-408
Incremental layout in DynaDAG....Pages 409-418
Issues in interactive orthogonal graph drawing (preliminary version)....Pages 419-430
Automatic drawing of compound digraphs for a real-time power system simulator....Pages 431-434
Validating graph drawing aesthetics....Pages 435-446
A fast heuristic for hierarchical Manhattan layout....Pages 447-458
CLaX — A visualized compiler....Pages 459-462
Crossing numbers of meshes....Pages 463-471
Directed graphs drawing by Clan-based decomposition....Pages 472-482
TOSCANA management system for conceptual data....Pages 483-486
Graph layout adjustment strategies....Pages 487-499
A generic compound graph visualizer/manipulator: D-ABDUCTOR....Pages 500-503
Generating customized layouts....Pages 504-515
GOVE Grammar-Oriented Visualisation Environment....Pages 516-519
Swan: A data structure visualization system....Pages 520-523