scientific article; zbMATH DE number 1858605
From MaRDI portal
Publication:4789076
DOI10.1002/1097-024X(200009)30:11%3C1235::AID-SPE339%3E3.0.CO;2-BzbMATH Open1147.68785WikidataQ62042630 ScholiaQ62042630MaRDI QIDQ4789076FDOQ4789076
Authors: Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Francesco Vargiu, Luca Vismara 
Publication date: 23 January 2003
Title of this publication is not available (Why is that?)
Recommendations
Cites Work
- Crossing Number is NP-Complete
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Area requirement and symmetry display of planar upward drawings
- Algorithms for drawing graphs: An annotated bibliography
- A better heuristic for orthogonal graph drawings
- An algorithm for drawing general undirected graphs
- An experimental comparison of four graph drawing algorithms.
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Algorithms for plane representations of acyclic digraphs
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- Edge crossings in drawings of bipartite graphs
- HOW TO DRAW A SERIES-PARALLEL DIGRAPH
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs
- Upward planarity testing
- Algorithms for area-efficient orthogonal drawing
- Title not available (Why is that?)
- Constrained visibility representations of graphs
- DAG—a program that draws directed graphs
- Experiments on drawing 2-level hierarchical graphs
Cited In (13)
- An Experimental Study on Distance-Based Graph Drawing
- Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
- Title not available (Why is that?)
- Experimental analysis of the accessibility of drawings with few segments
- Overloaded orthogonal drawings
- A healthy critical attitude: revisiting the results of a graph drawing study
- Topology-driven force-directed algorithms
- Title not available (Why is that?)
- Drawing directed acyclic graphs: an experimental study
- Graph drawing through the lens of a framework for analyzing visualization methods (invited talk, extended abstract)
- Sketched graph drawing: a lesson in empirical studies
- An experimental comparison of four graph drawing algorithms.
- SOFSEM 2005: Theory and Practice of Computer Science
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 Q4789076)
