- 2024
- Olivier Bernard
, Pierre-Alain Fouque, Andrea Lesavourey:
Computing e-th roots in number fields. ALENEX 2024: 207-219 - Daniel Allendorf:
Maintaining Discrete Probability Distributions in Practice. ALENEX 2024: 182-193 - Gill Barequet, Gil Ben-Shachar:
Counting Polyominoes, Revisited. ALENEX 2024: 133-143 - Benjamin Aram Berendsohn:
Fast and simple unrooted dynamic forests. ALENEX 2024: 46-58 - Dominik Bez, Jonas Sauer:
Fast and Delay-Robust Multimodal Journey Planning. ALENEX 2024: 105-117 - Simon D. Fink, Ignaz Rutter:
Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. ALENEX 2024: 1-14 - Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg:
Simple and Robust Dynamic Two-Dimensional Convex Hull. ALENEX 2024: 144-156 - Loukas Georgiadis, Evangelos Kosinas, Daniel Tsokaktsis:
2-Fault-Tolerant Strong Connectivity Oracles. ALENEX 2024: 91-104 - Kathrin Hanauer, Martin P. Seybold, Julian Unterweger:
Covering Rectilinear Polygons with Area-Weighted Rectangles. ALENEX 2024: 157-169 - Monika Henzinger, David Saulpic, Leonhard Sidl:
Experimental Evaluation of Fully Dynamic k-Means via Coresets. ALENEX 2024: 220-233 - Tobias Heuer:
A Direct k-Way Hypergraph Partitioning Algorithm for Optimizing the Steiner Tree Metric. ALENEX 2024: 15-31 - Dominik Krupke:
Near-Optimal Coverage Path Planning with Turn Costs. ALENEX 2024: 118-132 - Moritz Laupichler, Peter Sanders:
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points. ALENEX 2024: 74-90 - Hans-Peter Lehmann, Peter Sanders, Stefan Walzer:
ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force. ALENEX 2024: 194-206 - Nikolai Maas, Lars Gottesbüren, Daniel Seemaier:
Parallel Unconstrained Local Search for Partitioning Irregular Graphs. ALENEX 2024: 32-45 - Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun:
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. ALENEX 2024: 59-73 - Felix Weitbrecht:
Interactive Exploration of the Temporal α-Shape. ALENEX 2024: 170-181 - Rezaul Chowdhury, Solon P. Pissis:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2024, Alexandria, VA, USA, January 7-8, 2024. SIAM 2024, ISBN 978-1-61197-792-9 [contents] - 2023
- Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. ALENEX 2023: 65-76 - Ángel Javier Alonso, Michael Kerber, Siddharth Pritam:
Filtration-Domination in Bifiltered Graphs. ALENEX 2023: 27-38 - Timon Behr, Sabine Storandt:
Lossy Reduction Rules for the Directed Feedback Vertex Set Problem. ALENEX 2023: 53-64 - Maximilian Böther, Otto Kißig, Christopher Weyand:
Efficiently Computing Directed Minimum Spanning Trees. ALENEX 2023: 86-95 - Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Local Motif Clustering via (Hyper)Graph Partitioning. ALENEX 2023: 96-109 - Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer:
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. ALENEX 2023: 1-14 - Shion Fukuzawa, Christopher Ho, Sandy Irani, Jasen Zion:
Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal. ALENEX 2023: 135-147 - William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild:
Multiway Powersort. ALENEX 2023: 190-200 - Aaron Hong, Massimiliano Rossi, Christina Boucher:
LZ77 via Prefix-Free Parsing. ALENEX 2023: 123-134 - Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schöllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Davis Issac, Simon Krogmann, Pascal Lenzner:
Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. ALENEX 2023: 110-122 - Rafael Kiesel, André Schidler:
A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. ALENEX 2023: 39-52 - Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
PaCHash: Packed and Compressed Hash Tables. ALENEX 2023: 162-175
