1: New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
2: Online Coloring and a New Type of Adversary for Online Graph Problems
3: Succinct Trit-array Trie for Scalable Trajectory Similarity Search
4: Target Location Problem for Multi-commodity Flow
5: Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams
6: Still Simpler Static Level Ancestors
7: A Dynamic Tree Algorithm for On-demand Peer-to-peer Ride-sharing Matching
8: More on zeros and approximation of the Ising partition function
9: Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-grained Perspective into Boolean Constraint Satisfaction
10: Routing Oblivious Measurement Analytics
11: DartMinHash: Fast Sketching for Weighted Sets
12: Optimized Quantum Circuit Partitioning
13: A Note on the Concrete Hardness of the Shortest Independent Vectors Problem in Lattices
14: Efficient Intervention Design for Causal Discovery with Latents
15: Proper Learning, Helly Number, and an Optimal SVM Bound
16: Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP
17: On the Problem of $p_1^{-1}$ in Locality-Sensitive Hashing
18: Improved Formulations and Branch-and-cut Algorithms for the Angular Constrained Minimum Spanning Tree Problem
19: On Optimal Partitioning For Sparse Matrices In Variable Block Row Format
20: On the improvement of the in-place merge algorithm parallelization
21: Approximation Schemes for ReLU Regression
22: Compaction for two models of logarithmic-depth trees: Analysis and Experiments
23: Distributed algorithms for covering, packing and maximum weighted matching
24: On motifs in colored graphs
25: Algorithmic approaches to selecting control clones in DNA array hybridization experiments
26: Better and Simpler Learning-Augmented Online Caching
27: A Practical Index Structure Supporting Fr'echet Proximity Queries Among Trajectories
28: Liar’s Domination in Unit Disk Graphs
29: Computing Subset Transversals in $H$-Free Graphs
30: Dimension-Free Bounds on Chasing Convex Functions
31: Two-Bar Charts Packing Problem