Volume 110,
Number 1,
June 2001
Proceedings of the First Conference on Algorithms and Experiments,
Trento,
Italy (9-11/Feb.98)
- Roberto Battiti, Alan A. Bertossi, Silvano Martello:
Editorial.
1
- Alberto Bertoni, Paola Campadelli, Giuliano Grossi:
An approximation algorithm for the maximum cut problem and its experimental analysis.
3-12
- Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri:
Experimenting an approximation algorithm for the LCS.
13-24
- Mauro Dell'Amico, Andrea Lodi, Silvano Martello:
Efficient algorithms and codes for k-cardinality assignment problems.
25-40
- Nicola Galli, Bernhard Seybold, Klaus Simon:
Tetris-Hashing or optimal table compression.
41-58
- Mark K. Goldberg, D. L. Hollinger:
Designing algorithms by sampling.
59-75
- Vesa Hirvisalo, Esko Nuutila, Eljas Soisalon-Soininen:
Transitive closure algorithm MEMTC and its performance analysis.
77-84
Volume 110,
Number 2-3,
June 2001
- Susanne Albers, Günter Schmidt:
Scheduling with unexpected machine breakdowns.
85-99
- Sergei L. Bezrukov:
Embedding complete trees into the hypercube.
101-119
- Katarína Cechlárová, Vladimír Lacko:
Persistency in combinatorial optimization problems on matroids.
121-132
- Bo Chen, Donglei Du, Jiye Han, Jianjun Wen:
On-line scheduling of small open shops.
133-150
- Danny Z. Chen, Gautam Das, Michiel H. M. Smid:
Lower bounds for computing geometric spanners and approximate shortest paths.
151-167
- Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner:
Efficient algorithms on distributive lattices.
169-187
- Toru Hasunuma, Hiroshi Nagamochi:
Independent spanning trees with small depths in iterated line digraphs.
189-211
- Dusan Hvalica:
Searching for a minimal solution subgraph in explicit AND/OR graphs.
213-225
- Dimitrios Kagaris, Spyros Tragoudas:
Computational analysis of counter-based schemes for VLSI test pattern generation.
227-250
- Igor Pak, Van H. Vu:
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.
251-272
- Han Ren, Yanpei Liu:
Enumerating near-4-regular maps on the sphere and the torus.
273-288
- Irena Rusu, Jeremy Spinrad:
Domination graphs: examples and counterexamples.
289-300
- F. Bruce Shepherd, Lisa Zhang:
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.
301-315
- Koichi Yamazaki:
On approximation intractability of the path-distance-width problem.
317-325
Copyright © Mon Nov 2 21:31:07 2009
by Michael Ley (ley@uni-trier.de)
