The following pages link to (Q3154375):
Displayed 50 items.
- Algorithms for multi-level graph planarity testing and layout (Q596102) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Grid drawings of \(k\)-colourable graphs (Q706720) (← links)
- Drawing graphs by eigenvectors: theory and practice (Q814052) (← links)
- The strength of weak proximity (Q849629) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
- Drawing \(c\)-planar biconnected clustered graphs (Q885287) (← links)
- Fixed parameter algorithms for one-sided crossing minimization revisited (Q935846) (← links)
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
- Complexity results for three-dimensional orthogonal graph drawing (Q954967) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← links)
- Pushing blocks is hard. (Q1395573) (← links)
- Tutte's barycenter method applied to isotopies (Q1395577) (← links)
- Crossing-number critical graphs have bounded path-width (Q1400969) (← links)
- 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)
- 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)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- A new algorithm for removing node overlapping in graph visualization (Q2372206) (← links)
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
- Algorithms for the multiple label placement problem (Q2432730) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- A framework and algorithms for circular drawings of graphs (Q2465996) (← links)
- Drawing cubic graphs with at most five slopes (Q2483558) (← links)
- A better heuristic for area-compaction of orthogonal representations (Q2489402) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- One-dimensional layout optimization, with applications to graph drawing by axis separation (Q2573337) (← links)