Abstract is missing.
- Why CAD Data Repair Requires Discrete Algorithmic TechniquesKarsten Weihe, Thomas Willhalm. 1-12
- Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree NetworksThomas Erlebach, Klaus Jansen. 13-24
- Implementing a Dynamic Compressed TrieStefan Nilsson, Matti Tikkanen. 25-36
- Graph and Hashing Algorithms for Modern Architectures: Design and PerformanceJohn R. Black, Charles U. Martel, Hongbin Qi. 37-48
- Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data CompressionYossi Matias, Nasir Rajpoot, Süleyman Cenk Sahinalp. 49-61
- Computing the Width of a Three-Dimensional Point Set: An Experimental StudyJörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan. 62-73
- Implementation and Testing Eavesdropper Protocols Using the DSP ToolKostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas. 74-85
- Implementing Weighted b-Matching Algorithms: Towards a Flexible Software DesignMatthias Müller-Hannemann, Alexander Schwartz. 86-97
- Matrix Multiplication: A Case Study of Algorithm EngineeringNadav Eiron, Michael Rodeh, Iris Steinwarts. 98-109
- Guarding Scenes against Invasive HypercubesMark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels. 110-120
- Computing Maximum-Cardinality Matchings in Sparse General GraphsJohn D. Kececioglu, A. Justin Pecqueur. 121-132
- A Network Based Approach for Realtime Walkthrough of Massive ModelsMatthias Fischer, Tamás Lukovszki, Martin Ziegler. 133-142
- An Implementation of the Binary Blocking Flow AlgorithmTorben Hagerup, Peter Sanders, Jesper Larsson Träff. 143-154
- An Iterated Heuristic Algorithm for the Set Covering ProblemElena Marchiori, Adri G. Steenbeek. 155-166
- A Computational Study of Routing Algorithms for Realistic Transportation NetworksRiko Jacob, Madhav V. Marathe, Kai Nagel. 167-178
- Hybrid Tree Reconstruction MethodsDaniel H. Huson, Scott Nettles, Kenneth Rice, Tandy Warnow, Shibu Yooseph. 179-192
- An Experimental Study of Word-level Parallelism in Some Sorting AlgorithmsNaila Rahman, Rajeev Raman. 193-203
- Who is Interested in Algorithms and why? Lessons from the Stony Brook Algorithms RepositorySteven Skiena. 204-212