![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
ALENEX 2015: San Diego, CA, USA
- Ulrik Brandes, David Eppstein:
Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, ALENEX 2015, San Diego, CA, USA, January 5, 2015. SIAM 2015, ISBN 978-1-61197-375-4 - Shahram Ghandeharizadeh, Sandy Irani, Jenny Lam:
Cache Replacement with Memory Allocation. 1-9 - Hongwei Huo
, Longgang Chen, Heng Zhao, Jeffrey Scott Vitter
, Yakov Nekrich
, Qiang Yu:
A Data-Aware FM-index. 10-23 - Simon Gog, Gonzalo Navarro:
Improved Single-Term Top-k Document Retrieval. 24-32 - Yaroslav Akhremtsev, Peter Sanders, Christian Schulz:
(Semi-)External Algorithms for Graph Partitioning and Clustering. 33-43 - Pierre Bertrand, Christoph Lenzen:
The 1-2-3-Toolkit for Building Your Own Balls-into-Bins Algorithm. 44-54 - Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel:
Computing MaxMin Edge Length Triangulations. 55-69 - Takuya Akiba, Yoichi Iwata:
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover. 70-81 - Yuzuru Okajima, Kouichi Maruyama:
Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions. 82-93 - Kevin Buchin, Irina Kostitsyna
, Maarten Löffler, Rodrigo I. Silveira
:
Region-based Approximation Algorithms for Visibility between Imprecise Locations. 94-103 - Andreas Björklund, Petteri Kaski, Lukasz Kowalik
, Juho Lauri:
Engineering Motif Search for Large Graphs. 104-118 - Matteo Ceccarello, Francesco Silvestri:
Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduce. 119-132 - Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt:
Approximating Betweenness Centrality in Large Evolving Networks. 133-146 - Spyros C. Kontogiannis
, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis
:
Analysis and Experimental Evaluation of Time-Dependent Distance Oracles. 147-158 - Deepak Ajwani, Ulrich Meyer, David Veith:
An I/O-efficient Distance Oracle for Evolving Real-World Graphs. 159-172 - William Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Connectivity in Directed Graphs: An Experimental Study. 173-187
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.