1: A Tree Structure For Dynamic Facility Location
2: Algorithms for Manipulating Sequential Allocation
3: Run-Length Encoding in a Finite Universe
4: Noisy Beeping Networks
5: A Primal Decomposition Algorithm for the Two-dimensional Bin Packing Problem
6: Explicit near-Ramanujan graphs of every degree
7: Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)
8: Exact solutions for geodesic distance on treelike models with some constraints
9: Improved Strong Spatial Mixing for Colorings on Trees
10: How to Morph a Tree on a Small Grid
11: Note on distributed certification of minimum spanning trees
12: The Computational Complexity of Fire Emblem Series and similar Tactical Role-Playing Games
13: Solving Strong-Substitutes Product-Mix Auctions
14: Multitype Integer Monoid Optimization and Applications
15: Regular Partitions and Their Use in Structural Pattern Recognition
16: Three-in-a-Tree in Near Linear Time
17: Streaming PTAS for Constrained k-Means
18: Multiplicative Rank-1 Approximation using Length-Squared Sampling
19: Generalized Dictionary Matching under Substring Consistent Equivalence Relations
20: Object Reachability via Swaps under Strict and Weak Preferences
21: Communication-Efficient Weighted Sampling and Quantile Summary for GBDT
22: A heuristic use of dynamic programming to upperbound treewidth
23: Multi-robot persistent surveillance with connectivity constraints
24: Preprocessing and Cutting Planes with Conflict Graphs
25: Trade-offs in dynamic coloring for bipartite and general graphs
26: Leyenda: An Adaptive, Hybrid Sorting Algorithm for Large Scale Data with Limited Memory
27: Deterministic algorithms for the Lovasz Local Lemma: simpler, more general, and more parallel
28: Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring
29: Hypergraph partitions
30: Message Reduction in the Local Model is a Free Lunch
31: When Maximum Stable Set can be solved in FPT time
32: Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA
33: Assignment and Pricing of Shared Rides in Ride-Sourcing using Combinatorial Double Auctions
34: How to Hire Secretaries with Stochastic Departures
35: DAOC: Stable Clustering of Large Networks
36: Hardness and approximation for the geodetic set problem in some graph classes
37: Locally optimal routes for route choice sets
38: Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut
39: Efficient sampling and counting algorithms for the Potts model on $\mathbb Z^d$ at all temperatures
40: Linear-Time Recognition of Double-Threshold Graphs
41: Manipulation Attacks in Local Differential Privacy
42: Spectral Lower Bounds on the I/O Complexity of Computation Graphs