1: Survey of Results on the ModPath and ModCycle Problems
2: Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
3: ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
4: Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation
5: Rapid GPU-Based Pangenome Graph Layout
6: A computational transition for detecting correlated stochastic block models by low-degree polynomials
7: Fitting trees to $\ell_1$-hyperbolic distances
8: The NTU Partitioned Matching Game for International Kidney Exchange Programs
9: Differentially Private Kernel Density Estimation
10: Weakly Leveled Planarity with Bounded Span
11: Quantum Algorithms for One-Sided Crossing Minimization
12: Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
13: Accelerating Graph Neural Networks with a Novel Matrix Compression Format
14: Optimal L-Systems for Stochastic L-system Inference Problems
15: Hadamard Row-Wise Generation Algorithm
16: An Effective Tag Assignment Approach for Billboard Advertisement
17: iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
18: V-Words, Lyndon Words and Galois Words
19: The Parameterized Complexity of Extending Stack Layouts
20: Key Compression Limits for $k$-Minimum Value Sketches
21: Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
22: Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
23: Minimizing Cost Rather Than Maximizing Reward in Restless Multi-Armed Bandits
24: An Efficient Algorithm for Group Testing with Runlength Constraints
25: Does Subset Sum Admit Short Proofs?
26: The Power of Second Chance: Personalized Submodular Maximization with Two Candidates
27: Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard
28: Fine-Grained Equivalence for Problems Related to Integer Linear Programming
29: Space-Efficient Algorithm for Integer Programming with Few Constraints
30: Predicting quantum channels over general product distributions
31: Constant congestion linkages in polynomially strong digraphs in polynomial time
32: Galled Perfect Transfer Networks
33: Random local access for sampling k-SAT solutions
34: A Hybrid Vectorized Merge Sort on ARM NEON
35: Hardness of sampling for the anti-ferromagnetic Ising model on random graphs
36: RCM++:Reverse Cuthill-McKee ordering with Bi-Criteria Node Finder
37: Improving the Parameter Dependency for High-Multiplicity Scheduling on Uniform Machines
38: FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares
39: Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers
40: Fast ($\sim N$) Diffusion Map Algorithm
41: On the Complexity of Neural Computation in Superposition
42: MATWA: A Web Toolkit for Matching under Preferences
43: Subexponential Parameterized Algorithms for Hitting Subgraphs
44: Adjacency Labeling Schemes for Small Classes