1: Smoothed Analysis of Pareto Curves in Multiobjective Optimization
2: On Adaptive Distance Estimation
3: Query strategies for priced information, revisited
4: Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time
5: Vertex deletion into bipartite permutation graphs
6: Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms
7: Optimal Approximation – Smoothness Tradeoffs for Soft-Max Functions
8: An Investigation of the Recoverable Robust Assignment Problem
9: Linear-Delay Enumeration for Minimal Steiner Problems
10: Cluster-and-Conquer: When Randomness Meets Graph Locality
11: From trees to barcodes and back again: theoretical and statistical perspectives
12: Learning Augmented Energy Minimization via Speed Scaling
13: The Primal-Dual method for Learning Augmented Algorithms
14: Fast Approximate CoSimRanks via Random Projections
15: The Polynomial Method is Universal for Distribution-Free Correlational SQ Learning
16: A novel auction system for selecting advertisements in Real-Time bidding
17: Computationally and Statistically Efficient Truncated Regression
18: Quantum Meets Fine-grained Complexity: Sublinear Time Quantum Algorithms for String Problems
19: Quickly excluding a non-planar graph
20: Low-rank on Graphs plus Temporally Smooth Sparse Decomposition for Anomaly Detection in Spatiotemporal Data
21: Differentially Private Online Submodular Maximization
22: Heterogeneous Graphlets
23: Correlation Robust Influence Maximization
24: On Testing of Samplers
25: A Novel Move-To-Front-or-Logarithmic Position (MFLP) Online List Update Algorithm
26: Differentially Private Weighted Sampling
27: Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming!
28: An Improved Sketching Algorithm for Edit Distance
29: On Updating and Querying Submatrices
30: Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
31: Competitive Analysis of Move-to-Front-or-Middle (MFM) Online List Update Algorithm
32: Expressive power of linear algebra query languages
33: Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms
34: KFC: A Scalable Approximation Algorithm for $k$-center Fair Clustering
35: Jiffy: A Fast, Memory Efficient, Wait-Free Multi-Producers Single-Consumer Queue
36: On Minimum Generalized Manhattan Connections
37: Simultaenous Sieves: A Deterministic Streaming Algorithm for Non-Monotone Submodular Maximization
38: Dynamic Boundary Time Warping for Sub-sequence Matching with Few Examples
39: Improved Guarantees for k-means++ and k-means++ Parallel
40: Improved Algorithms for Edge Colouring in the W-Streaming Model
41: Faster Differentially Private Samplers via R'enyi Divergence Analysis of Discretized Langevin MCMC
42: Substream-Centric Maximum Matchings on FPGA
43: Sample-Optimal and Efficient Learning of Tree Ising models
44: Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs
45: Computing Crisp Bisimulations for Fuzzy Structures