1: On Multiway Cut parameterized above lower bounds
2: A Proof of the Boyd-Carr Conjecture
3: On the Integrality Gap of the Subtour LP for the 1,2-TSP
4: Distinct counting with a self-learning bitmap
5: Hamiltonian Paths in Two Classes of Grid Graphs
6: Linear Index Coding via Semidefinite Programming
7: Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs
8: An Approximation Algorithm for #k-SAT
9: A note on the generalized min-sum set cover problem
10: Speed Scaling on Parallel Processors with Migration
11: The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems
12: Bidimensionality and Geometric Graphs
13: Partial match queries in random quadtrees
14: iBGP and Constrained Connectivity
15: Computing the Distance between Piecewise-Linear Bivariate Functions
16: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs
17: Data Stability in Clustering: A Closer Look
18: A Linear Time Algorithm for Seeds Computation
19: On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances
20: Maximum Matchings via Glauber Dynamics
21: Matching Pursuits with Random Sequential Subdictionaries
22: Routing in Undirected Graphs with Constant Congestion
23: A Higher-Order Cheeger’s Inequality
24: Learning $k$-Modal Distributions via Testing
25: Learning Poisson Binomial Distributions
26: On the Feasibility of Maintenance Algorithms in Dynamic Graphs
27: Restructuring Compressed Texts without Explicit Decompression