2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX)

Each link below is to a PDF of the paper as it was submitted. Papers are listed in program order. PDF file names represent the Proceedings (ALX and year 11), followed by order in printed version (e.g. 01) and first author's first initial and last name.

Preface

1          Exact Pattern Matching with Feed-Forward Bloom Filters
            Iulian Moraru and David Andersen

13        A Closer Look at the Closest String and Closest Substring Problem
            Markus Chimani, Matthias Woste, and Sebastian Böcker

25        Fast and Lightweight LCP-Array Construction Algorithms
            Simon Gog and Enno Ohlebusch

35        An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
           Eric Berberich, Pavel Emeliyanenko and Michael Sagraloff

48        A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction
           Guy Blelloch and Julian Shun

59        Avoiding Communication in Numerical Linear Algebra
           James Demmel

60       Disjoint-Path Facility Location: Theory and Practice
           Lee Breslau, Ilias Diakonikolas, Nicholas Duffield, Yu Gu, Hajiaghayi Mohammad Taghi, David        Johnson, Howard Karloff, Mauricio Resende and Subhabrata Sen

75       Approximate Map Matching with respect to the Fréchet Distance
           Daniel Chen, Anne Driemel, Leonidas Guibas, Andy Nguyen, and Carola Wenk

84        Algorithms for Matching and Predicting Trajectories
           Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, and Sabine Storandt

96        Dependent Randomized Rounding: The Bipartite Case
           Benjamin Doerr, Marvin Künnemann and Magnus Wahlström

107      1D Vehicle Scheduling with Conflicts
            Torsten J. Gellert and Felix G. König

116      An SDP Approach to Multi-level Crossing Minimization
            Markus Chimani, Philipp Hungerländer, Michael Juenger and Petra Mutzel

127      Simple and Efficient Distribution-Sensitive Point Location, in Triangulations
            Pedro M. M. de Castro and Olivier Devillers

139      Engineering a Topological Sorting Algorithm for Massive Graphs
            Deepak Ajwani, Adan Cosgaya-Lozano and Norbert Zeh

151      Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains
            Isabelle Stanton and Ali Pinar

164      The Johnson-Lindenstrauss Transform: An Empirical Study
           Suresh Venkatasubramanian and Qiushi Wang



Renew SIAM · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Flickr Youtube