1: Finding Nearest Neighbors in graphs locally
2: Massively Parallel Benders Decomposition for Correlation Clustering
3: Strategy-Proof Approximation Algorithms for the Stable Marriage Problem with Ties and Incomplete Lists
4: A 2/3-Approximation Algorithm for Vertex-weighted Matching
5: Adaptive Sequence Submodularity
6: PT-ISABB: A Hybrid Tree-based Complete Algorithm to Solve Asymmetric Distributed Constraint Optimization Problems
7: Cost vs. Information Tradeoffs for Treasure Hunt in the Plane
8: Flip distances between graph orientations
9: Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time
10: Nearest neighbor decoding for Tardos fingerprinting codes
11: Prophet inequality for bipartite matching: merits of being simple and non adaptive
12: Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free
13: Beating Treewidth for Average-Case Subgraph Isomorphism
14: Improved Convergence for $\ell_\infty$ and $\ell_1$ Regression via Iteratively Reweighted Least Squares
15: Information-theoretic lower bounds for quantum sorting
16: Extending Upward Planar Graph Drawings
17: Sub-linear Memory Sketches for Near Neighbor Search on Streaming Data
18: SFCM-R: A novel algorithm for the hamiltonian sequence problem
19: A Quantum Interior-Point Predictor-Corrector Algorithm for Linear Programming
20: Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem
21: A sub-quadratic algorithm for the longest common increasing subsequence problem
22: Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals
23: On the dualization in distributive lattices and related problems
24: Travelling on Graphs with Small Highway Dimension
25: Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling
26: Computational Hardness of Certifying Bounds on Constrained PCA Problems
27: In oder Aus
28: Concurrent Distributed Serving with Mobile Servers
29: Load-Balancing for Parallel Delaunay Triangulations
30: On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
31: Fast, Small, and Simple Document Listing on Repetitive Text Collections
32: Towards Work-Efficient Parallel Parameterized Algorithms
33: Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications
34: Finding big matchings in planar graphs quickly
35: Stable and Fair Classification
36: The Markovian Price of Information
37: Locality
38: Fault Tolerant Gradient Clock Synchronization
39: With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing