1: A $o(d) \cdot \text{polylog}~n$ Monotonicity Tester for Boolean Functions over the Hypergrid $[n]^d$
2: Almost Optimal Stochastic Weighted Matching With Few Queries
3: If it ain’t broke, don’t fix it: Sparse metric repair
4: Improved Bounds for Testing Forbidden Order Patterns
5: An algorithmic approach to handle circular trading in commercial taxing system
6: An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint
7: At the Roots of Dictionary Compression: String Attractors
8: Finding Connected Secluded Subgraphs
9: VLSI Computational Architectures for the Arithmetic Cosine Transform
10: Prophet Secretary for Combinatorial Auctions and Matroids
11: Reachability Preservers: New Extremal Bounds and Approximation Algorithms
12: Approximation Algorithms for $\ell_0$-Low Rank Approximation
13: The Exact Solution to Rank-1 L1-norm TUCKER2 Decomposition
14: Improved Bounds for Online Dominating Sets of Trees
15: Manipulation Strategies for the Rank Maximal Matching Problem
16: Designing RNA Secondary Structures is Hard