Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

book chapter · Lecture notes in computer science · 2019

Parameterized Complexity Theory

Ronald de Haan

Cited by 20Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

APA 7

de Haan, R. (2019). Parameterized Complexity Theory. Lecture notes in computer science, 33–41. https://doi.org/10.1007/978-3-662-60670-4_3

MLA 9

de Haan, Ronald. “Parameterized Complexity Theory.” Lecture notes in computer science, 2019, pp. 33–41, https://doi.org/10.1007/978-3-662-60670-4_3.

Chicago

de Haan, Ronald. 2019. “Parameterized Complexity Theory.” Lecture notes in computer science: 33–41. https://doi.org/10.1007/978-3-662-60670-4_3.

Harvard

de Haan, R. (2019) ‘Parameterized Complexity Theory’, Lecture notes in computer science, pp. 33–41. Available at: https://doi.org/10.1007/978-3-662-60670-4_3.

BibTeX
@incollection{dehaan2019parameterized,
  title = {{Parameterized Complexity Theory}},
  author = {de Haan, Ronald},
  booktitle = {Lecture notes in computer science},
  pages = {33--41},
  year = {2019},
  doi = {10.1007/978-3-662-60670-4_3}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers