Skip to main content
Conference Proceedings

A parameterized complexity tutorial

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7183 LNCS 38-56
DOI: 10.1007/978-3-642-28332-1_4
4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The article was prepared for the LATA 2012 conference where I will be presenting two one and half hour lectures for a short tutorial on parameterized complexity. Much fuller accounts can be found in the books Downey-Fellows [33, 34], Niedermeier [72], Flum-Grohe [49], the two issues of the Computer Journal [36] and the recent survey Downey-Thilikos [39]. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Downey, R. (2012). A parameterized complexity tutorial. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7183 LNCS, pp. 38–56). https://doi.org/10.1007/978-3-642-28332-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free