Подписаться
Michael Fellows
Michael Fellows
Research Professor LAU Beirut and NYC; Emeritus Prof. Univ. Bergen; Adjunct Prof. WSU Australia
Подтвержден адрес электронной почты в домене lau.edu.lb - Главная страница
Название
Процитировано
Процитировано
Год
Parameterized complexity
RG Downey, MR Fellows
Springer Science & Business Media, 2012
46422012
Fundamentals of parameterized complexity
RG Downey, MR Fellows
springer, 2013
18232013
Fixed-parameter tractability and completeness I: Basic results
RG Downey, MR Fellows
SIAM Journal on computing 24 (4), 873-921, 1995
8221995
Fixed-parameter tractability and completeness II: On completeness for W [1]
RG Downey, MR Fellows
Theoretical Computer Science 141 (1-2), 109-131, 1995
7301995
On problems without polynomial kernels
HL Bodlaender, RG Downey, MR Fellows, D Hermelin
Journal of Computer and System Sciences 75 (8), 423-434, 2009
5652009
On the parameterized complexity of multiple-interval graph problems
MR Fellows, D Hermelin, F Rosamond, S Vialette
Theoretical computer science 410 (1), 53-61, 2009
3862009
Parameterized complexity: A framework for systematically confronting computational intractability
RG Downey, MR Fellows, U Stege
Contemporary Trends in Discrete Mathematics 49, 49-99, 1997
2861997
Nonconstructive tools for proving polynomial-time decidability
MR Fellows, MA Langston
Journal of the ACM (JACM) 35 (3), 727-739, 1988
2811988
Polynomial-time data reduction for dominating set
J Alber, MR Fellows, R Niedermeier
Journal of the ACM (JACM) 51 (3), 363-384, 2004
2732004
On search decision and the efficiency of polynomial-time algorithms
MR Fellows, MA Langston
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
2731989
Parameterized computational feasibility
RG Downey, MR Fellows
Feasible mathematics II, 219-244, 1995
2621995
Fixed-parameter tractability and completeness IV: On completeness for W [P] and PSPACE analogues
KA Abrahamson, RG Downey, MR Fellows
Annals of pure and applied logic 73 (3), 235-276, 1995
2221995
An improved fixed-parameter algorithm for vertex cover
R Balasubramanian, MR Fellows, V Raman
Information Processing Letters 65 (3), 163-168, 1998
2211998
Combinatorial cryptosystems galore!
M Fellows, N Koblitz
Contemporary Mathematics 168, 51-51, 1994
1771994
Graph layout problems parameterized by vertex cover
MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh
Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold …, 2008
1732008
Clique-width is NP-complete
MR Fellows, FA Rosamond, U Rotics, S Szeider
SIAM Journal on Discrete Mathematics 23 (2), 909-939, 2009
1652009
Fixed-parameter intractability
RG Downey, MR Fellows
1992 Seventh Annual Structure in Complexity Theory Conference, 36, 37, 38 …, 1992
1651992
Beyond NP-completeness for problems of bounded width (extended abstract) hardness for the W hierarchy
HL Bodlaender, MR Fellows, MT Hallett
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
1591994
Advice classes of parameterized tractability
L Cai, J Chen, RG Downey, MR Fellows
Annals of pure and applied logic 84 (1), 119-138, 1997
1541997
Cutting up is hard to do: The parameterised complexity of k-cut and related problems
RG Downey, V Estivill-Castro, M Fellows, E Prieto, FA Rosamund
Electronic Notes in Theoretical Computer Science 78, 209-222, 2003
1462003
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20