Abstract is missing.
- Fast Local Search for Steiner Trees in GraphsEduardo Uchoa, Renato Fonseca F. Werneck. 1-10 [doi]
- Exact Solutions and Bounds for General Art Gallery ProblemsTobias Baumgartner, Sándor P. Fekete, Alexander Kröller, Christiane Schmidt. 11-22 [doi]
- A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring ProblemStefan Canzar, Khaled M. Elbassioni, Julián Mestre. 23-33 [doi]
- Implementation and Parallelization of a Reverse-Search Algorithm for Minkowski SumsChristophe Weibel. 34-42 [doi]
- Simple and Fast Nearest Neighbor SearchMarcel Birn, Manuel Holtgrewe, Peter Sanders, Johannes Singler. 43-54 [doi]
- Tabulation Based 5-Universal Hashing and Linear ProbingMikkel Thorup, Yin Zhang. 62-76 [doi]
- Conjunctive Filter: Breaking the Entropy BarrierDaisuke Okanohara, Yuichi Yoshida. 77-83 [doi]
- Succinct Trees in PracticeDiego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Kunihiko Sadakane. 84-97 [doi]
- Employing (1 - epsilon) Dominating Set Partitions as Backbones in Wireless Sensor NetworksDhia Mahjoub, David W. Matula. 98-111 [doi]
- Budgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections NetworkDonald Ephraim Curtis, Sriram V. Pemmaraju, Philip Polgreen. 112-123 [doi]
- Route Planning with Flexible Objective FunctionsRobert Geisberger, Moritz Kobitzsch, Peter Sanders. 124-137 [doi]
- Navigation in Real-World Complex Networks through Embedding in Latent SpacesXiaomeng Ban, Jie Gao, Arnout van de Rijt. 138-148 [doi]
- Implementing Streaming Simplification for large Labeled MeshesCatalin Constantin, Shawn Brown, Jack Snoeyink. 149-158 [doi]
- Untangling the Braid: Finding Outliers in a Set of StreamsChiranjeeb Buragohain, Luca Foschini, Subhash Suri. 159-172 [doi]
- StreamKM++: A Clustering Algorithms for Data StreamsMarcel R. Ackermann, Christiane Lammersen, Marcus Märtens, Christoph Raupach, Christian Sohler, Kamil Swierkot. 173-187 [doi]