Abstract is missing.
- Distributed Graph-based Topology Adaptation using Motif SignaturesMichael Stein, Karsten Weihe, Augustin Wilberg, Roland Kluge, Julian M. Klomp, Mathias Schnee, Lin Wang, Max Mühlhäuser. 1-12 [doi]
- Indexing Variation GraphsJouni Sirén. 13-27 [doi]
- k-way Hypergraph Partitioning AlgorithmYaroslav Akhremtsev, Tobias Heuer, Peter Sanders 0001, Sebastian Schlag. 28-42 [doi]
- Computing Critical Nodes in Directed GraphsNilakantha Paudel, Loukas Georgiadis, Giuseppe F. Italiano. 43-57 [doi]
- I/O-efficient Generation of Massive Graphs Following the LFR BenchmarkMichael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner. 58-72 [doi]
- CSA++: Fast Pattern Search for Large AlphabetsSimon Gog, Alistair Moffat, Matthias Petri. 73-82 [doi]
- Robust Massively Parallel SortingMichael Axtmann, Peter Sanders 0001. 83-97 [doi]
- Engineering External Memory Induced Suffix SortingJuha Kärkkäinen, Dominik Kempa, Simon J. Puglisi, Bella Zhukova. 98-108 [doi]
- Compact Dynamic Rewritable (CDRW) ArraysAndreas Poyias, Simon J. Puglisi, Rajeev Raman. 109-119 [doi]
- Engineering a Distributed Full-Text IndexJohannes Fischer 0001, Florian Kurpicz, Peter Sanders 0001. 120-134 [doi]
- k Document RetrievalJulian Labeit, Simon Gog. 135-145 [doi]
- Efficient Set Intersection Counting Algorithm for Text Similarity MeasuresPreethi Lahoti, Patrick K. Nicholson, Bilyana Taneva. 146-158 [doi]
- The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry)Jan Dean Catarata, Scott Corbett, Harry Stern, Mario Szegedy, Tomás Vyskocil, Zheng Zhang. 159-171 [doi]
- Determining Tournament Payout Structures for Daily Fantasy SportsChristopher Musco, Maxim Sviridenko, Justin Thaler. 172-184 [doi]
- Map Simplification with Topology Constraints: Exactly and in PracticeStefan Funke, Thomas Mendel, Alexander Miller, Sabine Storandt, Maria Wiebe. 185-196 [doi]
- Asynchronous Column GenerationS. Basso, Alberto Ceselli. 197-206 [doi]
- d-D Delaunay Triangulations in Shared and Distributed MemoryDaniel Funke, Peter Sanders. 207-217 [doi]
- An Efficient Algorithm for the 1D Total Visibility-Index ProblemPeyman Afshani, Mark de Berg, Henri Casanova, Benjamin Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis. 218-231 [doi]
- Computing the Expected Value and Variance of Geometric MeasuresFrank Staals, Constantinos Tsirogiannis. 232-246 [doi]
- dDaniel Bahrdt, Michael Becher, Stefan Funke, Filip Krumpe, André Nusser, Martin Seybold, Sabine Storandt. 247-258 [doi]
- I/O-Efficient Event Based Depression Flood RiskLars Arge, Mathias Rav, Sarfraz Raza, Morten Revsbæk. 259-269 [doi]