Conferences in DBLP
Sotiris E. Nikoletseas Algorithms for Wireless Sensor Networks: Design, Analysis and Experimental Evaluation. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:1-12 [Conf ] Matthieu Bouget , Pierre Leone , José D. P. Rolim Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:13-23 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:24-35 [Conf ] Jeff Hartline , Alexa Sharp An Incremental Model for Combinatorial Maximization Problems. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:36-48 [Conf ] Siamak Tazari , Matthias Müller-Hannemann , Karsten Weihe Workload Balancing in Multi-stage Production Processes. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:49-60 [Conf ] Marcin Gomulkiewicz , Miroslaw Kutylowski , Pawel Wlaz Fault Cryptanalysis and the Shrinking Generator. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:61-72 [Conf ] Josep Freixas , Xavier Molinero Some Advances in the Theory of Voting Systems Based on Experimental Algorithms. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:73-84 [Conf ] Rodrigo Paredes , Edgar Chávez , Karina Figueroa , Gonzalo Navarro Practical Construction of k -Nearest Neighbor Graphs in Metric Spaces. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:85-97 [Conf ] Krists Boitmanis , Karlis Freivalds , Peteris Ledins , Rudolfs Opmanis Fast and Simple Approximation of the Diameter and Radius of a Graph. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:98-108 [Conf ] Abdelrahman Amer , B. John Oommen Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:109-120 [Conf ] Leonor Frias , Jordi Petit , Salvador Roura Lists Revisited: Cache Conscious STL Lists. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:121-133 [Conf ] O'Neil Delpratt , Naila Rahman , Rajeev Raman Engineering the LOUDS Succinct Tree Representation. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:134-145 [Conf ] Jérémy Barbay , Alejandro López-Ortiz , Tyler Lu Faster Adaptive Set Intersections for Text Searching. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:146-157 [Conf ] Ankur Gupta , Wing-Kai Hon , Rahul Shah , Jeffrey Scott Vitter Compressed Dictionaries: Space Measures, Data Sets, and Experiments. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:158-169 [Conf ] Kimmo Fredriksson , Szymon Grabowski Efficient Bit-Parallel Algorithms for (delta , alpha )-Matching. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:170-181 [Conf ] Jon Louis Bentley Tiny Experiments for Algorithms and Life. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:182-182 [Conf ] Matthias Englert , Heiko Röglin , Matthias Westermann Evaluation of Online Strategies for Reordering Buffers. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:183-194 [Conf ] Burkhard Monien , Andreas Woclaw Scheduling Unrelated Parallel Machines Computational Results. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:195-206 [Conf ] Mihhail Aizatulin , Florian Diedrich , Klaus Jansen Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:207-218 [Conf ] Lorenza Moreno , Marcus Poggi de Aragão , Eduardo Uchoa Column Generation Based Heuristic for a Helicopter Routing Problem. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:219-230 [Conf ] Josep Díaz , Jordi Petit , Dimitrios M. Thilikos Kernels for the Vertex Cover Problem on the Preferred Attachment Model. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:231-240 [Conf ] Tobias Polzin , Siavash Vahdati Daneshmand Practical Partitioning-Based Methods for the Steiner Problem. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:241-252 [Conf ] Bhaskar DasGupta , German A. Enciso , Eduardo D. Sontag , Yi Zhang Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:253-264 [Conf ] Refael Hassin , Einat Or A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:265-276 [Conf ] Ricardo A. Baeza-Yates Algorithmic Challenges in Web Search Engines. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:277-278 [Conf ] Karina Figueroa , Edgar Chávez , Gonzalo Navarro , Rodrigo Paredes On the Least Cost for Proximity Searching in Metric Spaces. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:279-290 [Conf ] Gerasimos G. Pollatos , Orestis Telelis , Vassilis Zissimopoulos Updating Directed Minimum Cost Spanning Trees. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:291-302 [Conf ] Markus Chimani , Carsten Gutwenger , Petra Mutzel Experiments on Exact Crossing Minimization Using Column Generation. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:303-315 [Conf ] Jens Maue , Peter Sanders , Domagoj Matijevic Goal Directed Shortest Path Queries Using Precomputed Cluster Distances. [Citation Graph (0, 0)][DBLP ] WEA, 2006, pp:316-327 [Conf ]