TABLE OF CONTENTS

• Augment or push? A computational study of bipartite matching and unit capacity maximum flow algorithms.
  B. V. Cherkassky, A. V. Goldberg, P. Martin, J. C. Setubal and J. Stolfi.

• Implementations of dynamic tree collections based on splay trees.
  T. Radzik.

• Greedy matching algorithms, an experimental study.
  J. Magun.

• Efficient, adaptable implementations of graph algorithms.
  D. Kuel, M. Nissen and K. Weihe.

• Practical performance of efficient minimum cut algorithms.
  M. Juenger, G. Rinaldi and S. Thienel.

• Experimental analysis of dynamic algorithms for the single source shortest path problem.
  D. Frigioni, M. Ioffreda, U. Nanni and G. Pasqualone.

• A first experimental study of a dynamic transitive closure algorithm.
  T. Miller and C. Zaroliagis.

• Reactive local search for maximum clique.
  R. Battiti and M. Protasi.

• A discrete neural algorithm for the maximum clique problem: analysis and circuit implementation.
  A. Bertoni, P. Campadelli and G. Grossi.

• Early experiences in implementing the buffer tree.
  D. Hutchinson, A. Maheswari, J. Sack and R. Velicescu.

• The ice rink problem.
  B. Moret, M. Collins, J. Saia and L. Yu.

• AGD-Library: a library of algorithms for graph drawing.
  D. Alberts, C. Gutwenger, P. Mutzel and S. Naeher.

• A robust and efficient implementation of a sweep line algorithm for the straight line segment intersection problem.
  U. Bartuschka, K. Mehlhorn and S. Naeher.

• A case study in algorithm engineering for geometric computing.
  R. Tamassia, L. Vismara and J. E. Baker.

• LEONARDO: a software visualization system.
  P. Crescenzi, C. Demetrescu, I. Finocchi and R. Petreschi.

• Implementing radixsort.
  A. Andersson and S. Nilsson.

• The architecture of a software library for string processing.
  A. Czumaj, P. Ferragina, L. Gasieniec, S. Muthukrishnan and J. Traeff.

• Vertex-to-vertex parallel radiosity on clusters of PCs.
  A. Bar-Lev, A. Itzkovitz, A. Raviv and A. Schuster.

• Fast compression state lookup of Internet packet headers.
  B. Nordgren and M. Sundstrom.

• A parallel algorithm for the simulation of the immune response.
  Massimo Bernaschi, joint work with F. Castiglione and S. Succi.
  Invited Lecture.

• Computing Groebner bases in the Boolean setting with applications to counting.
  A. Bernasconi, B. Codenotti, V. Crespi and G. Resta

• Data structure for solving programming problems concerning segments in a sequence.
  Y. Futamura, C. Shirai, Y. Liu, N. Futamura and K. Kakehi.

• Database learning: a method for empirical algorithm design.
  M. Goldberg and D. Hollinger.