Parameterized complexity: Difference between revisions

Content deleted Content added
improved last edit. The bracket was indeed wrong, but the big-O can be hidden into f.
m References: improved references
Line 55:
 
*{{cite book
| last=Downey | first=Rod G. | authorlink=Rod Downey
| last2=Fellows | first2=Michael R. | authorlink2=Michael Fellows
| last=Downey
| title = Parameterized Complexity Theory
| coauthors=M. Fellows
| title=Parameterized complexity
| publisher=Springer
| year=1999
| url=http://www.springer.com/sgw/cda/frontpage/0,11855,5-0-22-1519914-0,00.html?referer=www.springer.de%2Fcgi-bin%2Fsearch_book.pl%3Fisbn%3D0-387-94883-X
| isbn = 0-387-94883-X |ref=harv
}}
 
* {{cite book
| last=Flum | first=Jörg | authorlink=Jörg Flum
| author = Flum, J.
| last2=Grohe | first2=Martin | authorlink2=Martin Grohe
| coauthors = Grohe, M.
| title = Parameterized Complexity Theory | year = 2006 | publisher = Springer
| year = 2006
| url = http://www.springer.com/east/home/generic/search/results?SGWisbnSGWID=5-40109-22-141358322-0
| title = Parameterized Complexity Theory
| isbn = 978-3-540-29952-3 |ref=harv
| publisher = Springer
| url = http://www.springer.com/east/home/generic/search/results?SGWisbn=5-40109-22-141358322-0
| isbn = 978-3-540-29952-3
}}
 
*{{cite book
| first=Rolf | last=Niedermeier | authorlink=Rolf Niedermeier
| first=Rolf
| last=Niedermeier
| title=Invitation to Fixed-Parameter Algorithms
| publisher=Oxford University Press
| year=2006
| url=http://www.oup.com/uk/catalogue/?ci=9780198566076
| isbn = 0-19-856607-7 |ref=harv
}}
 
* The Computer Journal. Volume 51, Numbers 1 and 3 (2008). [http://comjnl.oxfordjournals.org/ The Computer Journal]. Special Double Issue on Parameterized Complexity with 15 survey articles, book review, and a Foreword by Guest Editors R. Downey, M. Fellows and M. Langston.
Complexity with 15 survey articles, book review, and a Foreword by Guest Editors R. Downey, M. Fellows and M. Langston.
 
== External links ==