The following pages link to Michael R. Fellows (Q175527):
Displaying 50 items.
- An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
- The Flood-It game parameterized by the vertex cover number (Q324714) (← links)
- Fundamentals of parameterized complexity (Q383833) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- A generalization of Nemhauser and Trotter's local optimization theorem (Q657921) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Counting trees in directed regular multigraphs (Q757413) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- On the parameterized intractability of motif search problems (Q858110) (← links)
- (Q958204) (redirect page) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- W-hierarchies defined by symmetric gates (Q970108) (← links)
- Parameterized approximation of dominating set problems (Q975529) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Nonconstructive advances in polynomial-time complexity (Q1098635) (← links)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← links)
- Radius and diameter in Manhattan lattices (Q1121887) (← links)
- Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
- Constructive complexity (Q1182305) (← links)
- Self-witnessing polynomial-time complexity and prime factorization (Q1200292) (← links)
- Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- On the parameterized complexity of short computation and factorization (Q1387097) (← 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)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Corrigendum to: ``Advice classes of parameterized tractability'' (Q1706270) (← links)
- (Q1745714) (redirect page) (← links)
- A brief history of Edward K. Blum and the Journal of Computer and System Sciences (Q1745715) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← 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)
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity (Q1933639) (← links)
