1: Finding $k$ Simple Shortest Paths and Cycles
2: Faster Information Gathering in Ad-Hoc Radio Tree Networks
3: Approximation-Friendly Discrepancy Rounding
4: Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
5: Vertex-Coloring with Star-Defects
6: A randomized polynomial kernel for Subset Feedback Vertex Set
7: Bigger Buffer k-d Trees on Multi-Many-Core Systems
8: Breaking the log n barrier on rumor spreading
9: Maximum Scatter TSP in Doubling Metrics
10: On Variants of k-means Clustering
11: Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem
12: New Deterministic Algorithms for Solving Parity Games
13: Toward more localized local algorithms: removing assumptions concerning global knowledge
14: ClusPath: A Temporal-driven Clustering to Infer Typical Evolution Paths
15: A Fast Heuristic for Exact String Matching
16: Constructive noncommutative rank computation is in deterministic polynomial time
17: Fast Generation of Spatially Embedded Random Networks
18: Hardness Results for Signaling in Bayesian Zero-Sum and Network Routing Games
19: Graph Isomorphism in Quasipolynomial Time
20: Computing Affine Combinations, Distances, and Correlations for Recursive Partition Functions
21: Finding HeavyPaths in Weighted Graphs and a Case-Study on Community Detection
22: Parameterizing edge modification problems above lower bounds
23: Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One
24: Embedding approximately low-dimensional $\ell_2^2$ metrics into $\ell_1$
25: Hypergraph Two-Coloring in the Streaming Model
26: Parameterized Algorithms on Perfect Graphs for deletion to $(r,\ell)$-graphs
27: Kinetic Clustering of Points on the Line