5. WEA 2006: Cala Galdana, Menorca Island, Spain
Carme Àlvarez, Maria J. Serna (Eds.): Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings. Springer 2006 Lecture Notes in Computer Science ISBN 3-540-34597-3
Session 1
- Sotiris E. Nikoletseas: Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental Evaluation. 1-12
- Matthieu Bouget, Pierre Leone, José D. P. Rolim: Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks. 13-23
Session 2
- Thayse Christine S. Dias, Gilberto F. de Sousa Filho, Elder M. Macambira, Lucidio dos Anjos F. Cabral, Marcia Helena Costa Fampa: An Efficient Heuristic for the Ring Star Problem. 24-35
- Siamak Tazari, Matthias Müller-Hannemann, Karsten Weihe: Workload Balancing in Multi-stage Production Processes. 49-60
Session 3
- Marcin Gomulkiewicz, Miroslaw Kutylowski, Pawel Wlaz: Fault Cryptanalysis and the Shrinking Generator. 61-72
- Josep Freixas, Xavier Molinero: Some Advances in the Theory of Voting Systems Based on Experimental Algorithms. 73-84
Session 4
- Rodrigo Paredes, Edgar Chávez, Karina Figueroa, Gonzalo Navarro: Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces. 85-97
- Krists Boitmanis, Karlis Freivalds, Peteris Ledins, Rudolfs Opmanis: Fast and Simple Approximation of the Diameter and Radius of a Graph. 98-108
Session 5
- Abdelrahman Amer, B. John Oommen: Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference. 109-120
- O'Neil Delpratt, Naila Rahman, Rajeev Raman: Engineering the LOUDS Succinct Tree Representation. 134-145
Session 6
- Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu: Faster Adaptive Set Intersections for Text Searching. 146-157
- Ankur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter: Compressed Dictionaries: Space Measures, Data Sets, and Experiments. 158-169
- Kimmo Fredriksson, Szymon Grabowski: Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching. 170-181
Session 7
- Jon Louis Bentley: Tiny Experiments for Algorithms and Life. 182-182
- Matthias Englert, Heiko Röglin, Matthias Westermann: Evaluation of Online Strategies for Reordering Buffers. 183-194
Session 8
- Burkhard Monien, Andreas Woclaw: Scheduling Unrelated Parallel Machines Computational Results. 195-206
- Mihhail Aizatulin, Florian Diedrich, Klaus Jansen: Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem. 207-218
- Lorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa: Column Generation Based Heuristic for a Helicopter Routing Problem. 219-230
Session 9
- Josep Díaz, Jordi Petit, Dimitrios M. Thilikos: Kernels for the Vertex Cover Problem on the Preferred Attachment Model. 231-240
- Tobias Polzin, Siavash Vahdati Daneshmand: Practical Partitioning-Based Methods for the Steiner Problem. 241-252
Session 10
- Bhaskar DasGupta, German Andres Enciso, Eduardo D. Sontag, Yi Zhang: Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems. 253-264
- Refael Hassin, Einat Or: A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification. 265-276
Session 11
- Ricardo A. Baeza-Yates: Algorithmic Challenges in Web Search Engines. 277-278
- Karina Figueroa, Edgar Chávez, Gonzalo Navarro, Rodrigo Paredes: On the Least Cost for Proximity Searching in Metric Spaces. 279-290
Session 12
- Gerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos: Updating Directed Minimum Cost Spanning Trees. 291-302
- Markus Chimani, Carsten Gutwenger, Petra Mutzel: Experiments on Exact Crossing Minimization Using Column Generation. 303-315
- Jens Maue, Peter Sanders, Domagoj Matijevic: Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. 316-327
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team