Pages that link to "Item:Q1337400"
From MaRDI portal
The following pages link to Algorithms for drawing graphs: An annotated bibliography (Q1337400):
Displaying 50 items.
- Area requirement of visibility representations of trees (Q287042) (← links)
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- Self-organizing maps for drawing large graphs (Q293353) (← links)
- Triangulations without minimum-weight drawing (Q294766) (← links)
- On the approximability of two tree drawing conventions (Q294876) (← links)
- The topological drawing of a graph: construction methods (Q386927) (← links)
- Directed rectangle-visibility graphs have unbounded dimension (Q674919) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- A note on minimum-area upward drawing of complete and Fibonacci trees (Q970209) (← links)
- Simple and efficient floor-planning (Q1007584) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- Lower bounds for planar orthogonal drawings of graphs (Q1182115) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- A note on optimal area algorithms for upward drawings of binary trees (Q1208428) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546) (← links)
- Strictly-upward drawings of ordered search trees (Q1274319) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Edge crossings in drawings of bipartite graphs (Q1322570) (← links)
- Drawing graphs in two layers (Q1331939) (← links)
- At most single-bend embeddings of cubic graphs (Q1335404) (← links)
- The logic engine and the realization problem for nearest neighbor graphs (Q1349880) (← links)
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings (Q1350939) (← links)
- Drawing outerplanar minimum weight triangulations (Q1351606) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- The decision support system GMCR in environmental conflict management (Q1363795) (← links)
- ARC crossing minimization in hierarchical digraphs with tabu search (Q1373159) (← links)
- Linear area upward drawings of AVL trees (Q1384187) (← links)
- New results on drawing angle graphs (Q1384188) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- Universal 3-dimensional visibility representations for graphs (Q1384193) (← links)
- A note on parallel algorithms for optimal h-v drawings of binary trees (Q1384199) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- Constraints in graph drawing algorithms (Q1387632) (← links)
- The rectangle of influence drawability problem (Q1388129) (← links)
- Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems (Q1392021) (← links)
- Rectangular grid drawings of plane graphs (Q1392851) (← links)
- The Gifi system of descriptive multivariate analysis. (Q1431150) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Spring algorithms and symmetry (Q1575440) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- Removing edge-node intersections in drawings of graphs (Q1603534) (← links)
- An optimal layout of multigrid networks (Q1607012) (← links)
- A tabu search algorithm for the bipartite drawing problem (Q1609918) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- Higher order Delaunay triangulations (Q1614071) (← links)
