Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO)

Preface to the Workshop on Algorithm Engineering and Experiments; Preface to the Workshop on Analytic Algorithmics and Combinatorics; Workshop on Algorithm Engineering and Experiments; Engineering Geometric Algorithms; Persistent Problems and Some Solutions (Abstract of Invited Talk); Dan Halperin; Engineering a Cache-Oblivious Sorting Algorithm; Gerth Stolting Brodal, Rolf Fagerberg, and Kristoffer Vinther; The Robustness of the Sum-of-Squares Algorithm for Bin Packing; Michael A. Bender, Bryan Bradley, Geetha Jagannathan, and Krishnan Pillaipakkamnatt; Practical Aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences; Wing-Kal Hon, Tak-Wah Lam, Wing-Kin Sung, Wai-Leuk Tse, Chi-Kwong Wong, and Slu-Ming Yiu; Faster Placement of Hydrogens in Protein Structures by Dynamic Programming Andrew Leaver-Fay, Yuanxin Liu, and Jack Snoeyink; An Experimental Analysis of a Compact Graph Representation Daniel K. Blandford, Guy E. Blelloch, and lan A. Kash; Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, and Christopher T. Symons; Safe Separators for Treewidth Hans L. Bodiaender and Arie M.C.A. Koster; Efficient Implementation of a Hotlink Assignment Algorithm for Web Sites Artur Alves Pessoa, Eduardo Sany Laber, and Criston de Souza; Experimental Comparison of Shortest Path Approaches for Timetable Information; Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis; Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks Ron Gutman; Lazy Algorithms for Dynamic Closest Pair with Arbitrary Distance Measures Jean Cardinal and David Eppstein; Approximating the Visible Region of a Point on a Terrain Boaz Ben-Moshe, Paz Carmi, and Matthew J. Katz; A Computational Framework for Handling Motion Leonidas Guibas, Menelaos I. Karavelas, and Daniel Russel; Engineering a Sorted List Data Structure for 32 Bit Keys Roman Dementiev, Lutz Kettner, Jens Mehnert, and Peter Sanders; Workshop on Analytic Algorithmics and Combinatorics; Theory and Practice of Probabllistic Counting Algorithms (Abstract of Invited Talk) Phllippe Flajolet; Analysis of a Randomized Selection Algorithm Motivated by the LZ'77 Scheme Mark Daniel Ward and Wojciech Szpankowski; The Complexity of Jensen's Algorithm for Counting Polyominoes Gill Barequet and Micha Moffie; Distributional Analyses of Euclidean Algorithms Viviane Baladi and Brigitte Vallee; A Simple Primality Test and the rth Smallest Prime Factor; Daniel Panario, Bruce Richmond, and Martha Yip; Gap-Free Samples of Geometric Random Variables; Pawel Hitczenko and Arnold Knopfmacher; Computation of a Class of Continued Fraction Constants Loick Lhote; Compositions and Patricia Tries: No Fluctuations in the Variancel; Helmut Prodinger; Quadratic Convergence for Scaling of Matrices; Martin Furer; Partial Quicksort; Conrado Martinez