The following pages link to (Q4850549):
Displaying 49 items.
- On the ordered list subgraph embedding problems (Q270006) (← links)
- An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
- Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- A general method to speed up fixed-parameter-tractable algorithms (Q1607033) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← 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)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Possible winner problems on partial tournaments: a parameterized study (Q2359793) (← links)
- A fixed-parameter tractable algorithm for matrix domination (Q2390264) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Sparse parameterized problems (Q2564046) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- (Q5009489) (← links)
- (Q5028434) (← links)
- Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis (Q5094064) (← links)
- On Directed Covering and Domination Problems (Q5136265) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
- Improved FPT Algorithms for Deletion to Forest-Like Structures (Q6492092) (← links)
