The following pages link to Upward planarity testing (Q1904391):
Displaying 23 items.
- The partial visibility representation extension problem (Q724235) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- The complexity of upward drawings on spheres (Q1272953) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Quasi-upward planarity (Q1348947) (← links)
- A characterization of horoidal digraphs (Q1698749) (← links)
- Combinatorial characterization of upward planarity (Q2316097) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- A graphical calculus for semi-groupal categories (Q2423828) (← links)
- Upward planar graphs and their duals (Q2512656) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Drawing directed acyclic graphs: an experimental study (Q2708043) (← links)
- Upward planarity testing in practice: SAT formulations and comparative study (Q2828203) (← links)
- Switch-regular upward planarity testing of directed trees (Q2865045) (← links)
- Upward Planarity Testing: A Computational Study (Q2867639) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Upward Planarity Testing of Embedded Mixed Graphs (Q3223974) (← links)
- Experimental studies on graph drawing algorithms (Q4789076) (← links)
- Building Blocks of Upward Planar Digraphs (Q5301403) (← links)
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY (Q5493896) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711534) (← links)
- Upward planar morphs (Q5918180) (← links)
