Volume 65, Issue 4

Search all Algorithmica articles

April 2013

Special Issue: Parameterized and Exact Computation, Part II

Issue Editors:

Venkatesh Raman,
Saket Saurabh

11 articles in this issue

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II
Venkatesh Raman
Saket Saurabh
EditorialNotes 08 January 2013 Pages: 711 - 712
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier
M. Praveen
OriginalPaper 18 September 2012 Pages: 713 - 753
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
Stefan Kratsch
Frank Neumann
OriginalPaper Open access 26 May 2012 Pages: 754 - 771
A Tree Traversal Algorithm for Decision Problems in Knot Theory and 3-Manifold Topology
Benjamin A. Burton
Melih Ozlen
OriginalPaper 12 May 2012 Pages: 772 - 801
Parameterized Two-Player Nash Equilibrium
Danny Hermelin
Chien-Chung Huang
Magnus Wahlström
OriginalPaper 06 January 2012 Pages: 802 - 816
On the Exact Complexity of Evaluating Quantified k -CNF
Chris Calabro
Russell Impagliazzo
Ramamohan Paturi
OriginalPaper 24 April 2012 Pages: 817 - 827
Finding and Counting Vertex-Colored Subtrees
Sylvain Guillemot
Florian Sikora
OriginalPaper 06 December 2011 Pages: 828 - 844
Proper Interval Vertex Deletion
Pim van ’t Hof
Yngve Villanger
OriginalPaper 30 May 2012 Pages: 845 - 867
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion
Jesper Nederlof
OriginalPaper Open access 10 March 2012 Pages: 868 - 884
On the Grundy and b-Chromatic Numbers of a Graph
Frédéric Havet
Leonardo Sampaio
OriginalPaper 17 December 2011 Pages: 885 - 899
On the (Non-)Existence of Polynomial Kernels for P _l-Free Edge Modification Problems
Sylvain Guillemot
Frédéric Havet
Anthony Perez
OriginalPaper 21 February 2012 Pages: 900 - 926

Volume 65, Issue 4

Search

Navigation