Abstract is missing.
- Augment or Push? A computational study of Bipartite Matching and Unit Capacity Flow AlgorithmsBoris V. Cherkassky, Andrew V. Goldberg, Paul Martin 0006, João C. Setubal, Jorge Stolfi. 1-10
- Implementations of Dynamic Tree Collections Based on Splay TreesTomasz Radzik. 11-21
- Greedy Matching Algorithms, an Experimental StudyJakob Magun. 22-31
- Efficient, Adaptable Implementations of Graph AlgorithmsDietmar Kühl, Marco Nissen, Karsten Weihe. 32-41
- Practical Performance of Efficient Minimum Cut AlgorithmsMichael Jünger, Giovanni Rinaldi, Stefan Thienel. 42-53
- Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path ProblemDaniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone. 54-63
- A First Experimental Study of a Dynamic Transitive Closure AlgorithmTobias Miller, Christos D. Zaroliagis. 64-73
- Reactive Local Search for Maximum CliqueRoberto Battiti, Marco Protasi. 74-83
- A Discrete Neural Algorithm for the Maximum Clique Problem: Analysis and Circuit ImplementationAlberto Bertoni, Paola Campadelli, Giuliano Grossi. 84-91
- Early Experiences in Implementing the Buffer TreeDavid A. Hutchinson, Anil Maheshwari, Jörg-Rüdiger Sack, Radu Velicescu. 92-103
- The Ice Rink ProblemBernard M. E. Moret, Michael J. Collins 0003, Jared Saia, Ling Yu. 104-111
- AGD-Library: A Library of Algorithms for Graph DrawingDavid Alberts, Carsten Gutwenger, Petra Mutzel, Stefan Näher. 112-123
- A Robust and Efficient Implementation of a Sweep Line Algorithm for the Straight Line Segment Intersection ProblemUlrike Bartuschka, Kurt Mehlhorn, Stefan Näher. 124-135
- A Case Study in Algorithm Engineering for Geometric ComputingRoberto Tamassia, Luca Vismara, James E. Baker. 136-145
- LEONARDO: a software visualization systemPierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi. 146-155
- Implementing RadixsortArne Andersson, Stefan Nilsson. 156-165
- The Architecture of a Software Library for String ProcessingArtur Czumaj, Paolo Ferragina, Leszek Gasieniec, S. Muthukrishnan 0001, J. L. Träff. 166-176
- Vertex-To-Vertex Parallel Radiosity on Clusters of PCsAdi Bar-Lev, Ayal Itzkovitz, Alon Raviv, Assaf Schuster. 177-187
- Fast Compression State Lookup of Internet Packet HeadersBjörn Nordgren, Mikael Sundström. 188-197
- A parallel algorithm for the simulation of the Immune ResponseMassimo Bernaschi, Filippo Castiglione, Sauro Succi. 198-208
- Computing Groebner Bases in the Boolean Setting with Applications to CountingAnna Bernasconi 0001, Bruno Codenotti, Valentino Crespi, Giovanni Resta. 209-218
- Data Structure for Solving Programming Problems Concerning Segments in a SequenceYoshihiko Futamura, Chieko Shirai, Yongmei Liu, Natsuhiko Futamura, Katsuhiko Kakehi 0001. 219-230
- Database Learning: a Method for Empirical Algorithm DesignMark K. Goldberg, David L. Hollinger. 231-239
- Author Index240-241