Matching Algorithms Are Fast in Sparse Random Graphs Holger BastKurt MehlhornHisao Tamaki OriginalPaper 09 September 2005 Pages: 3 - 14
A Burnside Approach to the Finite Substitution Problem Daniel Kirsten OriginalPaper 31 October 2005 Pages: 15 - 50
Solving the 2-Disjoint Paths Problem in Nearly Linear Time Torsten Tholey OriginalPaper 08 November 2005 Pages: 51 - 78
Constant Width Planar Computation Characterizes ACC0 Kristoffer Arnsfelt Hansen OriginalPaper 31 October 2005 Pages: 79 - 92
Approximation Algorithms for Minimizing Average Distortion Kedar DhamdhereAnupam GuptaR. Ravi OriginalPaper 29 November 2005 Pages: 93 - 111
Simpler Computation of Single-Source Shortest Paths in Linear Average Time Torben Hagerup OriginalPaper 31 October 2005 Pages: 113 - 120
The Expected Competitive Ratio for Weighted Completion Time Scheduling Alexander SouzaAngelika Steger OriginalPaper 08 November 2005 Pages: 121 - 136
Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms Sebastian Bala OriginalPaper 29 November 2005 Pages: 137 - 163
Algebraic Results on Quantum Automata Andris AmbainisMartin BeaudryDenis Therien OriginalPaper 29 November 2005 Pages: 165 - 188
Time-Space Tradeoff in Derandomizing Probabilistic Logspace Jin-Yi CaiVenkatesan T. ChakaravarthyDieter van Melkebeek OriginalPaper 16 November 2005 Pages: 189 - 208
Local Limit Properties for Pattern Statistics and Rational Models Alberto BertoniChristian ChoffrutVioletta Lonati OriginalPaper 16 November 2005 Pages: 209 - 235
Active Context-Free Games Anca MuschollThomas SchwentickLuc Segoufin OriginalPaper 16 November 2005 Pages: 237 - 276