The following pages link to (Q4501141):
Displayed 21 items.
- On the parameterised complexity of string morphism problems (Q315525) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
- Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Perfect Code is \(W[1]\)-complete (Q1603518) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
- An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities (Q2408208) (← links)
- Parameterized Complexity of Discrete Morse Theory (Q2828168) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- A Purely Democratic Characterization of W[1] (Q3503582) (← links)
- On the difficulty of designing good classifiers (Q6184672) (← links)