Pages that link to "Item:Q1124349"
From MaRDI portal
The following pages link to Algorithms for plane representations of acyclic digraphs (Q1124349):
Displaying 50 items.
- Nearly optimal monotone drawing of trees (Q344763) (← links)
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- Monotone drawings of graphs with few directions (Q506161) (← links)
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- Straight-line rectangular drawings of clustered graphs (Q629827) (← links)
- Directed rectangle-visibility graphs have unbounded dimension (Q674919) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Good spanning trees in graph drawing (Q897943) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- Maximum upward planar subgraphs of embedded planar digraphs (Q945947) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Improving the running time of embedded upward planarity testing (Q991781) (← links)
- On the upward embedding on the torus (Q1010987) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Order, genus, and diagram invariance (Q1182056) (← links)
- Constrained visibility representations of graphs (Q1186563) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Some results on visibility graphs (Q1201816) (← links)
- A note on optimal area algorithms for upward drawings of binary trees (Q1208428) (← links)
- Advances in the theory and practice of graph drawing (Q1285778) (← links)
- Every triangle-free planar graph has a planar upward drawing (Q1311415) (← links)
- Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles (Q1725748) (← links)
- Bipolar orientations revisited (Q1842650) (← links)
- Towards area requirements for drawing hierarchically planar graphs (Q1870562) (← links)
- Upward planarity testing (Q1904391) (← links)
- Special graph representation and visualization of semantic networks (Q1930194) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- Upward planar drawings with three and more slopes (Q2151439) (← links)
- Upward point set embeddings of paths and trees (Q2232250) (← links)
- On the number of upward planar orientations of maximal planar graphs (Q2250457) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Combinatorial characterization of upward planarity (Q2316097) (← links)
- On 3D visibility representations of graphs with few crossings per edge (Q2317866) (← links)
- Baxter posets (Q2318781) (← links)
- A graphical calculus for semi-groupal categories (Q2423828) (← links)
- Upward planar graphs and their duals (Q2512656) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- Bitonic st-orderings for Upward Planar Graphs (Q2961518) (← links)
- Compact Monotone Drawing of Trees (Q3196406) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
- Monotone Drawings of 3-Connected Plane Graphs (Q3452836) (← links)
- ON MINIMUM AREA PLANAR UPWARD DRAWINGS OF DIRECTED TREES AND OTHER FAMILIES OF DIRECTED ACYCLIC GRAPHS (Q3520432) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- An Improved Upward Planarity Testing Algorithm and Related Applications (Q3605509) (← links)
- Embeddability Problems for Upward Planar Digraphs (Q3611856) (← links)
- Planar L-Drawings of Directed Graphs (Q4625136) (← links)
- (Q4789076) (← links)
