Parameterized Complexity: The Main Ideas and Connections to Practical Computing

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]

Abstract

Abstract is missing.