1: A Note on Dynamic Bidirected Dyck-Reachability with Cycles
2: Receiver-Oriented Cheap Talk Design
3: The Robust Bilevel Selection Problem
4: Optimal Survival Trees: A Dynamic Programming Approach
5: Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved
6: Multi-Neuron Representations of Hierarchical Concepts in Spiking Neural Networks
7: Bin Packing under Random-Order: Breaking the Barrier of 3/2
8: Weighted degrees and truncated derived bibliographic networks
9: Parameterized Algorithms for Minimum Sum Vertex Cover
10: Diversity-aware clustering: Computational Complexity and Approximation Algorithms
11: On the existence of funneled orientations for classes of rooted phylogenetic networks
12: Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
13: Faster Multi-Source Directed Reachability via Shortcuts and Matrix Multiplication
14: On the on-line coloring of unit interval graphs with proper interval representation
15: Recoverable robust shortest path problem under interval budgeted uncertainty representations
16: Modeling Online Paging in Multi-Core Systems
17: Graph Reconstruction via MIS Queries
18: A k-swap Local Search for Makespan Scheduling
19: Computing Data Distribution from Query Selectivities
20: Holey graphs: very large Betti numbers are testable
21: Quantum eigenvalue processing
22: New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification
23: Characterizing the integer points in 2-decomposable polyhedra by closedness under operations
24: An Optimal Randomized Algorithm for Finding the Saddlepoint
25: Are We Still Missing an Item?
26: FPT Approximation for Capacitated Sum of Radii
27: Online Matroid Intersection: Submodular Water-Filling and Matroidal Welfare Maximization
28: Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints
29: Testing Sumsets is Hard