1: Optimal Differential Privacy Composition for Exponential Mechanisms and the Cost of Adaptivity
2: A relaxation of the Directed Disjoint Paths problem: a global congestion metric helps
3: Automated Generation of Dimensioned Rectangular Floorplans
4: On the Complexity of Approximating Multimarginal Optimal Transport
5: An improved analysis and unified perspective on deterministic and randomized low rank matrix approximations
6: Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions
7: The Minimization of Random Hypergraphs
8: Incorporating Trip Chaining within Online Demand Estimation
9: The Complexity of Packing Edge-Disjoint Paths
10: On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets
11: Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory
12: Joint Subcarrier and Power Allocation in NOMA: Optimal and Approximate Algorithms
13: An Efficient Sampling Algorithm for Non-smooth Composite Potentials
14: Retrieving Top Weighted Triangles in Graphs
15: Spherical k-Nearest Neighbors Interpolation
16: Approximating the Geometric Edit Distance
17: Streaming Balanced Clustering
18: On the Hardness of Set Disjointness and Set Intersection with Bounded Universe
19: Advice Complexity of Adaptive Priority Algorithms
20: Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width
21: Sublinear Algorithms for Gap Edit Distance
22: Lower Bounds for QBFs of Bounded Treewidth
23: Computing the largest bond of a graph
24: Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization
25: Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
26: Path and Ancestor Queries on Trees with Multidimensional Weight Vectors
27: A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT
28: Best-first Search Algorithm for Non-convex Sparse Minimization
29: Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$
30: Privately detecting changes in unknown distributions
31: FPT Inapproximability of Directed Cut and Connectivity Problems
32: Cost-aware Targeted Viral Marketing: Approximation with Less Samples
33: Extensions of the Algorithmic Lovasz Local Lemma
34: Finding monotone patterns in sublinear time
35: Width Parameterizations for Knot-free Vertex Deletion on Digraphs
36: Efficient Symmetric Norm Regression via Linear Sketching
37: The Dichotomy of Evaluating Homomorphism-Closed Queries on Probabilistic Graphs
38: C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width
39: Fully Dynamic $(\Delta+1)$-Coloring in Constant Update Time
40: Maximum Matchings in Geometric Intersection Graphs
41: Towards a Definitive Compressibility Measure for Repetitive Sequences
42: Template-based Minor Embedding for Adiabatic Quantum Optimization
43: A new algorithm for graph center computation and graph partitioning according to the distance to the center
44: Clustering case statements for indirect branch predictors
45: Discovering Polarized Communities in Signed Networks
46: Span-core Decomposition for Temporal Networks: Algorithms and Applications
47: Fast Detection of Outliers in Data Streams with the $Q_n$ Estimator
48: Approximation algorithms for maximally balanced connected graph partition
49: Exact and/or Fast Nearest Neighbors
50: Understanding Zadimoghaddam’s Edge-weighted Online Matching Algorithm: Unweighted Case
51: BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property
52: RAMBO: Repeated And Merged BloOm Filter for Ultra-fast Multiple Set Membership Testing (MSMT) on Large-Scale Data
53: Finding Neighbors in a Forest: A b-tree for Smoothed Particle Hydrodynamics Simulations
54: Faster Minimum k-cut of a Simple Graph
55: Improved Bounds for Two Query Adaptive Bitprobe Schemes Storing Five Elements