michael-r-fellows documents

Fast search algorithms for layout permutation problems
Documents Fast search algorithms for layout permutation problems
Graph-based data clustering with overlaps
Documents Graph-based data clustering with overlaps
The parameterized complexity of some minimum label problems
Documents The parameterized complexity of some minimum label problems
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Documents Upper and lower bounds for finding connected motifs in vertex-colored graphs
On finding short resolution refutations and small unsatisfiable subsets
Documents On finding short resolution refutations and small unsatisfiable subsets
On the parameterized complexity of multiple-interval graph problems
Documents On the parameterized complexity of multiple-interval graph problems
On search, decision, and the efficiency of polynomial-time algorithms
Documents On search, decision, and the efficiency of polynomial-time algorithms
On the parametric complexity of schedules to minimize tardy tasks
Documents On the parametric complexity of schedules to minimize tardy tasks
Self-witnessing polynomial-time complexity and prime factorization
Documents Self-witnessing polynomial-time complexity and prime factorization
Parameterizing by the Number of Numbers
Documents Parameterizing by the Number of Numbers
On The Parameterized Intractability Of Motif Search Problems*
Documents On The Parameterized Intractability Of Motif Search Problems*
Nonconstructive advances in polynomial-time complexity
Documents Nonconstructive advances in polynomial-time complexity
On the complexity of some colorful problems parameterized by treewidth
Documents On the complexity of some colorful problems parameterized by treewidth
A generalization of Nemhauser and Trotterʼs local optimization theorem
Documents A generalization of Nemhauser and Trotterʼs local optimization theorem
Local search: Is brute-force avoidable?
Documents Local search: Is brute-force avoidable?
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity
Documents Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity