1: Parameterized Algorithms for Conflict-free Colorings of Graphs
2: Bayesian estimation from few samples: community detection and related problems
3: A Lottery Model for Center-type Problems With Outliers
4: Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits
5: Orthogonal Vectors Indexing
6: Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
7: Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots
8: Finding the optimal nets for self-folding Kirigami
9: Online and Distributed Robust Regressions under Adversarial Data Corruption
10: Ordered Dags: HypercubeSort
11: Optimal Matroid Partitioning Problems
12: Maximum Matchings in Graphs for Allocating Kidney Paired Donation
13: Computing Top-k Closeness Centrality in Fully-dynamic Graphs
14: Scaling up Group Closeness Maximization
15: Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under $\ell_p$-Distances
16: An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
17: Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions
18: The Energy Complexity of Broadcast
19: Dismantling DivSufSort
20: Efficient Compression and Indexing of Trajectories
21: Max flow vitality in general and $st$-planar graphs
22: Memetic Multilevel Hypergraph Partitioning
23: Fast Sketch-based Recovery of Correlation Outliers
24: Skyline Computation with Noisy Comparisons
25: Fast Budgeted Influence Maximization over Multi-Action Event Logs
26: Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times
27: Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams
28: Efficient Generation of Geographically Accurate Transit Maps
29: Covering vectors by spaces: Regular matroids
30: Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning
31: The Paulsen Problem, Continuous Operator Scaling, and Smoothed Analysis
32: The Minimum Euclidean-Norm Point on a Convex Polytope: Wolfe’s Combinatorial Algorithm is Exponential
33: Implicit Decomposition for Write-Efficient Connectivity Algorithms
34: Unique Entity Estimation with Application to the Syrian Conflict