1: (Learned) Frequency Estimation Algorithms under Zipfian Distribution
2: “LOADS of Space”: Local Order Agnosticism and Bit Flip Efficient Data Structure Codes
3: Tracking Paths in Planar Graphs
4: Resolvable Designs for Speeding up Distributed Computing
5: Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization
6: Homotopy height, grid-major height and graph-drawing height
7: Distributed Edge Partitioning for Trillion-edge Graphs
8: Efficient Online String Matching Based on Characters Distance Text Sampling
9: Low-rank approximation in the Frobenius norm by column and row subset selection
10: Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint
11: A Sharp Threshold Phenomenon for the Distributed Complexity of the Lov'asz Local Lemma
12: The stable set problem in graphs with bounded genus and bounded odd cycle packing number
13: Discrete and Fast Fourier Transform Made Clear
14: Visualization of Very Large High-Dimensional Data Sets as Minimum Spanning Trees
15: Comparison-Based Indexing From First Principles
16: Revisiting the Graph Isomorphism Problem with Semidefinite Programming
17: The Maximum Common Subgraph Problem: A Portfolio Approach
18: The smallest grammar problem revisited
19: A New k-Shortest Path Search Approach based on Graph Reduction
20: The Runtime of the Compact Genetic Algorithm on Jump Functions
21: The Landscape of Minimum Label Cut (Hedge Connectivity) Problem
22: A Computational Model for Tensor Core Units
23: Quantum Expectation-Maximization for Gaussian Mixture Models
24: Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators
25: Quantum algorithms for Second-Order Cone Programming and Support Vector Machines
26: On bin packing with clustering and bin packing with delays
27: WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track
28: A New Fast Weighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees
29: A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees
30: An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences
31: A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
32: Improved Job sequencing Bounds from Decision Diagrams
33: Computing Stable Demers Cartograms
34: Evacuation of equilateral triangles by mobile agents of limited communication range
35: An algorithm for destroying claws and diamonds
36: A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips
37: Planar p-center problems are solvable in polynomial time when clustering a Pareto Front
38: PPT: New Low Complexity Deterministic Primality Tests Leveraging Explicit and Implicit Non-Residues. A Set of Three Companion Manuscripts
39: Optimization Bounds from the Branching Dual
40: A Quality Metric for Visualization of Clusters in Graphs