The following pages link to (Q5596083):
Displaying 50 items.
- An improved algorithm for the red-blue hitting set problem with the consecutive ones property (Q407573) (← links)
- Compact visibility representation of 4-connected plane graphs (Q443715) (← links)
- Certifying algorithms (Q465678) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- Dynamic reachability in planar digraphs with one source and one sink (Q688163) (← links)
- Improved visibility representation of plane graphs (Q706721) (← links)
- Closed rectangle-of-influence drawings for irreducible triangulations (Q709065) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- Bijective counting of plane bipolar orientations and Schnyder woods (Q1039437) (← links)
- Visibility representation of plane graphs via canonical ordering tree (Q1044700) (← links)
- A linear algorithm for embedding planar graphs using PQ-trees (Q1083864) (← links)
- A unified approach to visibility representations of planar graphs (Q1085167) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- Finding small simple cycle separators for 2-connected planar graphs (Q1085169) (← links)
- A very personal reminiscence on the problem of computational complexity (Q1091818) (← links)
- Parallel ear decomposition search (EDS) and st-numbering in graphs (Q1095666) (← links)
- Graph graphics: Theory and practice (Q1103411) (← links)
- The multi-tree approach to reliability in distributed networks (Q1109560) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- st-ordering the vertices of biconnected graphs (Q1167194) (← links)
- On the thickness of graphs of given degree (Q1174334) (← links)
- Area requirement and symmetry display of planar upward drawings (Q1189288) (← links)
- Constructing compact rectilinear planar layouts using canonical representation of planar graphs (Q1193898) (← links)
- Computing an st-numbering (Q1231771) (← links)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms (Q1242450) (← links)
- Finding the closed partition of a planar graph (Q1322561) (← links)
- At most single-bend embeddings of cubic graphs (Q1335404) (← links)
- Planarity testing in parallel (Q1342859) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← links)
- Reconstruction graphs and testing their properties in a relational spatial database (Q1609074) (← links)
- The minimum size of graphs satisfying cut conditions (Q1701098) (← links)
- Every plane graph is facially-non-repetitively \(C\)-choosable (Q1753049) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- The topology of the coloring complex (Q1781822) (← links)
- Exploring the tiers of rooted phylogenetic network space using tail moves (Q1786929) (← links)
- Bipolar orientations revisited (Q1842650) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- Drawing graphs on rectangular grids (Q1902892) (← links)
- Gap strings and spanning forests for bridge graphs of biconnected graphs (Q1923606) (← links)
- Enumerating the edge-colourings and total colourings of a regular graph (Q1956248) (← links)
- A new planarity test (Q1960413) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- A diameter-revealing proof of the Bondy-Lovász lemma (Q2059880) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
