1: Beyond Log-concavity: Provable Guarantees for Sampling Multi-modal Distributions using Simulated Tempering Langevin Monte Carlo
2: Beyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization
3: Response to “Counterexample to global convergence of DSOS and SDSOS hierarchies”
4: On Variants of Network Flow Stability
5: The complexity of general-valued CSPs seen from the other side
6: Fast Flow Volume Estimation
7: Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
8: Balanced power diagrams for redistricting
9: Efficient Dynamic Dictionary Matching with DAWGs and AC-automata
10: Combinatorial and Asymptotical Results on the Neighborhood Grid
11: Top-k Route Search through Submodularity Modeling of Recurrent POI Features
12: Using modular decomposition technique to solve the maximum clique problem
13: Stream Graphs and Link Streams for the Modeling of Interactions over Time
14: Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM
15: The Provable Virtue of Laziness in Motion Planning
16: Maximum Margin Interval Trees
17: On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
18: Pure Operation-Based Replicated Data Types
19: The Trees of Hanoi
20: Balancing expression dags for more efficient lazy adaptive evaluation
21: Hard and Easy Instances of L-Tromino Tilings
22: Structured Robust Submodular Maximization: Offline and Online Algorithms
23: High Dimensional Cluster Analysis Using Path Lengths
24: The power of sum-of-squares for detecting hidden structures