The following pages link to (Q3138887):
Displaying 50 items.
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- Visibility representation of plane graphs via canonical ordering tree (Q1044700) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Drawing the planar dual (Q1198002) (← links)
- A note on optimal area algorithms for upward drawings of binary trees (Q1208428) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- Classes and recognition of curve contact graphs (Q1272471) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Arboricity and bipartite subgraph listing algorithms (Q1334644) (← links)
- Grid embedding of 4-connected plane graphs (Q1355197) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- New results on drawing angle graphs (Q1384188) (← 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)
- Orthogonal drawings based on the stratification of planar graphs (Q1422412) (← links)
- Drawing plane triangulations with few segments (Q1622344) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods (Q1686255) (← links)
- New results on edge partitions of 1-plane graphs (Q1694686) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- Morphing Schnyder drawings of planar triangulations (Q1739203) (← links)
- On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings (Q1741861) (← links)
- Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
- Planar minimally rigid graphs and pseudo-triangulations (Q1775778) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Planarity-preserving clustering and embedding for large planar graphs (Q1869744) (← links)
- Decidability of string graphs (Q1887714) (← links)
- Drawing planar graphs using the canonical ordering (Q1920418) (← links)
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm (Q1920431) (← links)
- Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
- Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- On the area requirements of planar greedy drawings of triconnected planar graphs (Q2019489) (← links)
- Navigating planar topologies in near-optimal space and time (Q2096370) (← links)
- Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography (Q2136288) (← links)
- The space complexity of sum labelling (Q2140502) (← links)
- From Tutte to Floater and Gotsman: on the resolution of planar straight-line drawings and morphs (Q2151435) (← links)
- One-bend drawings of outerplanar graphs inside simple polygons (Q2151442) (← links)
- Limitations on realistic hyperbolic graph drawing (Q2151459) (← links)
- On chordal and perfect plane near-triangulations (Q2161233) (← links)
- On graphs whose eternal vertex cover number and vertex cover number coincide (Q2161248) (← links)
- Convex grid drawings of planar graphs with constant edge-vertex resolution (Q2169950) (← links)
- The geometry and combinatorics of discrete line segment hypergraphs (Q2174575) (← links)
- Tree drawings revisited (Q2189731) (← links)
- A local characterization for perfect plane near-triangulations (Q2201998) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators (Q2206836) (← links)
