scientific article; zbMATH DE number 1693471
From MaRDI portal
Publication:2764040
zbMATH Open0981.68630MaRDI QIDQ2764040FDOQ2764040
Authors: Markus Eiglsperger, Sándor P. Fekete, Gunnar W. Klaus 
Publication date: 22 January 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2025/20250121
Title of this publication is not available (Why is that?)
Recommendations
Computing methodologies and applications (68U99) Graph theory (including graph drawing) in computer science (68R10)
Cited In (24)
- Efficient orthogonal drawings of high degree graphs
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Slanted orthogonal drawings: model, algorithms and evaluations
- Graph compact orthogonal layout algorithm
- A simple graphical method for orthogonal rotation of axes
- Interactive orthogonal graph drawing
- Convexity-increasing morphs of planar graphs
- Slanted orthogonal drawings
- Orthogonal connector routing
- Relating bends and size in orthogonal graph drawings
- Title not available (Why is that?)
- Orthogonal graph drawing with inflexible edges
- Overloaded orthogonal drawings
- Orthogonal drawings of graphs with vertex and edge labels
- The Turing Test for Graph Drawing Algorithms
- On vertex- and empty-ply proximity drawings
- Orthogonal Drawings of Plane Graphs Without Bends
- Title not available (Why is that?)
- Techniques for the Refinement of Orthogonal Graph Drawings
- Distinguishing orthogonality graphs
- Title not available (Why is that?)
- Orthogonal Hypergraph Drawing for Improved Visibility
- The distance orientation problem
- Topology Preserving Constrained Graph Layout
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2764040)
