Daniel Kirsten A Burnside Approach to the Finite Substitution Problem. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:1, pp:15-50 [Journal]
Torsten Tholey Solving the 2-Disjoint Paths Problem in Nearly Linear Time. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:1, pp:51-78 [Journal]
Torben Hagerup Simpler Computation of Single-Source Shortest Paths in Linear Average Time. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:1, pp:113-120 [Journal]
Sebastian Bala Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2006, v:39, n:1, pp:137-163 [Journal]