1: A linear bound on the number of states in optimal convex characters for maximum parsimony distance
2: Approximate Hypergraph Coloring under Low-discrepancy and Related Promises
3: Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
4: Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs
5: Randomized Composable Core-sets for Distributed Submodular Maximization
6: Spectral Thresholds in the Bipartite Stochastic Block Model
7: Enhanced Covers of Regular & Indeterminate Strings using Prefix Tables
8: Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array
9: Fully Dynamic Matching in Bipartite Graphs
10: $1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses
11: Polyhedral aspects of Submodularity, Convexity and Concavity
12: Chaining fragments in sequences: to sweep or not
13: Discrete Gaussian Sampling Reduces to CVP and SVP
14: Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization
15: Towards Resistance Sparsifiers
16: Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples
17: A structural approach to kernels for ILPs: Treewidth and Total Unimodularity
18: Maximum weighted independent sets with a budget
19: An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
20: Canonizing Graphs of Bounded Tree Width in Logspace
21: Stateless Geocasting
22: Efficient computation of middle levels Gray codes
23: General Caching Is Hard: Even with Small Pages
24: A geometric alternative to Nesterov’s accelerated gradient descent
25: Correlation Clustering and Biclustering with Locally Bounded Errors
26: Sparsified Cholesky Solvers for SDD linear systems
27: Greedy Is an Almost Optimal Deque
28: A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs