Journal: Comput. J.

Volume 51, Issue 1

1 -- 6Rodney G. Downey, Michael R. Fellows, Michael A. Langston. The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors
7 -- 25Falk Hüffner, Rolf Niedermeier, Sebastian Wernicke. Techniques for Practical Fixed-Parameter Algorithms
26 -- 38Michael A. Langston, Andy D. Perkins, Arnold M. Saxton, Jon A. Scharff, Brynn H. Voy. Innovative Computational Methods for Transcriptomic Data Analysis: A Case Study in the Use of FPT for Practical Algorithm Design and Implementation
39 -- 59Jianer Chen, Jie Meng. On Parameterized Intractability: Hardness and Completeness
60 -- 78Dániel Marx. Parameterized Complexity and Approximation Algorithms
79 -- 101Jens Gramm, Arfst Nickelsen, Till Tantau. Fixed-Parameter Algorithms in Phylogenetics
102 -- 121Leizhen Cai. Parameterized Complexity of Cardinality Constrained Optimization Problems
122 -- 136Christian Sloper, Jan Arne Telle. An Overview of Techniques for Designing Parameterized Algorithms
137 -- 140William I. Gasarch, Keung Ma Kin. Invitation to Fixed-Parameter Algorithms: Parameterized Complexity Theory: Parameterized Algorithmics: Theory, Practice and Prospects