Cited in
(91)- Drawing slicing graphs with face areas
- On the complexity of crossings in permutations
- An algorithm for constructing star-shaped drawings of plane graphs
- Orthogonal layout with optimal face complexity
- HV-planarity: algorithms and complexity
- Heuristics for the constrained incremental graph drawing problem
- Variable neighborhood scatter search for the incremental graph drawing problem
- A heuristic approach towards drawings of graphs with high crossing resolution
- Algorithms and bounds for drawing directed graphs
- A multi-dimensional approach to force-directed layouts of large graphs
- Right angle crossing graphs and 1-planarity
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
- Tabu search tutorial. A graph drawing application
- Rejoinder on: ``Tabu search tutorial. A graph drawing application
- Data-driven graph drawing techniques with applications for conveyor systems
- ChordLink: a new hybrid visualization model
- Grid drawings of graphs with constant edge-vertex resolution
- Computing upward topological book embeddings of upward planar digraphs
- Computing straight-line 3D grid drawings of graphs in linear volume
- An annotated bibliography on 1-planarity
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- Approximating the fixed linear crossing number
- Upward three-dimensional grid drawings of graphs
- Orthogonal drawings of graphs with vertex and edge labels
- One-dimensional layout optimization, with applications to graph drawing by axis separation
- How traders influence their neighbours: modelling social evolutionary processes and peer effects in agricultural trade networks
- On the density of non-simple 3-planar graphs
- On multi-objective optimization aided drawing of special graphs
- The straight-line RAC drawing problem is NP-hard
- Drawing Graphs with Right Angle Crossings
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Matched Drawability of Graph Pairs and of Graph Triples
- The Binary Stress Model for Graph Drawing
- Embeddability Problems for Upward Planar Digraphs
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
- Cyclic Leveling of Directed Graphs
- The topological drawing of a graph: construction methods
- Drawing a tree as a minimum spanning tree approximation
- 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
- Recognizing IC-planar and NIC-planar graphs
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- PATHWIDTH AND LAYERED DRAWINGS OF TREES
- Large angle crossing drawings of planar graphs in subquadratic area
- Review of statistical network analysis: models, algorithms, and software
- HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs
- On Turn-Regular Orthogonal Representations
- On turn-regular orthogonal representations
- A new framework for hierarchical drawings
- Coordinate Assignment for Cyclic Level Graphs
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- Cyclic Level Planarity Testing and Embedding
- Line Crossing Minimization on Metro Maps
- Constrained Simultaneous and Near-Simultaneous Embeddings
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- CONVEX DRAWINGS OF PLANE GRAPHS OF MINIMUM OUTER APICES
- AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING
- Queue layouts of planar 3-trees
- Approximation algorithms for minimizing edge crossings in radial drawings
- Discussion to: ``Bayesian graphical models for modern biological applications by Y. Ni, V. Baladandayuthapani, M. Vannucci and F. C. Stingo
- k-Planar Placement and Packing of Δ-Regular Caterpillars
- Rectilinear planarity of partial 2-trees
- $st$-Orientations with Few Transitive Edges
- Rectilinear Planarity of Partial 2-Trees
- Parameterized approaches to orthogonal compaction
- On the 2-layer window width minimization problem
- Complexity analysis of balloon drawing for rooted trees
- Straight-line rectangular drawings of clustered graphs
- Mutual witness proximity drawings of isomorphic trees
- yFiles -- from data to meaningful visualizations (software abstract)
- Visualization of bipartite graphs in limited window size
- Curve-constrained drawings of planar graphs
- Drawing graphs with right angle crossings
- On the parameterized complexity of computing st-orientations with few transitive edges
- An efficient hybridization of graph representation learning and metaheuristics for the constrained incremental graph drawing problem
- Planar bus graphs
- Upward and rectilinear planarity are W[1]-hard parameterized by treewidth
- Drawing graphs by eigenvectors: theory and practice
- On simultaneous planar graph embeddings
- Area-efficient planar straight-line drawings of outerplanar graphs
- Drawing \(c\)-planar biconnected clustered graphs
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis
- Point-set embeddings of trees with given partial drawings
- Maximum upward planar subgraphs of embedded planar digraphs
- Radial drawings of graphs: geometric constraints and trade-offs
- Drawing colored graphs on colored points
- Crossing minimization in extended level drawings of graphs
- Boundary labeling with octilinear leaders
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Matched drawability of graph pairs and of graph triples
- Convex drawings of hierarchical planar graphs and clustered planar graphs
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)
