The following pages link to (Q5501346):
Displaying 16 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Parameterized complexity of finding small degree-constrained subgraphs (Q414424) (← links)
- The degree-diameter problem for sparse graph classes (Q491538) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering (Q5885586) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)
