The following pages link to Drawing graphs in two layers (Q1331939):
Displaying 21 items.
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- On the planarization of wireless sensor networks (Q548669) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Comparing trees via crossing minimization (Q988574) (← links)
- Two-layer drawings of bipartite graphs (Q1689940) (← links)
- One-sided weak dominance drawing (Q1711831) (← links)
- A characterization of level planar graphs (Q1827672) (← links)
- New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018) (← links)
- Layered drawing of undirected graphs with generalized port constraints (Q2144464) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Noncrossing monochromatic subtrees and staircases in 0-1 matrices (Q2249949) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- Layered Drawing of Undirected Graphs with Generalized Port Constraints (Q5014119) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- Cubic Planar Graphs that cannot be Drawn on few Lines (Q5088962) (← links)
- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem (Q5096926) (← links)
- On the complexity of the maximum biplanar subgraph problem (Q5946290) (← links)
- Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)
