The following pages link to Michael R. Fellows (Q175527):
Displaying 39 items.
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- Nonconstructive advances in polynomial-time complexity (Q1098635) (← links)
- Constructive complexity (Q1182305) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- Large planar graphs with given diameter and maximum degree (Q1897359) (← links)
- Constraint satisfaction problems: convexity makes AllDifferent constraints tractable (Q1939255) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- Facility location problems: a parameterized view (Q2275913) (← 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)
- Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) (Q2817636) (← links)
- Parameterized Approximation via Fidelity Preserving Transformations (Q2843261) (← links)
- Clique-width minimization is NP-hard (Q2931399) (← links)
- Recent Developments in the Theory of Pre-processing (Q3004648) (← links)
- A Purely Democratic Characterization of W[1] (Q3503582) (← links)
- Clique-Width is NP-Complete (Q3563951) (← links)
- Polynomial-time data reduction for dominating set (Q3583575) (← links)
- Leaf Powers and Their Properties: Using the Trees (Q3596736) (← links)
- Parameterized Complexity of Stabbing Rectangles and Squares in the Plane (Q3605506) (← links)
- Haplotype Inference Constrained by Plausible Haplotype Data (Q3637124) (← links)
- Distortion Is Fixed Parameter Tractable (Q3638056) (← links)
- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology (Q3651529) (← links)
- Transversals of Vertex Partitions in Graphs (Q4712708) (← links)
- The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number (Q5425328) (← links)
- Forbidden minors to graphs with small feedback sets (Q5931421) (← links)
- Algorithms for learning and teaching sets of vertices in graphs (Q6503566) (← links)
