1: Differentially Private Continual Release of Graph Statistics
2: Parameterized algorithm for 3-path vertex cover
3: Complexity of MLDP
4: When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing
5: Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency
6: Torpid Mixing of Markov Chains for the Six-vertex Model on $\mathbb{Z}^2$
7: Fully-Functional Suffix Trees and Optimal Text Searching in BWT-runs Bounded Space
8: Multitasking Capacity: Hardness Results and Improved Constructions
9: Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension
10: On Solving Linear Systems in Sublinear Time
11: Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018)
12: Optimal Partition of a Tree with Social Distance
13: Massively Parallel Dynamic Programming on Trees
14: A new exact algorithm for solving single machine scheduling problems with learning effects and deteriorating jobs
15: Efficient Statistics, in High Dimensions, from Truncated Samples
16: Maximally Consistent Sampling and the Jaccard Index of Probability Distributions
17: Packing Sporadic Real-Time Tasks on Identical Multiprocessor Systems
18: Finding Cheeger Cuts in Hypergraphs via Heat Equation
19: Simplicity Creates Inequity: Implications for Fairness, Stereotypes, and Interpretability
20: The Paulsen Problem Made Simple
21: Robust Densest Subgraph Discovery
22: Graph powering and spectral robustness
23: Submodular Secretary Problem with Shortlists
24: Approximate Query Processing over Static Sets and Sliding Windows