Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
94
views
0
references
Top references
cited by
256
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,648
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Parameterized Complexity
other
Author(s):
R. G. Downey
,
M. R. Fellows
Publication date
(Print):
1999
Publisher:
Springer New York
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Author and book information
Book
ISBN (Print):
978-1-4612-6798-0
ISBN (Electronic):
978-1-4612-0515-9
Publication date (Print):
1999
DOI:
10.1007/978-1-4612-0515-9
SO-VID:
0efff8db-8811-4211-99f5-e008747d54f5
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Computers, Complexity, and Intractability from the Parametric Point of View
pp. 23
The Basic Definitions
pp. 29
Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernel
pp. 49
Optimization Problems, Approximation Schemes, and Their Relation with FPT
pp. 61
The Advice View Revisited and LOGSPACE
pp. 67
Methods via Automata and Bounded Treewidth
pp. 143
Well-Quasi-Orderings and the Robertson-Seymour Theorems
pp. 211
Miscellaneous Techniques
pp. 227
Reductions
pp. 235
The Basic Class W[1] and an Analog of Cook’s Theorem
pp. 255
Some Other W[1]-Hardness Results
pp. 283
The W -Hierarchy
pp. 315
Beyond W[t]-Hardness
pp. 331
Fixed Parameter Analogs of PSPACE and k-Move Games
pp. 341
Provable Intractability: The Class X P
pp. 353
Another Basis for the W -Hierarchy, the Tradeoff-Theorem, and Randomized Reductions
pp. 363
Relationships with Classical Complexity and Limited Nondeterminism
pp. 377
The Monotone and Antimonotone Collapse Theorems: MONOTONEW[2t + 1] = W[2t] and ANTIMONOTONE W[2t + 2] = W[2t + 1]
pp. 389
The Structure of Languages Under Parameterized Reducibilities
Similar content
2,648
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Authors:
J. FLUM
,
M. Grohe
Parameterized Concurrent Multi-Party Session Types
Authors:
Minas Charalambides
,
Gul Agha
,
Peter Dinges
Parameterization of Quasigeostrophic Eddies in Primitive Equation Ocean Models
Authors:
A. M. Treguier
,
I. M. HELD
,
V. S. Larichev
See all similar
Cited by
253
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
Authors:
Noga Alon
,
Shai Gutner
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Authors:
David Eppstein
,
Maarten Löffler
,
Darren Strash
The Discrete Basis Problem
Authors:
P. Miettinen
,
T. Mielikainen
,
A. Gionis
…
See all cited by