- Thomas Mueller Graf, Daniel Lemire:
Binary Fuse Filters: Fast and Smaller Than Xor Filters. ACM J. Exp. Algorithmics 27: 1.5:1-1.5:15 (2022) - Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ACM J. Exp. Algorithmics 27: 1.7:1-1.7:16 (2022) - Martin Grötschel, Michael Jünger, Gerhard Reinelt:
Comments on "An Exact Method for the Minimum Feedback Arc Set Problem". ACM J. Exp. Algorithmics 27: 1.3:1-1.3:4 (2022) - Kathrin Hanauer, Monika Henzinger, Christian Schulz:
Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide. ACM J. Exp. Algorithmics 27: 1.11:1-1.11:45 (2022) - Kathrin Hanauer, Christian Schulz, Jonathan Trummer:
O'Reach: Even Faster Reachability in Large Graphs. ACM J. Exp. Algorithmics 27: 4.2:1-4.2:27 (2022) - Julien Lepagnot, Laurent Moalic, Dominique Schmitt:
Optimal Area Polygonization by Triangulation and Visibility Search. ACM J. Exp. Algorithmics 27: 1-23 (2022) - Xu T. Liu, Andrew Lumsdaine, Mahantesh Halappanavar, Kevin J. Barker, Assefaw Hadish Gebremedhin:
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis. ACM J. Exp. Algorithmics 27: 1.12:1-1.12:31 (2022) - Paul Liu, Jack Spalding-Jamieson, Brandon Zhang, Da Wei Zheng:
Coordinated Motion Planning Through Randomized k-Opt. ACM J. Exp. Algorithmics 27: 3.4:1-3.4:9 (2022) - Jan-Hendrik Lorenz, Florian Wörz:
Toward an Understanding of Long-tailed Runtimes of SLS Algorithms. ACM J. Exp. Algorithmics 27: 1.14:1-1.14:38 (2022) - Marcelo Vaz Netto, Sahudy Montenegro González:
SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution. ACM J. Exp. Algorithmics 27: 1.4:1-1.4:15 (2022) - Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro:
Grammar Compression by Induced Suffix Sorting. ACM J. Exp. Algorithmics 27: 1.1:1-1.1:33 (2022) - Natanael Ramos, Raí C. de Jesus, Pedro J. de Rezende, Cid C. de Souza, Fábio Luiz Usberti:
Triangle-Based Heuristics for Area Optimal Polygonizations. ACM J. Exp. Algorithmics 27: 2.1:1-2.1:25 (2022) - Sebastian Schlag, Tobias Heuer, Lars Gottesbüren, Yaroslav Akhremtsev, Christian Schulz, Peter Sanders:
High-Quality Hypergraph Partitioning. ACM J. Exp. Algorithmics 27: 1.9:1-1.9:39 (2022) - Jessica Shi, Louisa Ruixue Huang, Julian Shun:
Parallel Five-cycle Counting Algorithms. ACM J. Exp. Algorithmics 27: 4.1:1-4.1:23 (2022) - Ben Strasser, Tim Zeitz:
Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks. ACM J. Exp. Algorithmics 27: 1-28 (2022) - Hyeyun Yang, Antoine Vigneron:
Coordinated Path Planning through Local Search and Simulated Annealing. ACM J. Exp. Algorithmics 27: 3.3:1-3.3:14 (2022) - Abdurrahman Yasar, Muhammed Fatih Balin, Xiaojing An, Kaan Sancak, Ümit V. Çatalyürek:
On Symmetric Rectilinear Partitioning. ACM J. Exp. Algorithmics 27: 1.2:1-1.2:26 (2022) - 2021
- Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer, Dominik Köppl, Marvin Löbel, Gonzalo Navarro, Rajeev Raman:
Engineering Practical Lempel-Ziv Tries. ACM J. Exp. Algorithmics 26: 14:1-14:47 (2021) - Ali Baharev, Hermann Schichl, Arnold Neumaier, Tobias Achterberg:
An Exact Method for the Minimum Feedback Arc Set Problem. ACM J. Exp. Algorithmics 26: 1.4:1-1.4:28 (2021) - Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis:
Reverse-Safe Text Indexing. ACM J. Exp. Algorithmics 26: 1.10:1-1.10:26 (2021) - Gerth Stølting Brodal, Konstantinos Mampentzidis:
Cache Oblivious Algorithms for Computing the Triplet Distance between Trees. ACM J. Exp. Algorithmics 26: 1.2:1-1.2:44 (2021) - Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel:
Practical Wavelet Tree Construction. ACM J. Exp. Algorithmics 26: 1.8:1-1.8:67 (2021) - Martin Farach-Colton, Katia Leal, Miguel A. Mosteiro, Christopher Thraves Caro:
Dynamic Windows Scheduling with Reallocation. ACM J. Exp. Algorithmics 26: 1.11:1-1.11:19 (2021) - Johannes Klaus Fichte, Markus Hecher, Florim Hamiti:
The Model Counting Competition 2020. ACM J. Exp. Algorithmics 26: 13:1-13:26 (2021) - Wolfgang Fischl, Georg Gottlob, Davide Mario Longo, Reinhard Pichler:
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. ACM J. Exp. Algorithmics 26: 1.6:1-1.6:40 (2021) - Timothy D. Goodrich, Eric Horton, Blair D. Sullivan:
An Updated Experimental Evaluation of Graph Bipartization Methods. ACM J. Exp. Algorithmics 26: 12:1-12:24 (2021) - Michael Hecht, Krzysztof Gonciarz, Szabolcs Horvát:
Tight Localizations of Feedback Sets. ACM J. Exp. Algorithmics 26: 1.5:1-1.5:19 (2021) - Michael Jünger, Elisabeth Lobe, Petra Mutzel, Gerhard Reinelt, Franz Rendl, Giovanni Rinaldi, Tobias Stollenwerk:
Quantum Annealing versus Digital Computing: An Experimental Comparison. ACM J. Exp. Algorithmics 26: 1.9:1-1.9:30 (2021) - Tomohiro Koana, Viatcheslav Korenwein, André Nichterlein, Rolf Niedermeier, Philipp Zschoche:
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments. ACM J. Exp. Algorithmics 26: 1.3:1-1.3:30 (2021) - Zsuzsanna Lipták, Simon J. Puglisi, Massimiliano Rossi:
Pattern Discovery in Colored Strings. ACM J. Exp. Algorithmics 26: 1.1:1-1.1:26 (2021)