default search action
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 - 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 - René Sitters:
Complexity of preemptive minsum scheduling on unrelated parallel machines. 37-48 - Leah Epstein, Lene M. Favrholdt:
Optimal non-preemptive semi-online scheduling on two related machines. 49-73
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 - Rob van Stee, Johannes A. La Poutré:
Minimizing the total completion time on-line on a single machine, using restarts. 95-129 - Tor Schoenmeyr, David Yu Zhang:
FFT-based algorithms for the string matching with mismatches problem. 130-139 - Oliver Schirokauer:
Virtual logarithms. 140-147
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.