1: A local search $4/3$-approximation algorithm for the minimum $3$-path partition problem
2: Fast post-hoc method for updating moments of large datasets
3: Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
4: Functional Aggregate Queries with Additive Inequalities
5: Uncovering Urban Mobility and City Dynamics from Large-Scale Taxi Origin-Destination (O-D) Trips: Case Study in Washington DC Area
6: AnchorHash: A Scalable Consistent Hash
7: The Online Event-Detection Problem
8: Generalization Bounds for Uniformly Stable Algorithms
9: Approximating activation edge-cover and facility location problems
10: Sherali–Adams Strikes Back
11: On approximate data reduction for the Rural Postman Problem: Theory and experiments
12: Two algorithms for the package-exchange robot-routing problem
13: Efficiently list-edge coloring multigraphs asymptotically optimally
14: Implementation of Simplex Channels in the Blom’s Keys Pre-Distribution Scheme
15: Applying Predicate Detection to the Constrained Optimization Problems
16: Removing Sequential Bottleneck of Dijkstra’s Algorithm for the Shortest Path Problem
17: The Prophet Inequality Can Be Solved Optimally with a Single Set of Samples
18: Hierarchical Clustering for Euclidean Data
19: Complexity of Reconfiguration Problems for Constraint Satisfaction
20: Complex Semidefinite Programming and Max-k-Cut
21: Quantum Adiabatic Algorithm Design using Reinforcement Learning
22: Above guarantee parameterization for vertex cover on graphs with maximum degree 4
23: On the Approximability of Time Disjoint Walks
24: Fair Coresets and Streaming Algorithms for Fair k-Means Clustering
25: Fast Breadth-First Search in Still Less Space
26: A Grammar-based Compressed Representation of 3D Trajectories
27: Compact and Efficient Representation of General Graph Databases
28: Sequential algorithms and the computational content of classical proofs
29: Tight Bounds on the Minimum Size of a Dynamic Monopoly