1: On Approximating Maximum Independent Set of Rectangles
2: Identification of repeats in DNA sequences using nucleotide distribution uniformity
3: From Weak to Strong LP Gaps for all CSPs
4: Hardness of Permutation Pattern Matching
5: Theory of the GMM Kernel
6: On the Complexity of Constrained Determinantal Point Processes
7: Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions
8: Green Data Centers: A Survey, Perspectives, and Future Directions
9: On the Power of Simple Reductions for the Maximum Independent Set Problem
10: Infinite Unlimited Churn
11: Sparse Suffix Tree Construction in Optimal Time and Space
12: Meraculous2: fast accurate short-read assembly of large polymorphic genomes
13: Fast and Lean Immutable Multi-Maps on the JVM based on Heterogeneous Hash-Array Mapped Tries
14: Testing Sparsity over Known and Unknown Bases
15: Consistent Hashing with Bounded Loads
16: Quasimetric embeddings and their applications
17: Solving Laplacian Systems in Logarithmic Space
18: Linear-time Kernelization for Feedback Vertex Set
19: Streaming Weighted Matchings: Optimal Meets Greedy
20: Robust Shortest Path Planning and Semicontractive Dynamic Programming
21: Separators in region intersection graphs
22: Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
23: Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
24: A Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem
25: Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center