The following pages link to (Q3154375):
Displayed 50 items.
- Expansion of layouts of complete binary trees into grids (Q1414240) (← links)
- The symmetry number problem for trees (Q1603439) (← links)
- A force-directed algorithm that preserves edge-crossing properties (Q1607039) (← links)
- Dimension reduction in principal component analysis for trees (Q1623457) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- Tabu search for the dynamic bipartite drawing problem (Q1652530) (← links)
- 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
- Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
- Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph (Q1696548) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- On triangle cover contact graphs (Q1702259) (← links)
- Realizability of graphs as triangle cover contact graphs (Q1704579) (← links)
- Image-based graph visualization: advances and challenges (Q1725727) (← links)
- A heuristic approach towards drawings of graphs with high crossing resolution (Q1725757) (← links)
- Bend-minimum orthogonal drawings in quadratic time (Q1725783) (← links)
- Algorithms and bounds for drawing directed graphs (Q1725793) (← links)
- Modifying orthogonal drawings for label placement (Q1736777) (← links)
- Track layouts, layered path decompositions, and leveled planarity (Q1739109) (← links)
- On the edge-length ratio of outerplanar graphs (Q1740698) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- On the one-sided crossing minimization in a bipartite graph with large degrees (Q1770400) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Schematization of networks (Q1776896) (← links)
- New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018) (← links)
- Embedding problems for paths with direction constrained edges. (Q1853570) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Sum of edge lengths of a multigraph drawn on a convex polygon (Q1869739) (← links)
- Voronoi drawings of trees (Q1869748) (← links)
- Optimal three-dimensional orthogonal graph drawing in the general position model. (Q1874390) (← links)
- Approximation algorithms for aligning points (Q1879366) (← links)
- Proximity drawings in polynomial area and volume (Q1882852) (← links)
- A multi-dimensional approach to force-directed layouts of large graphs (Q1883577) (← links)
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization (Q1955543) (← links)
- Data-driven graph drawing techniques with applications for conveyor systems (Q1980856) (← links)
- Embedding-preserving rectangle visibility representations of nonplanar graphs (Q1991089) (← links)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs (Q2009630) (← links)
- Simultaneous FPQ-ordering and hybrid planarity testing (Q2034412) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- Force-directed layout of order diagrams using dimensional reduction (Q2117137) (← links)
- An extension of the Lindström-Gessel-Viennot theorem (Q2144326) (← links)
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs (Q2151435) (← links)
- Upward planar drawings with three and more slopes (Q2151439) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Quasi-upward planar drawings with minimum curve complexity (Q2151443) (← links)
- Optimal-area visibility representations of outer-1-plane graphs (Q2151451) (← links)
- Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem (Q2172416) (← links)
- Tree drawings revisited (Q2189731) (← links)