- Valentin Buchhold, Peter Sanders, Dorothea Wagner:
Fast, Exact and Scalable Dynamic Ridesharing. ALENEX 2021: 98-112 - Alexander Gellner, Sebastian Lamm, Christian Schulz, Darren Strash
, Bogdán Zaválnij:
Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations. ALENEX 2021: 128-142 - Loukas Georgiadis, Dionysios Kefallinos, Luigi Laura, Nikos Parotsidis:
An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. ALENEX 2021: 85-97 - Gramoz Goranci, Monika Henzinger, Dariusz Leniowski, Christian Schulz, Alexander Svozil:
Fully Dynamic k-Center Clustering in Low Dimensional Metrics. ALENEX 2021: 143-153 - Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Scalable Shared-Memory Hypergraph Partitioning. ALENEX 2021: 16-30 - Michael Kerber, Alexander Rolle:
Fast Minimal Presentations of Bi-graded Persistence Modules. ALENEX 2021: 207-220 - Clément Maria, Owen Rouillé:
Computation of Large Asymptotics of 3-Manifold Quantum Invariants. ALENEX 2021: 193-206 - Lara Ost, Christian Schulz, Darren Strash:
Engineering Data Reduction for Nested Dissection. ALENEX 2021: 113-127 - Rick Plachetta, Alexander van der Grinten:
SAT-and-Reduce for Vertex Cover: Accelerating Branch-and-Reduce by SAT Solving. ALENEX 2021: 169-180 - Merten Popp, Sebastian Schlag, Christian Schulz, Daniel Seemaier:
Multilevel Acyclic Hypergraph Partitioning. ALENEX 2021: 1-15 - Brian Wheatman, Helen Xu:
A Parallel Packed Memory Array to Store Dynamic Graphs. ALENEX 2021: 31-45 - Martin Farach-Colton, Sabine Storandt:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2021, Virtual Conference, January 10-11, 2021. SIAM 2021, ISBN 978-1-61197-647-2 [contents] - 2020
- Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis:
Reverse-Safe Data Structures for Text Indexing. ALENEX 2020: 199-213 - Moritz Beck, Sabine Storandt:
Puzzling Grid Embeddings. ALENEX 2020: 94-105 - Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zügner, Stephan Günnemann, Henning Meyerhenke:
Group Centrality Maximization for Large-scale Graphs. ALENEX 2020: 56-69 - Lukas Barth, Dorothea Wagner:
Engineering Top-Down Weight-Balanced Trees. ALENEX 2020: 161-174 - Fritz Bökler, Markus Chimani:
Approximating Multiobjective Shortest Path in Practice. ALENEX 2020: 120-133 - Patrick Dinklage, Johannes Fischer, Florian Kurpicz:
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory. ALENEX 2020: 214-228 - Andre Droschinsky, Petra Mutzel, Erik Thordsen:
Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. ALENEX 2020: 146-160 - Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna:
RecSplit: Minimal Perfect Hashing via Recursive Splitting. ALENEX 2020: 175-185 - Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash:
Engineering Kernelization for Maximum Cut. ALENEX 2020: 27-41 - Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. ALENEX 2020: 106-119 - Monika Henzinger, Alexander Noe, Christian Schulz:
Shared-Memory Branch-and-Reduce for Multiterminal Cuts. ALENEX 2020: 42-55 - Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uçar:
Karp-Sipser based kernels for bipartite graph matching. ALENEX 2020: 134-145 - Maleq Khan, Gopal Pandurangan, Nguyen Dinh Pham, Anil Vullikanti, Qin Zhang:
A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees. ALENEX 2020: 81-93 - Christian Komusiewicz, Frank Sommer:
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. ALENEX 2020: 12-26 - Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel:
Approximating Vertex Cover using Structural Rounding. ALENEX 2020: 70-80 - André Schidler, Stefan Szeider:
Computing Optimal Hypertree Decompositions. ALENEX 2020: 1-11 - Jens Zentgraf, Henning Timm, Sven Rahmann:
Cost-optimal assignment of elements in genome-scale multi-way bucketed Cuckoo hash tables. ALENEX 2020: 186-198 - Guy E. Blelloch, Irene Finocchi:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020. SIAM 2020, ISBN 978-1-61197-600-7 [contents]
