1: Exploring Hierarchies in Online Social Networks
2: Solving $k$-means on High-dimensional Big Data
3: The Unimodular Intersection Problem
4: Spread of Influence in Weighted Networks under Time and Budget Constraints
5: Sample Complexity for Winner Prediction in Elections
6: Maximal Independent Sets in Generalised Caterpillar Graphs
7: Smaller Selection Networks for Cardinality Constraints Encoding
8: A $(1 + {\varepsilon})$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
9: Structural Properties of an Open Problem in Preemptive Scheduling
10: Compressed Tree Canonization
11: The Takeoff Towards Optimal Sorting Networks
12: Reconfiguration on sparse graphs
13: Count-Min-Log sketch: Approximately counting with approximate counters
14: Exact bounds for distributed graph colouring
15: A New Sampling Technique for Tensors
16: Clustered Integer 3SUM via Additive Combinatorics
17: Hierarchical Time-Dependent Oracles
18: The Price of Local Power Control in Wireless Scheduling
19: Dynamic subtrees queries revisited: the Depth First Tour Tree
20: Simple Recognition of Halin Graphs and Their Generalizations
21: On learning k-parities with and without noise
22: Lower Bounds for the Graph Homomorphism Problem
23: Quantum mixing of Markov chains for special distributions
24: Prioritized Metric Structures and Embedding
25: Time and space optimality of rotor-router graph exploration
26: NP-Hardness and Inapproximability of Sparse PCA
27: Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence
28: Binary Embedding: Fundamental Limits and Fast Algorithm
29: Time-Approximation Trade-offs for Inapproximable Problems
30: Fixed-parameter Tractable Distances to Sparse Graph Classes
31: Composite repetition-aware data structures
32: Sorting Networks: The Final Countdown
33: Multi-level Loop-less Algorithm for Multi-set Permutations
34: Finding Pairwise Intersections Inside a Query Range