- Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier:
Tailored vertex ordering for faster triangle listing in large graphs. ALENEX 2023: 77-85 - Hans-Peter Lehmann
, Peter Sanders, Stefan Walzer:
SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. ALENEX 2023: 176-189 - Rajan Shankar, Jonathan Spreer:
A Uniform Sampling Procedure for Abstract Triangulations of Surfaces. ALENEX 2023: 15-26 - Florian Stober, Armin Weiß:
Lower Bounds for Sorting 16, 17, and 18 Elements. ALENEX 2023: 201-213 - Brian Wheatman, Randal C. Burns, Aydin Buluç, Helen Xu:
Optimizing Search Layouts in Packed Memory Arrays. ALENEX 2023: 148-161 - Gonzalo Navarro, Julian Shun:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023. SIAM 2023, ISBN 978-1-61197-756-1 [contents] - 2022
- Yifan Xu, Anchengcheng Zhou, Grace Q. Yin, Kunal Agrawal, I-Ting Angelina Lee, Tao B. Schardl:
Efficient Access History for Race Detection. ALENEX 2022: 117-130 - Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald:
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. ALENEX 2022: 27-40 - Daniel Bahrdt, Stefan Funke, Sokol Makolli, Claudius Proissl:
Distance Closures: Unifying Search- and Lookup-based Shortest Path Speedup Techniques. ALENEX 2022: 1-12 - Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder:
Load Balancing: The Long Road from Theory to Practice. ALENEX 2022: 104-116 - Emil Biju, Sundar Raman P.:
Perturbation Analysis of Practical Algorithms for the Maximum Scatter Travelling Salesman Problem. ALENEX 2022: 158-168 - Thomas Bläsius, Tobias Friedrich, David Stangl, Christopher Weyand:
An Efficient Branch-and-Bound Solver for Hitting Set. ALENEX 2022: 209-220 - Guy E. Blelloch, Magdalen Dobson:
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. ALENEX 2022: 195-208 - Jonas Charfreitag, Michael Jünger, Sven Mallach, Petra Mutzel:
McSparse: Exact Solutions of Sparse Maximum Cut and Sparse Unconstrained Binary Quadratic Optimization Problems. ALENEX 2022: 54-66 - David Coudert, André Nusser, Laurent Viennot:
Computing Graph Hyperbolicity Using Dominating Sets. ALENEX 2022: 78-90 - Tamal K. Dey, Simon Zhang:
Approximating 1-Wasserstein Distance between Persistence Diagrams by Graph Sparsification. ALENEX 2022: 169-183 - Leszek Gasieniec, Benjamin Smith, Sebastian Wild:
Towards the 5/6-Density Conjecture of Pinwheel Scheduling. ALENEX 2022: 91-103 - Lars Gottesbüren, Tobias Heuer, Peter Sanders, Sebastian Schlag:
Shared-Memory n-level Hypergraph Partitioning. ALENEX 2022: 131-144 - Monika Henzinger, Alexander Noe, Christian Schulz:
Practical Fully Dynamic Minimum Cut Algorithms. ALENEX 2022: 13-26 - Moritz Potthoff, Jonas Sauer:
Fast Multimodal Journey Planning for Three Criteria. ALENEX 2022: 145-157 - André Schidler, Stefan Szeider:
A SAT Approach to Twin-Width. ALENEX 2022: 67-77 - Darren Strash, Louise Thompson:
Effective Data Reduction for the Vertex Clique Cover Problem. ALENEX 2022: 41-53 - Dena Tayebi, Saurabh Ray, Deepak Ajwani:
Learning to Prune Instances of k-median and Related Problems. ALENEX 2022: 184-194 - Front Matter. ALENEX 2022: i-iii
- Cynthia A. Phillips, Bettina Speckmann:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2022, Alexandria, VA, USA, January 9-10, 2022. SIAM 2022, ISBN 978-1-61197-704-2 [contents] - 2021
- Markus Anders, Pascal Schweitzer:
Engineering a Fast Probabilistic Isomorphism Test. ALENEX 2021: 73-84 - Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke:
Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. ALENEX 2021: 154-168 - Michael Barlow, Christian Konrad, Charana Nandasena:
Streaming Set Cover in Practice. ALENEX 2021: 181-192 - Antonio Boffa, Paolo Ferragina, Giorgio Vinciguerra:
A "Learned" Approach to Quicken and Compress Rank/Select Dictionaries. ALENEX 2021: 46-59 - Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi:
PFP Compressed Suffix Trees. ALENEX 2021: 60-72
