The following pages link to (Q4273870):
Displaying 36 items.
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- On well quasiordering of finite languages (Q1356526) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Reducing CMSO model checking to highly connected graphs (Q5002822) (← links)
- (Q5028434) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- (Q5089207) (← links)
- (Q5091010) (← links)
- Recognizable sets of graphs of bounded tree-width (Q5096279) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Dynamic algorithms for graphs with treewidth 2 (Q6143969) (← links)
