The following pages link to (Q3154375):
Displaying 50 items.
- 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)
- Algorithms for visualizing phylogenetic networks (Q2192379) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
- On the edge-length ratio of planar graphs (Q2206847) (← links)
- On arrangements of orthogonal circles (Q2206852) (← links)
- Sketched representations and orthogonal planarity of bounded treewidth graphs (Q2206871) (← links)
- On the area requirements of planar straight-line orthogonal drawings of ternary trees (Q2220843) (← links)
- Drawing a rooted tree as a rooted \(y\)-monotone minimum spanning tree (Q2224848) (← links)
- Discrete trace theorems and energy minimizing spring embeddings of planar graphs (Q2226448) (← links)
- Grid drawings of graphs with constant edge-vertex resolution (Q2230412) (← links)
- Upward point set embeddings of paths and trees (Q2232250) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- On the number of upward planar orientations of maximal planar graphs (Q2250457) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- NP-completeness of st-orientations for plane graphs (Q2268858) (← links)
- On embedding a graph in the grid with the maximum number of bends and other bad features (Q2272195) (← links)
- On 3D visibility representations of graphs with few crossings per edge (Q2317866) (← links)
- NodeTrix planarity testing with small clusters (Q2319629) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
- Planarity of streamed graphs (Q2333805) (← links)
- Tabu search for min-max edge crossing in graphs (Q2337395) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- A new algorithm for removing node overlapping in graph visualization (Q2372206) (← links)
- Computing maximum upward planar subgraphs of single-source embedded digraphs (Q2377381) (← links)
