default search action
GD 1994: Princeton, New Jersey, USA
- Roberto Tamassia, Ioannis G. Tollis:
Graph Drawing, DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10-12, 1994, Proceedings. Lecture Notes in Computer Science 894, Springer 1995, ISBN 3-540-58950-3
Three-Dimensional Drawings
- Robert F. Cohen, Peter Eades, Tao Lin, Frank Ruskey
:
Three-Dimensional Graph Drawing. 1-11 - Steven P. Reiss:
3-D Visualization of Program Information. 12-24 - Thierry Jéron
3D Layout of Reachability Graphs of Communicating Processes. 25-32 - Bojan Mohar, Pierre Rosenstiehl:
A Flow Approach to Upward Drawings of Toroidal Maps. 33-39
Orthogonal Drawings
- Achilleas Papakostas, Ioannis G. Tollis:
Improved Algorithms and Bounds for Orthogonal Drawings. 40-51 - Ulrich Fößmeier, Michael Kaufmann:
On Bend-Minimum Orthogonal Upward Drawing of Directed Planar Graphs. 52-63 - Shimon Even, G. Granot:
Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection. 64-75
Planar Drawings
- Hristo N. Djidjev:
On Drawing a Graph Convexly in the Plane. 76-83 - Ashim Garg:
On Drawing Angle Graphs. 84-95 - Xin He, Ming-Yang Kao:
Regular Edge Labelings and Drawings of Planar Graphs. 96-103 - Marek Chrobak, Shin-Ichi Nakano:
Minimum-Width Grid Drawings of Plane Graphs. 104-110 - Hubert de Fraysseix, Patrice Ossona de Mendez
Regular Orientations, Arboricity, and Augmentation. 111-118
Crossings
- Michael Jünger, Petra Mutzel
The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems. 119-130 - Farhad Shahrokhi, László A. Székely, Imrich Vrto:
Crossing Numbers of Graphs, Lower Bound Techniques. 131-142
Graph Drawing Contest
- Peter Eades, Joe Marks:
Graph Drawing Contest Report. 143-146
Visibility Representations
- James Abello, Krishna Kumar:
Visibility Graphs and Oriented Matroids. 147-158 - Alice M. Dean, Joan P. Hutchinson:
Rectangle-Visibility Representations of Bipartite Graphs. 159-166 - Evangelos Kranakis
On the Number of Directions in Visibility Representations. 167-176 - Kathleen Romanik:
Directed VR-Representable Graphs have Unbounded Dimension. 177-181
Applications and Systems I
- Michael Himsolt:
GraphEd: a Graphical Platform for the Implementation of Graph Algorithms. 182-193 - Georg Sander:
Graph Layout through the VCG Tool. 194-205 - Ioannis G. Tollis, Chunliang Xia:
Drawing Telecommunication Networks. 206-217 - Doug Kimelman, Bruce Leban, Tova Roth, Dror Zernik:
Reduction of Visual Complexity in Dynamic Graphs. 218-225 - Frank Vogt, Rudolf Wille:
TOSCANA - a Graphical Tool for Analyzing and Exploring Data. 226-233
Geometry
- Paul J. Tanenbaum, Michael T. Goodrich, Edward R. Scheinerman:
Characterization and Recognition of Point-Halfspace and Related Orders. 234-245 - Manuel Abellanas, Ferran Hurtado, Pedro A. Ramos
Redrawing a Graph within a Geometric Tolerance. 246-253 - Michael Godau:
On the Difficulty of Embedding Planar Graphs with Inaccuracies. 254-261
System Demonstrations
- Joseph Manning, Mikhail J. Atallah, Kingsley Cudjoe, Joe Lozito, Ron Pacheco:
A System for Drawing Graphs with Geometric Symmetry. 262-265 - Michael Fröhlich, Mattias Werner:
Demonstration of the Interactive Graph-Visualization System da Vinci. 266-269 - Carolyn McCreary, Fwu-Shan Shieh, Helen Gill:
CG: a Graph Drawing System Using Graph-Grammar Parsing. 270-273 - Jeffrey D. McWhirter:
A Demonstration of Interactive Graph Based Visual Language. 274-277 - Karlis Kaugars, Juris Reinfelds, Alvis Brazma:
A Simple Algorithm for Drawing Large Graphs on Small Screens. 278-281 - Patrick W. Fowler, Tomaz Pisanski, John Shawe-Taylor
Molecular Graph Eigenvectors for Molecular Coordinates. 282-285
Upward Drawings
- Ashim Garg, Roberto Tamassia:
On the Compuational Complexity of Upward and Rectilinear Planarity Testing. 286-297 - Achilleas Papakostas:
Upward Planarity Testing of Outerplanar Dags. 298-306 - Pierluigi Crescenzi
Optimal-Area Upward Drawings of AVL Trees. 307-317 - Guy-Vincent Jourdan, Ivan Rival, Nejib Zaguia:
Upward Drawing on the Plane Grid Using Less Ink. 318-327
Proximity Drawings
- Giuseppe Di Battista, William J. Lenhart, Giuseppe Liotta:
Proximity Drawability: a Survey. 328-339 - Prosenjit Bose
Proximity Constraints and Representable Trees. 340-351 - Hossam A. ElGindy, Giuseppe Liotta, Anna Lubiw, Henk Meijer, Sue Whitesides:
Recognizing Rectangle of Influence Drawable Graphs. 352-363
Declarative and Other Applications
- Kozo Sugiyama, Kazuo Misue:
A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm. 364-375 - Tao Lin, Peter Eades:
Integration of Declarative and Algorithmic Approaches for Layout Creation. 376-387 - Arne Frick, Andreas Ludwig, Heiko Mehldau:
A Fast Adaptive Layout Algorithm for Undirected Graphs. 388-403 - Isabel F. Cruz, Ashim Garg:
Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs. 404-415 - Franz-Josef Brandenburg:
Designing Graph Drawings by Layout Graph Grammars. 416-427
Applications and Systems II
- Emanuel G. Noik:
Encoding Presentation Emphasis Algorithms for Graphs. 428-435 - Junhui Luo, Kanth Miriyala:
A Practical Approach to Static Node Positioning. 436-443 - Alan Saalfeld:
Map Generalization as a Graph Drawing Problem. 444-451 - Gerd Stumme
A Geometrical Heuristic for Drawing Concept Lattices. 452-460
Poster Gallery
- Sue Whitesides:
Poster Gallery Report. 461-469
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.
last updated on 2024-11-15 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: