The following pages link to (Q3154375):
Displaying 50 items.
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← 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)
- Boundary labeling with octilinear leaders (Q970611) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Matched drawability of graph pairs and of graph triples (Q982951) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- Improving the running time of embedded upward planarity testing (Q991781) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- On embedding a cycle in a plane graph (Q1011765) (← links)
- A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps (Q1015012) (← links)
- Open rectangle-of-influence drawings of inner triangulated plane graphs (Q1016532) (← links)
- Small area drawings of outerplanar graphs (Q1024211) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- How to draw a clustered tree (Q1044037) (← 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)
- 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)
