Workshop on Algorithm Engineering and Experiments
ALENEX
A
CORE rank
CORE rank (raw)
A
Fields of research
Theory of Computation
Papers indexed
465
1999–2026
Papers per year
199926 peak2026
Most published authors
ALENEX papers
465 records sourced from DBLP. Search titles, filter by year, sort by recency.
| Year | Title | Authors |
|---|---|---|
| 2024 | Maintaining Discrete Probability Distributions in Practice. | Daniel Allendorf |
| 2024 | Computing | Olivier Bernard, Pierre-Alain Fouque, Andrea Lesavourey |
| 2023 | Optimizing Search Layouts in Packed Memory Arrays. | Brian Wheatman, Randal C. Burns, Aydin Bulu, Helen Xu |
| 2023 | Lower Bounds for Sorting 16, 17, and 18 Elements. | Florian Stober, Armin Wei |
| 2023 | A Uniform Sampling Procedure for Abstract Triangulations of Surfaces. | Rajan Shankar, Jonathan Spreer |
| 2023 | SicHash - Small Irregular Cuckoo Tables for Perfect Hashing. | Hans-Peter Lehmann, Peter Sanders, Stefan Walzer |
| 2023 | Tailored vertex ordering for faster triangle listing in large graphs. | Fabrice Lcuyer, Louis Jachiet, Clmence Magnien, Lionel Tabourier |
| 2023 | PaCHash: Packed and Compressed Hash Tables. | Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders |
| 2023 | A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets. | Rafael Kiesel, Andr Schidler |
| 2023 | Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. | Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Davis Issac, Simon Krogmann, Pascal Lenzner |
| 2023 | LZ77 via Prefix-Free Parsing. | Aaron Hong, Massimiliano Rossi, Christina Boucher |
| 2023 | Multiway Powersort. | William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild |
| 2023 | Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal. | Shion Fukuzawa, Christopher Ho, Sandy Irani, Jasen Zion |
| 2023 | A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. | Sndor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer |
| 2023 | Local Motif Clustering via (Hyper)Graph Partitioning. | Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz |
| 2023 | Efficiently Computing Directed Minimum Spanning Trees. | Maximilian Bther, Otto Kiig, Christopher Weyand |
| 2023 | Lossy Reduction Rules for the Directed Feedback Vertex Set Problem. | Timon Behr, Sabine Storandt |
| 2023 | Filtration-Domination in Bifiltered Graphs. | ngel Javier Alonso, Michael Kerber, Siddharth Pritam |
| 2023 | Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. | Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran |
| 2022 | Front Matter. | |
| 2022 | Learning to Prune Instances of | Dena Tayebi, Saurabh Ray, Deepak Ajwani |
| 2022 | Effective Data Reduction for the Vertex Clique Cover Problem. | Darren Strash, Louise Thompson |
| 2022 | A SAT Approach to Twin-Width. | Andr Schidler, Stefan Szeider |
| 2022 | Fast Multimodal Journey Planning for Three Criteria. | Moritz Potthoff, Jonas Sauer |
| 2022 | Practical Fully Dynamic Minimum Cut Algorithms. | Monika Henzinger, Alexander Noe, Christian Schulz |
51–75 of 465← PreviousNext →
Comparable venues
Other A*/A conferences filed under the same field of research.
- A*SODAACM/SIAM Symposium on Discrete Algorithms
- A*ICALPInternational Colloquium on Automata Languages and Programming
- A*STOCACM Symposium on Theory of Computing
- A*FOCSIEEE Symposium on Foundations of Computer Science
- AESAEuropean Symposium on Algorithms
- ASTACSInternational Symposium on Theoretical Aspects of Computer Science
- A*LICSIEEE Symposium on Logic in Computer Science
- AGDGraph Drawing