1: A Lower Bound on Cycle-Finding in Sparse Digraphs
2: A Fast Minimum Degree Algorithm and Matching Lower Bound
3: Towards Optimizing Reiter’s HS-Tree for Sequential Diagnosis
4: A Join-Based Hybrid Parameter for Constraint Satisfaction
5: Blue-Noise Dithered QMC Hierarchical Russian Roulette
6: The Operational Cost of Ethereum Airdrops
7: Distributed Dense Subgraph Detection and Low Outdegree Orientation
8: Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
9: Classical and Quantum Algorithms for Tensor Principal Component Analysis
10: Deterministic coloring algorithms in the LOCAL model
11: Iterative Budgeted Exponential Search
12: Sample Complexity Bounds for Influence Maximization
13: Evolutionary Dataset Optimisation: learning algorithm quality through evolution