1: Evo(star) 2020 – Late-Breaking Abstracts Volume
2: Efficient Distributed Algorithms for the $K$-Nearest Neighbors Problem
3: Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees
4: Efficiently Learning Adversarially Robust Halfspaces with Noise
5: Edit Distance in Near-Linear Time: it’s a Constant Factor
6: Tight Analysis of Asynchronous Rumor Spreading in Dynamic Networks
7: Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
8: A Linear Time Algorithm for Computing the Eternal Vertex Cover Number of Cactus Graphs
9: Robust Algorithms for TSP and Steiner Tree
10: On the (Parameterized) Complexity of Almost Stable Marriage
11: Towards Efficient Interactive Computation of Dynamic Time Warping Distance
12: Weighted Adaptive Coding
13: A Practical Algorithm for the Computation of the Genus
14: Matching in Stochastically Evolving Graphs
15: Quantum string comparison method
16: Potential gain as a centrality measure
17: Optimal Bounds for the $k$-cut Problem
18: On Efficient Connectivity-Preserving Transformations in a Grid
19: The Online Multi-Commodity Facility Location Problem
20: Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures
21: Semi-online Scheduling: A Survey
22: How to generate random lambda terms?
23: Approximation Algorithms and Hardness for Strong Unique Games
24: Lasso formulation of the shortest path problem
25: A faster reduction of the dynamic time warping distance to the longest increasing subsequence length
26: Multiple Source Replacement Path Problem
27: Linear Time Construction of Indexable Founder Block Graphs
28: On repetitiveness measures of Thue-Morse words
29: Faster Deterministic All Pairs Shortest Paths in Congest Model
30: Continuous LWE
31: Asymmetric scale functions for $t$-digests
32: Scheduling Flows on a Switch to Optimize Response Times
33: List Decodable Mean Estimation in Nearly Linear Time
34: When is Approximate Counting for Conjunctive Queries Tractable?
35: The K-Centre Problem for Necklaces
36: Sparse Tensor Transpositions
37: A Massively Parallel Algorithm for Minimum Weight Vertex Cover
38: Combinatorial two-stage minmax regret problems under interval uncertainty