AAAAAA

   
Results: 1-15 |
Results: 15
THRESHOLD DOMINATING SETS AND AN IMPROVED CHARACTERIZATION OF W[2]
Authors: DOWNEY RG FELLOWS MR
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
PARAMETERIZED CIRCUIT COMPLEXITY AND THE W-HIERARCHY
Authors: DOWNEY RG FELLOWS MR REGAN KW
Citation: Rg. Downey et al., PARAMETERIZED CIRCUIT COMPLEXITY AND THE W-HIERARCHY, Theoretical computer science, 191(1-2), 1998, pp. 97-115
AN IMPROVED FIXED-PARAMETER ALGORITHM FOR VERTEX COVER
Authors: BALASUBRAMANIAN R FELLOWS MR RAMAN V
Citation: R. Balasubramanian et al., AN IMPROVED FIXED-PARAMETER ALGORITHM FOR VERTEX COVER, Information processing letters, 65(3), 1998, pp. 163-168
ADVICE CLASSES OF PARAMETERIZED TRACTABILITY
Authors: CAI LM CHEN JN DOWNEY RG FELLOWS MR
Citation: Lm. Cai et al., ADVICE CLASSES OF PARAMETERIZED TRACTABILITY, Annals of pure and applied Logic, 84(1), 1997, pp. 119-138
VERTEX TRANSVERSALS THAT DOMINATE
Authors: ALON N FELLOWS MR HARE DR
Citation: N. Alon et al., VERTEX TRANSVERSALS THAT DOMINATE, Journal of graph theory, 21(1), 1996, pp. 21-31
SPARSE PARAMETERIZED PROBLEMS
Authors: CESATI M FELLOWS MR
Citation: M. Cesati et Mr. Fellows, SPARSE PARAMETERIZED PROBLEMS, Annals of pure and applied Logic, 82(1), 1996, pp. 1-15
A SIMPLE LINEAR-TIME ALGORITHM FOR FINDING PATH-DECOMPOSITIONS OF SMALL WIDTH
Authors: CATTELL K DINNEEN MJ FELLOWS MR
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
THE PARAMETERIZED COMPLEXITY OF SEQUENCE ALIGNMENT AND CONSENSUS
Authors: BODLAENDER HL DOWNEY RG FELLOWS MR WAREHAM HT
Citation: Hl. Bodlaender et al., THE PARAMETERIZED COMPLEXITY OF SEQUENCE ALIGNMENT AND CONSENSUS, Theoretical computer science, 147(1-2), 1995, pp. 31-54
FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .2. ON COMPLETENESS FORW[1]
Authors: DOWNEY RG FELLOWS MR
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
PARAMETERIZED COMPLEXITY ANALYSIS IN COMPUTATIONAL BIOLOGY
Authors: BODLAENDER HL DOWNEY RG FELLOWS MR HALLETT MT WAREHAM HT
Citation: Hl. Bodlaender et al., PARAMETERIZED COMPLEXITY ANALYSIS IN COMPUTATIONAL BIOLOGY, Computer applications in the biosciences, 11(1), 1995, pp. 49-57
THE COMPLEXITY OF INDUCED MINORS AND RELATED PROBLEMS
Authors: FELLOWS MR KRATOCHVIL J MIDDENDORF M PFEIFFER F
Citation: Mr. Fellows et al., THE COMPLEXITY OF INDUCED MINORS AND RELATED PROBLEMS, Algorithmica, 13(3), 1995, pp. 266-282
FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .4. ON COMPLETENESS FORW[P] AND PSPACE ANALOGS
Authors: ABRAHAMSON KA DOWNEY RG FELLOWS MR
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
W[2]-HARDNESS OF PRECEDENCE CONSTRAINED K-PROCESSOR SCHEDULING
Authors: BODLAENDER HL FELLOWS MR
Citation: Hl. Bodlaender et Mr. Fellows, W[2]-HARDNESS OF PRECEDENCE CONSTRAINED K-PROCESSOR SCHEDULING, Operations research letters, 18(2), 1995, pp. 93-97
FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .1. BASIC RESULTS
Authors: DOWNEY RG FELLOWS MR
Citation: Rg. Downey et Mr. Fellows, FIXED-PARAMETER TRACTABILITY AND COMPLETENESS .1. BASIC RESULTS, SIAM journal on computing, 24(4), 1995, pp. 873-921
ON SEARCH, DECISION, AND THE EFFICIENCY OF POLYNOMIAL-TIME ALGORITHMS
Authors: FELLOWS MR LANGSTON MA
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
Risultati: 1-15 |