The SCEAS System
Navigation Menu

Journals in DBLP

J. Algorithms
2001, volume: 41, number: 2

  1. Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner
    The k-Client Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:115-173 [Journal]
  2. 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:174-211 [Journal]
  3. 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:212-224 [Journal]
  4. 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:225-243 [Journal]
  5. Peter Winkler
    Optimality and Greed in Dynamic Allocation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:244-261 [Journal]
  6. Kazuo Iwama, Eiji Miyano
    An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:262-279 [Journal]
  7. 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:280-301 [Journal]
  8. 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:302-329 [Journal]
  9. 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:330-337 [Journal]
  10. Gad M. Landau, Michal Ziv-Ukelson
    On the Common Substring Alignment Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:338-359 [Journal]
  11. 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:360-387 [Journal]
  12. 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:388-403 [Journal]
  13. Amitabh Chaudhary, Sundar Vishwanathan
    Approximation Algorithms for the Achromatic Number. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:404-416 [Journal]
  14. Matthew Cary
    Toward Optimal epsilon-Approximate Nearest Neighbor Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:417-428 [Journal]
  15. Refael Hassin, Samir Khuller
    z-Approximations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:429-442 [Journal]
  16. 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:443-470 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002