The following pages link to Michael R. Fellows (Q175527):
Displayed 50 items.
- Constraint satisfaction problems: convexity makes AllDifferent constraints tractable (Q1939255) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718) (← links)
- Clustering with partial information (Q2268879) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- The parameterized complexity of stabbing rectangles (Q2428672) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- On complexity of lobbying in multiple referenda (Q2463791) (← links)
- Crown structures for vertex cover kernelization (Q2464323) (← links)
- An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (Q2464330) (← links)
- The complexity of polynomial-time approximation (Q2464331) (← links)
- A fixed-parameter approach to 2-layer planarization (Q2498928) (← links)
- On the structure of parameterized problems in NP (Q2508336) (← links)
- Sparse parameterized problems (Q2564046) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
- (Q2776269) (← links)
- Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) (Q2817636) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- Parameterized Complexity (Q2841253) (← links)
- Parameterized Approximation via Fidelity Preserving Transformations (Q2843261) (← links)
- (Q2843923) (← links)
- Tractable Parameterizations for the Minimum Linear Arrangement Problem (Q2849336) (← links)
- FPT Is Characterized by Useful Obstruction Sets (Q2864307) (← links)
- Myhill-Nerode Methods for Hypergraphs (Q2872101) (← links)
- Determining the winner of a Dodgson election is hard (Q2908877) (← links)
- Clique-width minimization is NP-hard (Q2931399) (← links)
- Distortion is Fixed Parameter Tractable (Q2947587) (← links)
- Surfing with Rod (Q2973715) (← links)
- Recent Developments in the Theory of Pre-processing (Q3004648) (← links)
- (Q3032280) (← links)
- (Q3034816) (← links)
- (Q3043700) (← links)
- (Q3046487) (← links)
- Milling a Graph with Turn Costs: A Parameterized Complexity Perspective (Q3057619) (← links)
- Parameterized Complexity of the Firefighter Problem (Q3104666) (← links)
- Parameterized Approximation Problems (Q3499730) (← links)
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel (Q3499737) (← links)
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization (Q3499745) (← links)
- A Purely Democratic Characterization of W[1] (Q3503582) (← links)
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940) (← links)
- Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
- Facility Location Problems: A Parameterized View (Q3511428) (← links)
- On Problems without Polynomial Kernels (Extended Abstract) (Q3521947) (← links)
- Clique-Width is NP-Complete (Q3563951) (← links)
- A Linear Kernel for Co-Path/Cycle Packing (Q3578360) (← links)