Volume 41, Number 1, October 2001
- Jørgen Bang-Jensen, Anders Yeo:
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs.
1-19
- Zhi-Zhong Chen:
Approximation Algorithms for Independent Sets in Map Graphs.
20-40
- Andrzej Lingas, Hans Olsson, Anna Östlin:
Efficient Merging and Construction of Evolutionary Trees.
41-51
- Gabriela Jeronimo, Susana Puddu, Juan Sabia:
Computing Chow Forms and Some Applications.
52-68
- Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh:
Deterministic Dictionaries.
69-85
- Peter Sanders, Roberto Solis-Oba:
How Helpers Hasten h-Relations.
86-98
- Michael Krivelevich, Ram Nathaniel, Benny Sudakov:
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs.
99-113
Volume 41, Number 2, November 2001
- Houman Alborzi, Eric Torng, Patchrawat Uthaisombut, Stephen Wagner:
The k-Client Problem.
115-173
- Uriel Feige, Michael Langberg:
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning.
174-211
- Chandra Chekuri, Michael A. Bender:
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.
212-224
- Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk:
The Complexity of Gene Placement.
225-243
- Peter Winkler:
Optimality and Greed in Dynamic Allocation.
244-261
- Kazuo Iwama, Eiji Miyano:
An Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size.
262-279
- Jianer Chen, Iyad A. Kanj, Weijia Jia:
Vertex Cover: Further Observations and Further Improvements.
280-301
- Codrin M. Nichitiu, Jacques Mazoyer, Eric Rémila:
Algorithms for Leader Election by Cellular Automata.
302-329
- Timothy M. Chan, Alon Efrat:
Fly Cheaply: On the Minimum Fuel Consumption Problem.
330-337
- Gad M. Landau, Michal Ziv-Ukelson:
On the Common Substring Alignment Problem.
338-359
- Elias Dahlhaus, Jens Gustedt, Ross M. McConnell:
Efficient and Practical Algorithms for Sequential Modular Decomposition.
360-387
- Milind Dawande, Pinar Keskinocak, Jayashankar M. Swaminathan, Sridhar Tayur:
On Bipartite and Multipartite Clique Problems.
388-403
- Amitabh Chaudhary, Sundar Vishwanathan:
Approximation Algorithms for the Achromatic Number.
404-416
- Matthew Cary:
Toward Optimal epsilon-Approximate Nearest Neighbor Algorithms.
417-428
- Refael Hassin, Samir Khuller:
z-Approximations.
429-442
- Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles.
443-470
Last update Mon May 20 17:57:26 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
