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
[1]
Hilfe
Suche: Author="Juedes, David"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of polynomial-time approximation
Liming Cai
,
Michael Fellows
,
David Juedes
,
Frances Rosamond
Theory of Computing Systems
41
(3), 2007, pp. 459-477
Tight lower bounds for certain parameterized
NP
-hard problems
Jianer Chen
,
Benny Chor
,
Mike Fellows
,
Xiuzhen Huang
,
David Juedes
,
Iyad A. Kanj
,
Ge Xia
Information and Computation
201
(2), 2005, pp. 216-231
Linear kernels in linear time, or how to save
k
colors in
O(n^2)
steps
Benny Chor
,
Mike Fellows
,
David Juedes
Lecture Notes in Computer Science
3353
, 2004, pp. 257-269
A geometric approach to parameterized algorithms for domination problems on planar graphs
Henning Fernau
,
David Juedes
Lecture Notes in Computer Science
3153
, 2004, pp. 488-499
On the existence of subexponential parameterized algorithms
Liming Cai
,
David Juedes
Journal of Computer and System Sciences
67
(4), 2003, pp. 789-807
The inapproximability of non-
NP
-hard optimization problems
Liming Cai
,
David Juedes
,
Iyad Kanj
Theoretical Computer Science
289
(1), 2002, pp. 553-571
Baire category and nowhere differentiability for feasible real function
Josef M. Breutzmann
,
David W. Juedes
,
Jack H. Lutz
Lecture Notes in Computer Science
2223
, 2001, pp. 219-230
Subexponential parameterized algorithms collapse the
W
-hierarchy
Liming Cai
,
David Juedes
Lecture Notes in Computer Science
2076
, 2001, pp. 273-284
The inapproximability on non
NP
-hard optimization problems
Liming Cai
,
David Juedes
,
Iyad Kanj
Lecture Notes in Computer Science
1533
, 1998, pp. 437-446
Completeness and weak completeness under polynomial-size circuits
David W. Juedes
,
Jack H. Lutz
Information and Computation
125
(1), 1996, pp. 13-31
The complexity and distribution of hard problems
David W. Juedes
,
Jack H. Lutz
SIAM Journal on Computing
24
(2), 1995, pp. 279-295
Completeness and weak completeness under polynomial-size circuits
David W. Juedes
,
Jack H. Lutz
Lecture Notes in Computer Science
900
, 1995, pp. 26-37
Weak completeness in
E
and
E_2
David W. Juedes
,
Jack H. Lutz
Theoretical Computer Science
143
(1), 1995, pp. 149-158
Computational depth and reducibility
David W. Juedes
,
James I. Lathrop
,
Jack H. Lutz
Theoretical Computer Science
132
(1-2), 1994, pp. 37-70
Computational depth and reducibility
David W. Juedes
,
James I. Lathrop
,
Jack H. Lutz
Lecture Notes in Computer Science
700
, 1993, pp. 277-288
The complexity and distribution of hard problems
David W. Juedes
,
Jack H. Lutz
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 177-185
Kolmogorov complexity, complexity cores, and the distribution of hardness
David W. Juedes
,
Jack H. Lutz
EATCS Monographs on Theoretical Computer Science
, 1992, pp. 43-65