1: When can Graph Hyperbolicity be computed in Linear Time?
2: Parameterized Aspects of Triangle Enumeration
3: Double Threshold Digraphs
4: Compact linear programs for 2SAT
5: A Simple Convex Layers Algorithm
6: Parameterized Shifted Combinatorial Optimization
7: Approximating Unique Games Using Low Diameter Graph Decomposition
8: Deterministic & Adaptive Non-Submodular Maximization via the Primal Curvature
9: On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer
10: Diverse Weighted Bipartite b-Matching
11: Tight Bounds for Online Coloring of Basic Graph Classes
12: Network Construction with Ordered Constraints
13: Making Asynchronous Distributed Computations Robust to Noise
14: Capacitated Center Problems with Two-Sided Bounds and Outliers
15: Small-space encoding LCE data structure with constant-time queries
16: Compression with the tudocomp Framework
17: Simple, Fast and Lightweight Parallel Wavelet Tree Construction
18: Truthful Mechanisms for Delivery with Mobile Agents
19: On problems equivalent to (min,+)-convolution
20: An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration
21: Computationally Efficient Robust Estimation of Sparse Functionals
22: Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
23: Constructing Adjacency Arrays from Incidence Arrays
24: An Efficient Multiway Mergesort for GPU Architectures
25: Elementary Yet Precise Worst-case Analysis of MergeSort, A short version (SV)
26: Approximation Strategies for Generalized Binary Search in Weighted Trees
27: On the Expected Value of the Determinant of Random Sum of Rank-One Matrices
28: Scalable k-Means Clustering via Lightweight Coresets
29: Independent Set Size Approximation in Graph Streams
30: An SDP-Based Algorithm for Linear-Sized Spectral Sparsification
31: The Infinite Server Problem
32: SGD Learns the Conjugate Kernel Class of the Network
33: Synergistic Computation of Planar Maxima and Convex Hull
34: Billion-scale similarity search with GPUs
35: Robust Budget Allocation via Continuous Submodular Functions