Citation: Rg. Downey et Mr. Fellows, THRESHOLD DOMINATING SETS AND AN IMPROVED CHARACTERIZATION OF W[2], Theoretical computer science, 209(1-2), 1998, pp. 123-140
Citation: K. Cattell et al., A SIMPLE LINEAR-TIME ALGORITHM FOR FINDING PATH-DECOMPOSITIONS OF SMALL WIDTH, Information processing letters, 57(4), 1996, pp. 197-203
Citation: Hl. Bodlaender et al., THE PARAMETERIZED COMPLEXITY OF SEQUENCE ALIGNMENT AND CONSENSUS, Theoretical computer science, 147(1-2), 1995, pp. 31-54
Citation: Rg. Downey et Mr. Fellows, FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .2. ON COMPLETENESS FORW[1], Theoretical computer science, 141(1-2), 1995, pp. 109-131
Citation: Hl. Bodlaender et al., PARAMETERIZED COMPLEXITY ANALYSIS IN COMPUTATIONAL BIOLOGY, Computer applications in the biosciences, 11(1), 1995, pp. 49-57
Citation: Ka. Abrahamson et al., FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .4. ON COMPLETENESS FORW[P] AND PSPACE ANALOGS, Annals of pure and applied Logic, 73(3), 1995, pp. 235-276
Citation: Hl. Bodlaender et Mr. Fellows, W[2]-HARDNESS OF PRECEDENCE CONSTRAINED K-PROCESSOR SCHEDULING, Operations research letters, 18(2), 1995, pp. 93-97
Citation: Rg. Downey et Mr. Fellows, FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .1. BASIC RESULTS, SIAM journal on computing, 24(4), 1995, pp. 873-921
Citation: Mr. Fellows et Ma. Langston, ON SEARCH, DECISION, AND THE EFFICIENCY OF POLYNOMIAL-TIME ALGORITHMS, Journal of computer and system sciences, 49(3), 1994, pp. 769-779