
Journals in DBLP
J. Algorithms 2001, volume: 41, number: 2
 Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner
The kClient Problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:115173 [Journal]
 Uriel Feige, Michael Langberg
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:174211 [Journal]
 Chandra Chekuri, Michael A. Bender
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:212224 [Journal]
 Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk
The Complexity of Gene Placement. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:225243 [Journal]
 Peter Winkler
Optimality and Greed in Dynamic Allocation. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:244261 [Journal]
 Kazuo Iwama, Eiji Miyano
An Oblivious Routing Algorithm for TwoDimensional Meshes of Constant QueueSize. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:262279 [Journal]
 Jianer Chen, Iyad A. Kanj, Weijia Jia
Vertex Cover: Further Observations and Further Improvements. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:280301 [Journal]
 Codrin M. Nichitiu, Jacques Mazoyer, Eric Rémila
Algorithms for Leader Election by Cellular Automata. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:302329 [Journal]
 Timothy M. Chan, Alon Efrat
Fly Cheaply: On the Minimum Fuel Consumption Problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:330337 [Journal]
 Gad M. Landau, Michal ZivUkelson
On the Common Substring Alignment Problem. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:338359 [Journal]
 Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
Efficient and Practical Algorithms for Sequential Modular Decomposition. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:360387 [Journal]
 Milind Dawande, Pinar Keskinocak, Jayashankar M. Swaminathan, Sridhar Tayur
On Bipartite and Multipartite Clique Problems. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:388403 [Journal]
 Amitabh Chaudhary, Sundar Vishwanathan
Approximation Algorithms for the Achromatic Number. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:404416 [Journal]
 Matthew Cary
Toward Optimal epsilonApproximate Nearest Neighbor Algorithms. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:417428 [Journal]
 Refael Hassin, Samir Khuller
zApproximations. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:429442 [Journal]
 Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:41, n:2, pp:443470 [Journal]
