1: DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
2: Impact of Detour-Aware Policies on Maximizing Profit in Ridesharing
3: Linear Hashing is Awesome
4: On-line Assembling Mitochondrial DNA from de novo transcriptome
5: CiNCT: Compression and retrieval for massive vehicular trajectories via relative movement labeling
6: An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
7: Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
8: Towards balanced clustering - part 1 (preliminaries)
9: Constant Query Time $(1 + \epsilon)$-Approximate Distance Oracle for Planar Graphs
10: Recovery Guarantees for One-hidden-layer Neural Networks
11: Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
12: Upper Bounds on Number of Steals in Rooted Trees
13: Collect at Once, Use Effectively: Making Non-interactive Locally Private Learning Possible
14: Conformal k-NN Anomaly Detector for Univariate Data Streams
15: Improved Methods for Computing Distances between Unordered Trees Using Integer Programming
16: Monitoring of Domain-Related Problems in Distributed Data Streams
17: Streaming Non-monotone Submodular Maximization: Personalized Video Summarization on the Fly
18: Clustering Small Samples with Quality Guarantees: Adaptivity with One2all pps
19: Designing Deterministic Polynomial-Space Algorithms by Color-Coding Multivariate Polynomials
20: Clustering High Dimensional Dynamic Data Streams
21: Optimization over Degree Sequences
22: Deleting vertices to graphs of bounded genus
23: Distributed Submodular Maximization with Limited Information
24: Provable Alternating Gradient Descent for Non-negative Matrix Factorization with Strong Correlations
25: The Power of Choice in Priority Scheduling
26: Inner Rank and Lower Bounds for Matrix Multiplication
27: Structured Connectivity Augmentation
28: Recommending links through influence maximization