1: Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths
2: Finding forbidden minors in sublinear time: a $n^{1/2+o(1)}$-query one-sided tester for minor closed properties on bounded degree graphs
3: Algorithmic and algebraic aspects of unshuffling permutations
4: Colouring Square-Free Graphs without Long Induced Paths
5: The limit shape of convex hull peeling
6: Bandit-Based Monte Carlo Optimization for Nearest Neighbors
7: Improved Algorithms for Collaborative PAC Learning
8: QBF as an Alternative to Courcelle’s Theorem
9: Fully Understanding the Hashing Trick
10: More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture
11: On Coresets for Logistic Regression
12: On the Worst-Case Complexity of TimSort
13: Online shortest paths with confidence intervals for routing in a time varying random network
14: copMEM: Finding maximal exact matches via sampling both genomes
15: Maximal and maximum transitive relation contained in a given binary relation
16: GraphChallenge.org: Raising the Bar on Graph Analytic Performance
17: Tight Bounds for Collaborative PAC Learning via Multiplicative Weights
18: Optimal Hashing in External Memory
19: Incomplete Nested Dissection
20: Hierarchical Clustering with Structural Constraints
21: Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
22: A Practical Algorithm for Distributed Clustering and Outlier Detection
23: Non-Preemptive Flow-Time Minimization via Rejections
24: Learning and Testing Causal Models with Interventions
25: Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
26: Super-stability in the Student-Project Allocation Problem with Ties
27: Longest Unbordered Factor in Quasilinear Time
28: Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary
29: Algorithms for Anti-Powers in Strings
30: Strong link between BWT and XBW via Aho-Corasick automaton and applications to Run-Length Encoding
31: ChASE: Chebyshev Accelerated Subspace iteration Eigensolver for sequences of Hermitian eigenvalue problems
32: Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming
33: Learning Restricted Boltzmann Machines via Influence Maximization
34: Robust Nonparametric Regression under Huber’s $\epsilon$-contamination Model
35: Distributed Treewidth Computation
36: A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
37: High Probability Frequency Moment Sketches
38: Evolutionary Algorithms and Submodular Functions: Benefits of Heavy-Tailed Mutations
39: Fast Random Integer Generation in an Interval
40: Opinion Forming in Erdos-Renyi Random Graph and Expanders