Editing Parameterized complexity (section)

== References ==
* {{cite conference
|first1  = Jianer 
|last1   = Chen
|first2  = Iyad A. 
|last2   = Kanj
|first3  = Ge 
|last3   = Xia 
|title   = Improved Parameterized Upper Bounds for Vertex Cover
|conference = Mathematical Foundations of Computer Science
|publisher = Springer
|publication-place = Berlin, Heidelberg
|volume  = 4162
|pages   = 238–249
|year    = 2006
|doi     = 10.1007/11821069_21
|isbn   = 978-3-540-37791-7
|citeseerx   = 10.1.1.432.831
}}
*{{cite book
|last1=Cygan|first1=Marek
|last2=Fomin|first2=Fedor V.
|last3=Kowalik|first3=Lukasz
|last4=Lokshtanov|first4=Daniel
|last5=Marx|first5=Daniel
|last6=Pilipczuk|first6=Marcin
|last7=Pilipczuk|first7=Michal
|last8=Saurabh|first8=Saket
|year=2015
|title=Parameterized Algorithms
|publisher=Springer
|isbn=978-3-319-21274-6
|page=555
}}
* {{cite book
|last1        = Downey 
|first1       = Rod G. 
|authorlink  = Rod Downey
|last2       = Fellows 
|first2      = Michael R. 
|authorlink2 = Michael Fellows
|title       = Parameterized Complexity
|publisher   = Springer
|year        = 1999
|url         = https://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        = 978-0-387-94883-6 
}}
* {{cite book
|last1        = Flum 
|first1       = Jörg 
|authorlink  = Jörg Flum
|last2       = Grohe 
|first2      = Martin 
|authorlink2 = Martin Grohe
|title       = Parameterized Complexity Theory 
|year        = 2006 
|publisher   = Springer
|url         = https://www.springer.com/east/home/generic/search/results?SGWID=5-40109-22-141358322-0
|isbn        = 978-3-540-29952-3 
}}
*{{cite book
|last1=Fomin|first1=Fedor V.
|last2=Lokshtanov|first2=Daniel
|last3=Saurabh|first3=Saket
|last4=Zehavi|first4=Meirav
|year=2019
|title=Kernelization: Theory of Parameterized Preprocessing
|publisher=Cambridge University Press
|isbn=978-1107057760
|doi=10.1017/9781107415157
|page=528|s2cid=263888582
}}
*{{cite book
|last1=Gurevich|first1=Yuri
|last2=Stockmeyer|first2=Larry
|last3=Vishkin|first3=Uzi
|year=1984
|title=Solving NP-hard problems on graphs that are almost trees and an application to facility location problems
|publisher=Journal of the ACM
|page=459-473}}
* {{cite book
 |first       = Rolf
 |last        = Niedermeier
 |authorlink  = Rolf Niedermeier
 |title       = Invitation to Fixed-Parameter Algorithms
 |publisher   = Oxford University Press
 |year        = 2006
 |url         = http://www.oup.com/uk/catalogue/?ci=9780198566076
 |isbn        = 978-0-19-856607-6
 |url-status     = dead
 |archive-url  = https://web.archive.org/web/20080924051521/http://www.oup.com/uk/catalogue/?ci=9780198566076
 |archive-date = 2008-09-24
}}
* {{cite book
|first      = Martin
|last       = Grohe 
|authorlink = Martin Grohe
|chapter    = Descriptive and Parameterized Complexity
|title      = Computer Science Logic
|publisher  = Springer Berlin Heidelberg
|series     = Lecture Notes in Computer Science
|volume     = 1683
|year       = 1999
|pages      = 14–31
|isbn       = 978-3-540-66536-6
|doi       = 10.1007/3-540-48168-0_3 
|citeseerx       = 10.1.1.25.9250 
}}
* [[The Computer Journal]]. Volume 51, Numbers 1 and 3 (2008). [https://web.archive.org/web/20051125014940/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.