The following pages link to (Q3154375):
Displayed 50 items.
- Improved floor-planning of graphs via adjacency-preserving transformations (Q411253) (← links)
- The shape of orthogonal cycles in three dimensions (Q411405) (← links)
- Drawing a tree as a minimum spanning tree approximation (Q414909) (← links)
- Orthogonal drawings and crossing numbers of the Kronecker product of two cycles (Q433407) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Complexity dichotomy on partial grid recognition (Q533881) (← links)
- A celtic framework for knots and links (Q542383) (← links)
- Algorithms for multi-level graph planarity testing and layout (Q596102) (← links)
- Drawing polytopal graphs with {\texttt{polymake}} (Q600948) (← links)
- Complexity analysis of balloon drawing for rooted trees (Q620957) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Grid drawings of \(k\)-colourable graphs (Q706720) (← links)
- Drawing graphs with right angle crossings (Q719252) (← links)
- Planar straight-line point-set embedding of trees with partial embeddings (Q763547) (← links)
- Drawing graphs by eigenvectors: theory and practice (Q814052) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- Improved algorithm for the symmetry number problem on trees (Q844174) (← links)
- The approximability of three-dimensional assignment problems with bottleneck objective (Q845547) (← 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)
- 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)