Abstract is missing.
- Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental EvaluationSotiris E. Nikoletseas. 1-12 [doi]
- Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor NetworksMatthieu Bouget, Pierre Leone, José D. P. Rolim. 13-23 [doi]
- An Efficient Heuristic for the Ring Star ProblemThayse Christine S. Dias, Gilberto F. de Sousa Filho, Elder M. Macambira, Lucidio dos Anjos F. Cabral, Marcia Helena Costa Fampa. 24-35 [doi]
- An Incremental Model for Combinatorial Maximization ProblemsJeff Hartline, Alexa Sharp. 36-48 [doi]
- Workload Balancing in Multi-stage Production ProcessesSiamak Tazari, Matthias Müller-Hannemann, Karsten Weihe. 49-60 [doi]
- Fault Cryptanalysis and the Shrinking GeneratorMarcin Gomulkiewicz, Miroslaw Kutylowski, Pawel Wlaz. 61-72 [doi]
- Some Advances in the Theory of Voting Systems Based on Experimental AlgorithmsJosep Freixas, Xavier Molinero. 73-84 [doi]
- Practical Construction of ::::k::::-Nearest Neighbor Graphs in Metric SpacesRodrigo Paredes, Edgar Chávez, Karina Figueroa, Gonzalo Navarro. 85-97 [doi]
- Fast and Simple Approximation of the Diameter and Radius of a GraphKrists Boitmanis, Karlis Freivalds, Peteris Ledins, Rudolfs Opmanis. 98-108 [doi]
- Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of ReferenceAbdelrahman Amer, B. John Oommen. 109-120 [doi]
- Lists Revisited: Cache Conscious STL ListsLeonor Frias, Jordi Petit, Salvador Roura. 121-133 [doi]
- Engineering the LOUDS Succinct Tree RepresentationO Neil Delpratt, Naila Rahman, Rajeev Raman. 134-145 [doi]
- Faster Adaptive Set Intersections for Text SearchingJérémy Barbay, Alejandro López-Ortiz, Tyler Lu. 146-157 [doi]
- Compressed Dictionaries: Space Measures, Data Sets, and ExperimentsAnkur Gupta, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter. 158-169 [doi]
- Efficient Bit-Parallel Algorithms for (::::delta::::, ::::alpha::::)-MatchingKimmo Fredriksson, Szymon Grabowski. 170-181 [doi]
- Tiny Experiments for Algorithms and LifeJon Louis Bentley. 182-182 [doi]
- Evaluation of Online Strategies for Reordering BuffersMatthias Englert, Heiko Röglin, Matthias Westermann. 183-194 [doi]
- Scheduling Unrelated Parallel Machines Computational ResultsBurkhard Monien, Andreas Woclaw. 195-206 [doi]
- Implementation of Approximation Algorithms for the Max-Min Resource Sharing ProblemMihhail Aizatulin, Florian Diedrich, Klaus Jansen. 207-218 [doi]
- Column Generation Based Heuristic for a Helicopter Routing ProblemLorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa. 219-230 [doi]
- Kernels for the Vertex Cover Problem on the Preferred Attachment ModelJosep Díaz, Jordi Petit, Dimitrios M. Thilikos. 231-240 [doi]
- Practical Partitioning-Based Methods for the Steiner ProblemTobias Polzin, Siavash Vahdati Daneshmand. 241-252 [doi]
- Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone SubsystemsBhaskar DasGupta, German A. Enciso, Eduardo D. Sontag, Yi Zhang. 253-264 [doi]
- A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster IdentificationRefael Hassin, Einat Or. 265-276 [doi]
- Algorithmic Challenges in Web Search EnginesRicardo A. Baeza-Yates. 277-278 [doi]
- On the Least Cost for Proximity Searching in Metric SpacesKarina Figueroa, Edgar Chávez, Gonzalo Navarro, Rodrigo Paredes. 279-290 [doi]
- Updating Directed Minimum Cost Spanning TreesGerasimos G. Pollatos, Orestis Telelis, Vassilis Zissimopoulos. 291-302 [doi]
- Experiments on Exact Crossing Minimization Using Column GenerationMarkus Chimani, Carsten Gutwenger, Petra Mutzel. 303-315 [doi]
- Goal Directed Shortest Path Queries Using Precomputed Cluster DistancesJens Maue, Peter Sanders, Domagoj Matijevic. 316-327 [doi]