Pages that link to "Item:Q1085169"
From MaRDI portal
The following pages link to Finding small simple cycle separators for 2-connected planar graphs (Q1085169):
Displaying 50 items.
- Approximation algorithms for cutting a convex polyhedron out of a sphere (Q388101) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
- \(N\)-separators in planar graphs (Q661948) (← links)
- Covering nearly surface-embedded graphs with a fixed number of balls (Q741614) (← links)
- Better distance labeling for unweighted planar graphs (Q832885) (← links)
- A note on maximum independent set and related problems on box graphs (Q835020) (← links)
- Planar separators and parallel polygon triangulation. (Q960516) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- An external-memory depth-first search algorithm for general grid graphs (Q1022598) (← links)
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs (Q1109576) (← links)
- A linear-processor algorithm for depth-first search in planar graphs (Q1110342) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Not all planar digraphs have small cycle separators (Q1201868) (← links)
- Parallel search algorithms for graphs and trees (Q1204800) (← links)
- Edge separators for graphs of bounded genus with applications (Q1210307) (← links)
- Flow in planar graphs with vertex capacities (Q1317474) (← links)
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Simple polytopes without small separators. II: Thurston's bound (Q1618117) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Reduced constants for simple cycle graph separation (Q1920221) (← links)
- Applications of the crossing number (Q1920423) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles (Q2017836) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators (Q2206836) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228) (← links)
- Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- Embedding Outerplanar Graphs in Small Books (Q3749074) (← links)
- Edge Separators of Planar and Outerplanar Graphs With Applications (Q4033768) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- Wiener Index and Remoteness in Triangulations and Quadrangulations (Q4987269) (← links)
- (Q5002738) (← links)
- NC Algorithms for Weighted Planar Perfect Matching and Related Problems (Q5002779) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- Surprising Applications of Treewidth Bounds for Planar Graphs (Q5042457) (← links)
- Proximity in triangulations and quadrangulations (Q5054040) (← links)
- Improved parallel depth-first search in undirected planar graphs (Q5060132) (← links)
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs (Q5060135) (← links)
- Metric Embedding via Shortest Path Decompositions (Q5071090) (← links)
