1: Spanning Tree Congestion and Computation of Generalized Gy\H{o}ri-Lov'{a}sz Partition
2: MIS in the Congested Clique Model in $O(\log \log \Delta)$ Rounds
3: Multiscale finite elements through advection-induced coordinates for transient advection-diffusion equations
4: Efficient Enumeration of Dominating Sets for Sparse Graphs
5: Faster integer multiplication using short lattice vectors
6: The Clever Shopper Problem
7: Near Isometric Terminal Embeddings for Doubling Metrics
8: Finding Top-k Optimal Sequenced Routes – Full Version
9: The iisignature library: efficient calculation of iterated-integral signatures and log signatures
10: Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity
11: Quantum linear systems algorithms: a primer
12: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
13: Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
14: Approximation Algorithms for D-optimal Design
15: Graph Similarity and Approximate Isomorphism
16: Fast and Sample Near-Optimal Algorithms for Learning Multidimensional Histograms
17: The Parameterized Hardness of the k-Center Problem in Transportation Networks
18: On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games
19: Network Models for Multiobjective Discrete Optimization
20: Homomorphism Extension
21: Synchronization Strings: List Decoding for Insertions and Deletions
22: A Quantum-Search-Aided Dynamic Programming Framework for Pareto Optimal Routing in Wireless Multihop Networks
23: Lov'asz Meets Weisfeiler and Leman
24: Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo
25: On the Broadcast Routing Problem in Computer Networks
26: The Complexity of the Possible Winner Problem over Partitioned Preferences
27: Evaluating and Tuning n-fold Integer Programming
28: A New Algorithm for Finding Closest Pair of Vectors
29: Submodularity on Hypergraphs: From Sets to Sequences
30: Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs
31: Multi-Commodity Flow with In-Network Processing
32: Solving $k$-center Clustering (with Outliers) in MapReduce and Streaming, almost as Accurately as Sequentially
33: Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization
34: In-database connected component analysis
35: Online Coloring of Short Intervals
36: Representations of Sparse Distributed Networks: A Locality-Sensitive Approach
37: Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels
38: Aggregative Coarsening for Multilevel Hypergraph Partitioning
39: Multiscale Planar Graph Generation
40: On tradeoffs between width- and fill-like graph parameters
41: Polynomial Treedepth Bounds in Linear Colorings
42: Fully Dynamic Maximal Independent Set with Sublinear Update Time
43: Generalized Binary Search For Split-Neighborly Problems
44: A unified framework for designing EPTAS’s for load balancing on parallel machines
45: Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials
46: Parameterized Complexity of Diameter
47: Incremental Strong Connectivity and 2-Connectivity in Directed Graphs
48: Local Distributed Algorithms in Highly Dynamic Networks
49: Online Non-preemptive Scheduling on Unrelated Machines with Rejections
50: Decompressing Lempel-Ziv Compressed Text
51: Efficient Black-Box Reductions for Separable Cost Sharing
52: Parameterized Aspects of Strong Subgraph Closure
53: Survivable Network Design for Group Connectivity in Low-Treewidth Graphs