Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
50
views
0
references
Top references
cited by
95
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,494
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Invitation to Fixed-Parameter Algorithms
monograph
Author(s):
Rolf Niedermeier
Publication date:
February 02 2006
Publisher:
Oxford University Press
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:
9780198566076
Publication date:
February 02 2006
DOI:
10.1093/acprof:oso/9780198566076.001.0001
SO-VID:
43b14e40-e2b1-4661-9b77-e918ae33ff2b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
INTRODUCTION TO FIXED-PARAMETER ALGORITHMS
pp. 17
PRELIMINARIES AND AGREEMENTS
pp. 22
PARAMETERIZED COMPLEXITY THEORY—A PRIMER
pp. 31
VERTEX COVER—AN ILLUSTRATIVE EXAMPLE
pp. 41
THE ART OF PROBLEM PARAMETERIZATION
pp. 49
SUMMARY AND CONCLUDING REMARKS
pp. 53
DATA REDUCTION AND PROBLEM KERNELS
pp. 88
DEPTH-BOUNDED SEARCH TREES
pp. 124
DYNAMIC PROGRAMMING
pp. 150
TREE DECOMPOSITIONS OF GRAPHS
pp. 177
FURTHER ADVANCED TECHNIQUES
pp. 201
SUMMARY AND CONCLUDING REMARKS
pp. 205
PARAMETERIZED COMPLEXITY THEORY
pp. 237
CONNECTIONS TO APPROXIMATION ALGORITHMS
pp. 243
SELECTED CASE STUDIES
pp. 277
ZUKUNFTSMUSIK
Similar content
4,494
Invited Commentary: Toward Better Bias Analysis
Authors:
Paul Gustafson
Invited Paper-Synchrocyclotron Conversion
Authors:
K MacKenzie
Invited review: Probiotic yogurt quality criteria, regulatory framework, clinical evidence, and analytical aspects
Authors:
Richard Nyanzi
,
Piet Jooste
,
Elna Buys
See all similar
Cited by
95
A Multi-Facet Survey on Memetic Computation
Authors:
Yew-Soon Ong
,
Meng-Hiot Lim
,
Kay Tan
…
Kernelization Lower Bounds Through Colors and IDs
Authors:
Saket Saurabh
,
Michael Dom
,
Daniel Lokshtanov
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
Authors:
Jian Song
,
Daniël Paulusma
,
Matthew A. Johnson
…
See all cited by