1: On improving the approximation ratio of the r-shortest common superstring problem
2: Spectrally Robust Graph Isomorphism
3: Generic Single Edge Fault Tolerant Exact Distance Oracle
4: Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows
5: Privately Learning High-Dimensional Distributions
6: Fast counting with tensor networks
7: Greedy Bipartite Matching in Random Type Poisson Arrival Model
8: The Story of HyperLogLog: How Flajolet Processed Streams with Coin Flips
9: Largest Weight Common Subtree Embeddings with Distance Penalties
10: Maximum cuts in edge-colored graphs
11: Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs
12: Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs
13: Found Graph Data and Planted Vertex Covers
14: How to Secure Matchings Against Edge Failures
15: Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
16: Scrambled Linear Pseudorandom Number Generators
17: Dynamic Structural Similarity on Graphs
18: Lower and Upper Bound for Computing the Size of All Second Neighbourhoods
19: Detecting Mutations by eBWT
20: DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
21: Beyond the Lovasz Local Lemma: Point to Set Correlations and Their Algorithmic Applications
22: Approximate Minimum Selection with Unreliable Comparisons in Optimal Expected Time
23: Wormhole: A Fast Ordered Index for In-memory Data Management
24: Distributed Monitoring of Election Winners
25: Generalized Center Problems with Outliers
26: Dynamic Monopolies in Reversible Bootstrap Percolation
27: On Facility Location with General Lower Bounds
28: (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs
29: Fine-grained Complexity Meets IP = PSPACE
30: Neighborhood inclusions for minimal dominating sets enumeration: linear and polynomial delay algorithms in $P_7$-free and $P_8$-free chordal graphs
31: $(\Delta+1)$ Coloring in the Congested Clique Model
32: The Online Best Reply Algorithm for Resource Allocation Problems
33: Online Connected Dominating Set Leasing
34: Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry