Michael R. Fellows. Parameterized Complexity: The Main Ideas and Connections to Practical Computing. In Rudolf Fleischer, Bernard M. E. Moret, Erik Meineche Schmidt, editors, Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000]. Volume 2547 of Lecture Notes in Computer Science, pages 51-77, Springer, 2000. [doi]
@inproceedings{Fellows00,
title = {Parameterized Complexity: The Main Ideas and Connections to Practical Computing},
author = {Michael R. Fellows},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/2547/25470051.htm},
researchr = {https://researchr.org/publication/Fellows00},
cites = {0},
citedby = {0},
pages = {51-77},
booktitle = {Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000]},
editor = {Rudolf Fleischer and Bernard M. E. Moret and Erik Meineche Schmidt},
volume = {2547},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-00346-0},
}