Journal of Algorithms, Volume 57

Volume 57, Number 1, September 2005

• Feodor F. Dragan:
  Estimating all pairs shortest paths in restricted graph families: a unified approach. 1-21
  Electronic Edition (link) BibTeX
• Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
  TSP with neighborhoods of varying size. 22-36
  Electronic Edition (link) BibTeX
• René Sitters:
  Complexity of preemptive minsum scheduling on unrelated parallel machines. 37-48
  Electronic Edition (link) BibTeX
• Leah Epstein, Lene M. Favrholdt:
  Optimal non-preemptive semi-online scheduling on two related machines. 49-73
  Electronic Edition (link) BibTeX

Volume 57, Number 2, November 2005

• Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin:
  Lowest common ancestors in trees and directed acyclic graphs. 75-94
  Electronic Edition (link) BibTeX
• Rob van Stee, Johannes A. La Poutré:
  Minimizing the total completion time on-line on a single machine, using restarts. 95-129
  Electronic Edition (link) BibTeX
• Tor Schoenmeyr, David Yu Zhang:
  FFT-based algorithms for the string matching with mismatches problem. 130-139
  Electronic Edition (link) BibTeX
• Oliver Schirokauer:
  Virtual logarithms. 140-147
  Electronic Edition (link) BibTeX