Advances in the theory and practice of graph drawing (Q1285778): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: HOW TO DRAW A SERIES-PARALLEL DIGRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better heuristic for orthogonal graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Area-Time Complexity of Binary Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigidity and energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on optimal area algorithms for upward drawings of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for drawing graphs: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental comparison of four graph drawing algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guest Editors' Introduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for plane representations of acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: graph drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Area requirement and symmetry display of planar upward drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained visibility representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LINEAR-TIME ALGORITHM FOR TESTING THE INSCRIBABILITY OF TRIVALENT POLYHEDRA / rank
 
Normal rank
Property / cites work
 
Property / cites work: The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing Graphs in the Plane with High Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG—a program that draws directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upward planarity testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A paradigm for robust geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum planar subgraphs and nice embeddings: Practical layout tools / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar graphs using the canonical ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of planar ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing proximity drawings of trees in the 3-dimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical results on at most 1-bend embeddability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: General theoretical results on rectilinear embeddability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Angular Resolution of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph drawing. Symposium, GD '96, Berkeley, CA, USA, September 18--20, 1996. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantitative Steinitz' theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for area-efficient orthogonal drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4918384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4089424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph drawing. DIMACS international workshop, GD '94, Princeton, NJ, USA, October 10-12, 1994. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for planar orthogonal drawings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Representations of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:46, 28 May 2024

scientific article
Language Label Description Also known as
English
Advances in the theory and practice of graph drawing
scientific article

    Statements

    Advances in the theory and practice of graph drawing (English)
    0 references
    0 references
    28 April 1999
    0 references
    graph drawing
    0 references
    3D drawings
    0 references
    constraints
    0 references
    experiments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers