ALENEX 2011: San Francisco, California, USA
Matthias Müller-Hannemann, Renato Fonseca F. Werneck (Eds.): Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2011, Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA, January 22, 2011. SIAM 2011- Preface.
- Markus Chimani, Matthias Woste, Sebastian Böcker: A Closer Look at the Closest String and Closest Substring Problem. 13-24
- Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff: An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks. 35-47
- Guy E. Blelloch, Julian Shun: A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction. 48-58
- James Demmel: Avoiding Communication in Numerical Linear Algebra. 59
- Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen: Disjoint-Path Facility Location: Theory and Practice. 60-74
- Daniel Chen, Anne Driemel, Leonidas J. Guibas, Andy Nguyen, Carola Wenk: Approximate Map Matching with respect to the Fréchet Distance. 75-83
- Jochen Eisner, Stefan Funke, Andre Herbst, Andreas Spillner, Sabine Storandt: Algorithms for Matching and Predicting Trajectories. 84-95
- Benjamin Doerr, Marvin Künnemann, Magnus Wahlström: Dependent Randomized Rounding: The Bipartite Case. 96-106
- Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel: An SDP Approach to Multi-level Crossing Minimization. 116-126
- Pedro Machado Manhães de Castro, Olivier Devillers: Simple and Efficient Distribution-Sensitive Point Location, in Triangulations. 127-138
- Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh: Engineering a Topological Sorting Algorithm for Massive Graphs. 139-150
- Isabelle Stanton, Ali Pinar: Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains. 151-163
- Suresh Venkatasubramanian, Qiushi Wang: The Johnson-Lindenstrauss Transform: An Empirical Study. 164-173
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17T203403 by the dblp team