Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Downey, Rodney"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Binary subtrees with few labeled paths
Rodney G. Downey
,
Noam Greenberg
,
Carl G. Jockusch
,
Kevin G. Milans
Combinatorica
31
(3), 2011, pp. 285-303
On problems without polynomial kernels
Hans L. Bodlaender
,
Rodney G. Downey
,
Michael R. Fellows
,
Danny Hermelin
Journal of Computer and System Sciences
75
(8), 2009, pp. 423-434
On problems without polynomial kernels
Hans L. Bodlaender
,
Rodney G. Downey
,
Michael R. Fellows
,
Danny Hermelin
Lecture Notes in Computer Science
5125
, 2008, pp. 563-574
Parameterized approximation of dominating set problems
Rodney G. Downey
,
Michael R. Fellows
,
Catherine McCartin
,
Frances Rosamond
Information Processing Letters
109
(1), 2008, pp. 68-70
Online promise problems with online width metrics
Rodney G. Downey
,
Catherine McCartin
Journal of Computer and System Sciences
73
(1), 2007, pp. 57-72
On Kurtz randomness
Rodney G. Downey
,
Evan J. Griffiths
,
Stephanie Reid
Theoretical Computer Science
321
(2-3), 2004, pp. 249-270
Presentations of computably enumberable reals
Rodney G. Downey
,
Geoffrey L. LaForte
Theoretical Computer Science
284
(2), 2002, pp. 539-555
On computing graph minor obstruction sets
Kevin Cattell
,
Michael J. Dinneen
,
Rodney G. Downey
,
Michael R. Fellows
,
Michael A. Langston
Theoretical Computer Science
233
(1-2), 2000, pp. 107-127
The complexity of irredundant sets parameterized by size
Rodney G. Downey
,
Michael R. Fellows
,
Venkatesh Raman
Discrete Applied Mathematics
100
(3), 2000, pp. 155-167
Parameterized circuit complexity and the
W
hierarchy
Rodney G. Downey
,
Michael R. Fellows
,
Kenneth W. Regan
Theoretical Computer Science
191
(1-2), 1998, pp. 97-115
Threshold dominating sets and an improved characterization of
W[2]
Rodney G. Downey
,
Michael R. Fellows
Theoretical Computer Science
209
(1-2), 1998, pp. 123-140
The parameterized complexity of sequence alignment and consensus
Hans L. Bodlaender
,
Rodney G. Downey
,
Michael R. Fellows
,
Harold T. Wareham
Theoretical Computer Science
147
(1-2), 1995, pp. 31-54
On the structure of parametrized problems in NP
Liming Cai
,
Jianer Chen
,
Rodney Downey
,
Michael Fellows
Information and Computation
123
(1), 1995, November, pp. 38-49
The parameterized complexity of sequence alignment and consensus
Hans Bodlaender
,
Rodney G. Downey
,
Michael R. Fellows
,
Harold T. Wareham
Lecture Notes in Computer Science
807
, 1994, pp. 15-30
On the structure of parameterized problems in
NP
Liming Cai
,
Jianer Chen
,
Rodney Downey
,
Michael Fellows
Lecture Notes in Computer Science
775
, 1994, pp. 509-520
Fixed-parameter intractability II (extended abstract)
Karl A. Abrahamson
,
Rodney G. Downey
,
Michael R. Fellows
Lecture Notes in Computer Science
665
, 1993, pp. 374-385
Fixed-parameter intractability
Rodney G. Downey
,
Michael R. Fellows
Proceedings of the 7th Annual Conference on Structure in Complexity Theory, CSCT'92 (Boston University, Boston, Massachusetts, June 22-25, 1992)
, 1992, pp. 36-49