FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory)

Vladimir Estivill-Castro, Michael Fellows, M Langston, Frances Rosamond

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Original language	English
Title of host publication	Algorithms and Complexity (Texts in Algorithmics 4)
Place of Publication	London, United Kingdom
Publisher	King's College Publications
Pages	1-41
Number of pages	41
ISBN (Print)	9781904987109
Publication status	Published - 2005

Cite this

@inbook{f0cfe0552b89492ab3fe99d8b7426bd6,

title = "FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory)",

author = "Vladimir Estivill-Castro and Michael Fellows and M Langston and Frances Rosamond",

year = "2005",

language = "English",

isbn = "9781904987109",

pages = "1--41",

booktitle = "Algorithms and Complexity (Texts in Algorithmics 4)",

publisher = "King's College Publications",

}

Algorithms and Complexity (Texts in Algorithmics 4). London, United Kingdom : King's College Publications, 2005. p. 1-41.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory)

AU - Estivill-Castro, Vladimir

AU - Fellows, Michael

AU - Langston, M

AU - Rosamond, Frances

PY - 2005

Y1 - 2005

M3 - Chapter

SN - 9781904987109

SP - 1

EP - 41

BT - Algorithms and Complexity (Texts in Algorithmics 4)

PB - King's College Publications

CY - London, United Kingdom

ER -