1: The Fine-Grained Complexity of Computing the Tutte Polynomial of a Linear Matroid
2: Clustering powers of sparse graphs
3: Complexity of Planning
4: Multiset Synchronization with Counting Cuckoo Filters
5: The Fast Loaded Dice Roller: A Near-Optimal Exact Sampler for Discrete Probability Distributions
6: COPT: Coordinated Optimal Transport for Graph Sketching
7: Adaptive Fibonacci and Pairing Heaps
8: Smoothed Analysis of Trie Height by Star-like PFAs
9: b-Coloring Parameterized by Clique-Width
10: Adjacency Labelling for Planar Graphs (and Beyond)
11: Optimal-size problem kernels for $d$-Hitting Set in linear time and space
12: Maximizing Happiness in Graphs of Bounded Clique-Width
13: Circuit Design for Clique Problem and Its Implementation on Quantum Computer
14: Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
15: Moving Target Monte Carlo
16: Flip-sort and combinatorial aspects of pop-stack sorting
17: IoT Expunge: Implementing Verifiable Retention of IoT Data
18: Tensorized Random Projections
19: On Degree Sequence Optimization
20: Online Graph Matching Problems with a Worst-Case Reassignment Budget
21: Induced subgraphs of bounded treewidth and the container method
22: Scheduling.jl – Collaborative and Reproducible Scheduling Research with Julia
23: Hitting Long Directed Cycles is Fixed-Parameter Tractable
24: Balanced Independent and Dominating Sets on Colored Interval Graphs
25: $\lambda_\infty$ & Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric
26: On Hop-Constrained Steiner Trees in Tree-Like Metrics
27: Algorithms in Linear Algebraic Groups
28: Joint Alignment From Pairwise Differences with a Noisy Oracle
29: Approximation Schemes for Subset Sum Ratio Problems
30: Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver