A census of graph-drawing algorithms based on generalized transversal structures
From MaRDI portal
Cites work
- 4-labelings and grid embeddings of plane quadrangulations
- A better heuristic for orthogonal graph drawings
- A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs
- A unified approach to visibility representations of planar graphs
- Bend-optimal orthogonal drawings of triconnected plane graphs
- Bend-optimal orthogonal graph drawing in the general position model
- Binary labelings for plane quadrangulations and their relatives
- Bipolar orientations revisited
- Convex drawings of planar graphs and the order dimension of 3-polytopes
- Grand-Schnyder woods
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Minimum cost flows in graphs with unit capacities
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On Finding the Rectangular Duals of Planar Triangular Graphs
- On triangulating planar graphs under the four-connectivity constraint
- Optimal orthogonal drawings of triconnected plane graphs
- Planar graphs and poset dimension
- Rectangular grid drawings of plane graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Schnyder decompositions for regular plane graphs and application to drawing
- Straight-Line Drawing of Quadrangulations
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
This page was built for publication: A census of graph-drawing algorithms based on generalized transversal structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232116)
