Volume 39, Number 1, February 2006
: A Burnside Approach to the Finite Substitution Problem.
: Solving the 2-Disjoint Paths Problem in Nearly Linear Time.
: Simpler Computation of Single-Source Shortest Paths in Linear Average Time.
: Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms.
Volume 39, Number 2, April 2006
Volume 39, Number 3, June 2006
Volume 39, Number 4, July 2006
Volume 39, Number 5, September 2006
, Jörg Rothe
: Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem.
: Generating Instances for MAX2SAT with Optimal Solutions.
Bruce E. Litow
: A Special Case of a Unary Regular Language Containment.
Volume 39, Number 6, November 2006