Skip Navigation

Receive this page by email each issue: [Sign up for eTOCs]

Cover Image
Other Issues:
Previous Next
Contents: Volume 51, Number 1, January 2008   [Index by Author] 

Down Articles
Down Book review


[Search ALL Issues]


Table of Contents (PDF)

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.

Articles Back

Rodney G. Downey, Michael R. Fellows, and Michael A. Langston
The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors
The Computer Journal 2008 51: 1-6; doi:10.1093/comjnl/bxm111 [Full Text] [PDF] [Request Permissions]  

Falk Hüffner, Rolf Niedermeier, and Sebastian Wernicke
Techniques for Practical Fixed-Parameter Algorithms
The Computer Journal Advance Access published on July 18, 2007
The Computer Journal 2008 51: 7-25; doi:10.1093/comjnl/bxm040 [Abstract] [Full Text] [PDF] [Request Permissions]  

Michael A. Langston, Andy D. Perkins, Arnold M. Saxton, Jon A. Scharff, and Brynn H. Voy
Innovative Computational Methods for Transcriptomic Data Analysis: A Case Study in the Use of FPT for Practical Algorithm Design and Implementation
The Computer Journal Advance Access published on March 6, 2007
The Computer Journal 2008 51: 26-38; doi:10.1093/comjnl/bxm003 [Abstract] [Full Text] [PDF] [Request Permissions]  

Jianer Chen and Jie Meng
On Parameterized Intractability: Hardness and Completeness
The Computer Journal Advance Access published on August 10, 2007
The Computer Journal 2008 51: 39-59; doi:10.1093/comjnl/bxm036 [Abstract] [Full Text] [PDF] [Request Permissions]  

Dániel Marx
Parameterized Complexity and Approximation Algorithms
The Computer Journal Advance Access published on July 28, 2007
The Computer Journal 2008 51: 60-78; doi:10.1093/comjnl/bxm048 [Abstract] [Full Text] [PDF] [Request Permissions]  

Jens Gramm, Arfst Nickelsen, and Till Tantau
Fixed-Parameter Algorithms in Phylogenetics
The Computer Journal Advance Access published on July 30, 2007
The Computer Journal 2008 51: 79-101; doi:10.1093/comjnl/bxm049 [Abstract] [Full Text] [PDF] [Request Permissions]  

Leizhen Cai
Parameterized Complexity of Cardinality Constrained Optimization Problems
The Computer Journal Advance Access published on November 3, 2007
The Computer Journal 2008 51: 102-121; doi:10.1093/comjnl/bxm086 [Abstract] [Full Text] [PDF] [Request Permissions]  

Christian Sloper and Jan Arne Telle
An Overview of Techniques for Designing Parameterized Algorithms
The Computer Journal Advance Access published on June 18, 2007
The Computer Journal 2008 51: 122-136; doi:10.1093/comjnl/bxm038 [Abstract] [Full Text] [PDF] [Request Permissions]  

Book review Back

William Gasarch and Keung Ma Kin
Invitation to Fixed-Parameter Algorithms • Parameterized Complexity Theory • Parameterized Algorithmics: Theory, Practice and Prospects
The Computer Journal Advance Access published on August 1, 2007
The Computer Journal 2008 51: 137-140; doi:10.1093/comjnl/bxm047 [Full Text] [PDF] [Request Permissions]  

The Wilkes Best Paper Award in Volume 49 (2006)
The Computer Journal 2008 51: NP; doi:10.1093/comjnl/bxm095 [PDF] [Request Permissions]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.