The following pages link to (Q4038721):
Displaying 25 items.
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing (Q471143) (← links)
- Dynamic algorithms for shortest paths in planar graphs (Q685367) (← links)
- Dynamic reachability in planar digraphs with one source and one sink (Q688163) (← links)
- Connectivity of workflow nets: The foundations of stepwise verification (Q766173) (← links)
- Maintaining bridge-connected and biconnected components on-line (Q1186782) (← links)
- On counting planar embeddings (Q1313885) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- Upward planarity testing (Q1904391) (← links)
- Decremental 2- and 3-connectivity on planar graphs (Q1924402) (← links)
- An SPQR-tree-like embedding representation for upward planarity (Q2206883) (← links)
- Jordan-like characterization of automorphism groups of planar graphs (Q2674344) (← links)
- Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)
- Average case analysis of fully dynamic reachability for directed graphs (Q3124401) (← links)
- Planar L-Drawings of Directed Graphs (Q4625136) (← links)
- Dynamic 2- and 3-connectivity on planar graphs (Q5056143) (← links)
- A linear algorithm for the maximal planar subgraph problem (Q5057449) (← links)
- Computing k-modal embeddings of planar digraphs (Q5075755) (← links)
- Approximation Algorithms for Facial Cycles in Planar Embeddings (Q5091033) (← links)
- Fast incremental planarity testing (Q5204329) (← links)
- Maintenance of triconnected components of graphs (Q5204330) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- (Q6065397) (← links)
- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract) (Q6487973) (← links)
- Enumerating combinatorial resultant trees (Q6579118) (← links)
- Extending partial representations of circle graphs in near-linear time (Q6582371) (← links)
