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 |
|---|---|---|
| 2021 | Streaming Set Cover in Practice. | Michael Barlow, Christian Konrad, Charana Nandasena |
| 2021 | Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering. | Eugenio Angriman, Ruben Becker, Gianlorenzo D'Angelo, Hugo Gilbert, Alexander van der Grinten, Henning Meyerhenke |
| 2021 | Engineering a Fast Probabilistic Isomorphism Test. | Markus Anders, Pascal Schweitzer |
| 2020 | Cost-optimal assignment of elements in genome-scale multi-way bucketed Cuckoo hash tables. | Jens Zentgraf, Henning Timm, Sven Rahmann |
| 2020 | Computing Optimal Hypertree Decompositions. | Andr Schidler, Stefan Szeider |
| 2020 | Approximating Vertex Cover using Structural Rounding. | Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel |
| 2020 | FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems. | Christian Komusiewicz, Frank Sommer |
| 2020 | A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees. | Maleq Khan, Gopal Pandurangan, Nguyen Dinh Pham, Anil Vullikanti, Qin Zhang |
| 2020 | Karp-Sipser based kernels for bipartite graph matching. | Kamer Kaya, Johannes Langguth, Ioannis Panagiotas, Bora Uar |
| 2020 | Shared-Memory Branch-and-Reduce for Multiterminal Cuts. | Monika Henzinger, Alexander Noe, Christian Schulz |
| 2020 | Fully Dynamic Single-Source Reachability in Practice: An Experimental Study. | Kathrin Hanauer, Monika Henzinger, Christian Schulz |
| 2020 | Engineering Kernelization for Maximum Cut. | Damir Ferizovic, Demian Hespe, Sebastian Lamm, Matthias Mnich, Christian Schulz, Darren Strash |
| 2020 | RecSplit: Minimal Perfect Hashing via Recursive Splitting. | Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna |
| 2020 | Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach. | Andre Droschinsky, Petra Mutzel, Erik Thordsen |
| 2020 | Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory. | Patrick Dinklage, Johannes Fischer, Florian Kurpicz |
| 2020 | Approximating Multiobjective Shortest Path in Practice. | Fritz Bkler, Markus Chimani |
| 2020 | Engineering Top-Down Weight-Balanced Trees. | Lukas Barth, Dorothea Wagner |
| 2020 | Group Centrality Maximization for Large-scale Graphs. | Eugenio Angriman, Alexander van der Grinten, Aleksandar Bojchevski, Daniel Zgner, Stephan Gnnemann, Henning Meyerhenke |
| 2020 | Puzzling Grid Embeddings. | Moritz Beck, Sabine Storandt |
| 2020 | Reverse-Safe Data Structures for Text Indexing. | Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis |
| 2019 | Batch-Parallel Euler Tour Trees. | Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch |
| 2019 | Faster Support Vector Machines. | Sebastian Schlag, Matthias Schmitt, Christian Schulz |
| 2019 | Scalable Edge Partitioning. | Sebastian Schlag, Christian Schulz, Daniel Seemaier, Darren Strash |
| 2019 | Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs. | Sebastian Lamm, Christian Schulz, Darren Strash, Robert Williger, Huashuo Zhang |
| 2019 | A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints. | Adalat Jabrayilov, Petra Mutzel |
101–125 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