Pages that link to "Item:Q1934314"
From MaRDI portal
The following pages link to Improved bounds on the planar branchwidth with respect to the largest grid minor size (Q1934314):
Displayed 21 items.
- Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
- Grid minors in damaged grids (Q405308) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Fast minor testing in planar graphs (Q1759679) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- 1-perfectly orientable \(K_4\)-minor-free and outerplanar graphs (Q2413965) (← links)
- Planar Digraphs (Q3120437) (← links)
- Bivariate Complexity Analysis of Almost Forest Deletion (Q3196379) (← links)
- (Q4972036) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Decomposition of Map Graphs with Applications. (Q5091217) (← links)
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable (Q6075759) (← links)