The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures.

Table of Contents:
Preface to the Workshop on Algorithm Engineering and Experiments; Preface to the Workshop on Analytic Algorithmics and Combinatorics; Workshop on Algorithm Engineering and Experiments; Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications, Efi Fogel and Dan Halperin; An Experimental Study of Point Location in General Planar Arrangements, Idit Haran and Dan Halperin; Summarizing Spatial Data Streams Using ClusterHulls, John Hershberger, Nisheeth Shrivastava, and Subhash Suri; Distance-Sensitive Bloom Filters, Adam Kirsch and Michael Mitzenmacher; An Experimental Study of Old and New Depth Measures, John Hugg, Eynat Rafalin, Kathryn Seyboth, and Diane Souvaine; Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching, David Mount; Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty, Grzegorz Malewicz; Using Markov Chains to Design Algorithms for Bounded-Space On-Line Bin Cover, Eyjolfur Asgeirsson and Cliff Stein; Data Reduction, Exact, and Heuristic Algorithms for Clique Cover, Jens Gramm, Jiong Guo, Falk Huffner, and Rolf Niedermeier; Fast Reconfiguration of Data Placement in Parallel Disks, Srinivas Kashyap, Samir Khuller, Yung-Chun (Justin) Wan, and Leana Golubchik; Force-Directed Approaches to Sensor Localization, Alon Efrat, David Forrester, Anand Iyer, Stephen G. Kobourov, and Cesim Erten; Compact Routing on Power Law Graphs with Additive Stretch, Arthur Brady and Lenore Cowen; Reach for A*: Efficient Point-to-Point Shortest Path Algorithms, Andrew V. Goldberg, Haim Kaplan, and Renato F. Werneck; Distributed Routing in Small-World Networks, Oskar Sandberg; Engineering Multi-Level Overlay Graphs for Shortest-Path Queries, Martin Holzer, Frank Schulz, and Dorothea Wagner; Optimal Incremental Sorting, Rodrigo Paredes and Gonzalo Navarro; Workshop on Analytic Algorithmics and Combinatorics; Deterministic Random Walks, Joshua Cooper, Benjamin Doerr, Joel Spencer, and Garbor Tardos; Binary Trees, Left and Right Paths, WKB Expansions, and Painleve Transcendents, Charles Knessl and Wojciech Szpankowski; On the Variance of Quickselect, Jean Daligault and Conrado Martinez; Semirandom Models as Benchmarks for Coloring Algorithms, Michael Krivelevich and Dan Vilenchik; New Results and Open Problems for Deletion Channels, Michael Mitzenmacher; Partial Fillup and Search Time in LC Tries, Svante Janson and Wojciech Szpankowski; Distinct Values Estimators for Power Law Distributions, Rajeev Motwani and Sergei Vassilvitskii; A Random-Surfer Web-Graph Model, Avrim Blum, T-H. Hubert Chan, and Mugizi Robert Rwebangira; Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests, Predrag R. Jelenkovic and Ana Radovanovic; Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation, Robin Pemantle and Mark Daniel Ward; Permanents of Circulants: A Transfer Matrix Approach, Mordecai J. Golin, Yiu Cho Leung, and Yajun Wang; Random Partitions with Parts in the Range of a Polynomial, William M. Y. Goh and Pawel Hitczenko; Author Index.