Drawing graphs. Methods and models
From MaRDI portal
Publication:5952489
DOI10.1007/3-540-44969-8zbMATH Open0977.68644OpenAlexW4253380179WikidataQ55966841 ScholiaQ55966841MaRDI QIDQ5952489FDOQ5952489
Authors:
Publication date: 14 January 2002
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44969-8
Computing methodologies and applications (68U99) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Cited In (86)
- Mutual witness proximity drawings of isomorphic trees
- Rectilinear Planarity of Partial 2-Trees
- On turn-regular orthogonal representations
- Discussion to: ``Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F. C. Stingo
- On the 2-layer window width minimization problem
- Approximation algorithms for minimizing edge crossings in radial drawings
- Computing upward topological book embeddings of upward planar digraphs
- Approximating the fixed linear crossing number
- HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs
- On Turn-Regular Orthogonal Representations
- How traders influence their neighbours: modelling social evolutionary processes and peer effects in agricultural trade networks
- k-Planar Placement and Packing of Δ-Regular Caterpillars
- Queue layouts of planar 3-trees
- Cyclic Leveling of Directed Graphs
- Rectilinear planarity of partial 2-trees
- Rejoinder on: ``Tabu search tutorial. A graph drawing application
- Tabu search tutorial. A graph drawing application
- Data-driven graph drawing techniques with applications for conveyor systems
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
- The Binary Stress Model for Graph Drawing
- Radial drawings of graphs: geometric constraints and trade-offs
- Cyclic Level Planarity Testing and Embedding
- Drawing Graphs with Right Angle Crossings
- Straight-line rectangular drawings of clustered graphs
- Algorithms and bounds for drawing directed graphs
- Large angle crossing drawings of planar graphs in subquadratic area
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- ChordLink: a new hybrid visualization model
- A new framework for hierarchical drawings
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Crossing minimization in extended level drawings of graphs
- Orthogonal layout with optimal face complexity
- Drawing a tree as a minimum spanning tree approximation
- Drawing graphs by eigenvectors: theory and practice
- Recognizing IC-planar and NIC-planar graphs
- $st$-Orientations with Few Transitive Edges
- HV-planarity: algorithms and complexity
- Matched drawability of graph pairs and of graph triples
- Convex drawings of hierarchical planar graphs and clustered planar graphs
- Line Crossing Minimization on Metro Maps
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- One-dimensional layout optimization, with applications to graph drawing by axis separation
- A heuristic approach towards drawings of graphs with high crossing resolution
- Planar bus graphs
- On multi-objective optimization aided drawing of special graphs
- Heuristics for the constrained incremental graph drawing problem
- Variable neighborhood scatter search for the incremental graph drawing problem
- Computing straight-line 3D grid drawings of graphs in linear volume
- A fast successive over-relaxation algorithm for force-directed network graph drawing
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
- Drawing graphs with right angle crossings
- Orthogonal drawings of graphs with vertex and edge labels
- On the complexity of crossings in permutations
- An algorithm for constructing star-shaped drawings of plane graphs
- On simultaneous planar graph embeddings
- Maximum upward planar subgraphs of embedded planar digraphs
- Area-efficient planar straight-line drawings of outerplanar graphs
- Grid drawings of graphs with constant edge-vertex resolution
- On the density of non-simple 3-planar graphs
- Complexity analysis of balloon drawing for rooted trees
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
- Drawing slicing graphs with face areas
- Upward three-dimensional grid drawings of graphs
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis
- A multi-dimensional approach to force-directed layouts of large graphs
- Right angle crossing graphs and 1-planarity
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- Drawing \(c\)-planar biconnected clustered graphs
- Embeddability Problems for Upward Planar Digraphs
- The straight-line RAC drawing problem is NP-hard
- An annotated bibliography on 1-planarity
- Boundary labeling with octilinear leaders
- Parameterized approaches to orthogonal compaction
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Review of statistical network analysis: models, algorithms, and software
- Curve-constrained drawings of planar graphs
- Point-set embeddings of trees with given partial drawings
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Matched Drawability of Graph Pairs and of Graph Triples
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- The topological drawing of a graph: construction methods
- Coordinate Assignment for Cyclic Level Graphs
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
This page was built for publication: Drawing graphs. Methods and models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952489)
