The following pages link to (Q3154375):
Displaying 50 items.
- Outer 1-planar graphs (Q289919) (← links)
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- Ranking chain sum orders (Q290525) (← links)
- Triangulations without minimum-weight drawing (Q294766) (← links)
- On the approximability of two tree drawing conventions (Q294876) (← links)
- On multi-objective optimization aided drawing of special graphs (Q299425) (← links)
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes (Q306259) (← links)
- Witness Gabriel graphs (Q359756) (← links)
- Topological morphing of planar graphs (Q386891) (← links)
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- 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)
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area (Q452455) (← links)
- Vertex angle and crossing angle resolution of leveled tree drawings (Q456065) (← links)
- A regularized graph layout framework for dynamic network visualization (Q468664) (← links)
- Topological additive numbering of directed acyclic graphs (Q477623) (← 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 bus graphs (Q724233) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← links)
- Witness rectangle graphs (Q742595) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- Planar straight-line point-set embedding of trees with partial embeddings (Q763547) (← links)
- Drawing graphs by eigenvectors: theory and practice (Q814052) (← links)
- Complex systems: features, similarity and connectivity (Q823211) (← 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)
- Good spanning trees in graph drawing (Q897943) (← links)
- L-visibility drawings of IC-planar graphs (Q903189) (← links)
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis (Q903597) (← links)
