Pages that link to "Item:Q2494422"

The following pages link to Local tree-width, excluded minors, and approximation algorithms (Q2494422):

Displaying 39 items.

• Minors and dimension (Q345115) (← links)
• Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
• Local search: is brute-force avoidable? (Q439931) (← links)
• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
• The degree-diameter problem for sparse graph classes (Q491538) (← links)
• Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
• Contracting planar graphs to contractions of triangulations (Q635743) (← links)
• Guard games on graphs: keep the intruder out! (Q650877) (← links)
• Implicit branching and parameterized partial cover problems (Q657922) (← links)
• Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
• Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
• On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
• Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
• Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
• Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
• Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
• Approximation algorithms via contraction decomposition (Q1945289) (← links)
• Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
• 1-planarity testing and embedding: an experimental study (Q2088879) (← links)
• A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
• Simple PTAS's for families of graphs excluding a minor (Q2352263) (← links)
• Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
• Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
• Local 2-separators (Q2673481) (← links)
• Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q3452835) (← links)
• Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor (Q3656866) (← links)
• Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
• Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
• Distributed Dominating Set Approximations beyond Planar Graphs (Q4972685) (← links)
• (Q5090497) (← links)
• Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
• Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
• Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
• Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
• (Q5743379) (← links)
• Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
• Target set selection with maximum activation time (Q6110610) (← links)
• Approximating sparse quadratic programs (Q6180751) (← links)