1: Bandgap optimization in combinatorial graphs with tailored ground states: Application in Quantum annealing
2: Random walks and forbidden minors III: poly(d/{\epsilon})-time partition oracles for minor-free graph classes
3: Quantum Inspired Adaptive Boosting
4: Jiffy: A Lock-free Skip List with Batch Updates and Snapshots
5: Role Coloring Bipartite Graphs
6: A Tight Bound for Stochastic Submodular Cover
7: Fair Dynamic Rationing
8: Multilevel Hypergraph Partitioning with Vertex Weights Revisited
9: Targeted Branching for the Maximum Independent Set Problem
10: Tree trace reconstruction using subtraces
11: Symmetric Sparse Boolean Matrix Factorization and Applications
12: Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games
13: On Greedy Approaches to Hierarchical Aggregation
14: Outlier-Robust Learning of Ising Models Under Dobrushin’s Condition
15: CountSketches, Feature Hashing and the Median of Three
16: Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergence
17: Online Sketch-based Query Optimization
18: Introducing lop-kernels: a framework for kernelization lower bounds
19: Gapped Indexing for Consecutive Occurrences
20: A Faster Algorithm for Finding Closest Pairs in Hamming Metric
21: Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More
22: Online Discrepancy Minimization via Persistent Self-Balancing Walks
23: Optimal Construction of Hierarchical Overlap Graphs
24: Cutoff stability under distributional constraints with an application to summer internship matching
25: The Critical Mean-field Chayes-Machta Dynamics
26: Twin-width IV: ordered graphs and matrices
27: Reconstructing Arbitrary Trees from Traces in the Tree Edit Distance Model
28: Minimum projective linearizations of trees in linear time
29: A $2$-Approximation Algorithm for Flexible Graph Connectivity
30: Online Bin Packing with Predictions
31: Parameterized complexity of computing maximum minimal blocking and hitting sets
32: Exploring the Subgraph Density-Size Trade-off via the Lov'asz Extension
33: Parameterized Complexity of Immunization in the Threshold Model
34: Streaming k-PCA: Efficient guarantees for Oja’s algorithm, beyond rank-one updates