1: Minimizing Localized Ratio Cut Objectives in Hypergraphs
2: Sequential Submodular Maximization and Applications to Ranking an Assortment of Products
3: Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs
4: Privately Learning Markov Random Fields
5: Private Mean Estimation of Heavy-Tailed Distributions
6: Locally Private Hypothesis Selection
7: Chronofold: a data structure for versioned text
8: Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond
9: Compression with wildcards: All spanning trees with prescribed vertex-degrees
10: Checking Phylogenetic Decisiveness in Theory and in Practice
11: Testing the Agreement of Trees with Internal Labels
12: Differentially Private Set Union
13: Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models
14: Sketching Transformed Matrices with Applications to Natural Language Processing
15: Mixed Integer Programming for Searching Maximum Quasi-Bicliques
16: Speeding up the AIFV-$2$ dynamic programs by two orders of magnitude using Range Minimum Queries
17: ORCSolver: An Efficient Solver for Adaptive GUI Layout with OR-Constraints
18: Structural Parameterizations with Modulator Oblivion
19: Computing Bi-Lipschitz Outlier Embeddings into the Line
20: Parallel Clique Counting and Peeling Algorithms
21: Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity
22: Learning Structured Distributions From Untrusted Batches: Faster and Simpler
23: Upper Tail Analysis of Bucket Sort and Random Tries
24: The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models
25: Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments
26: Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta
27: Routing in Unit Disk Graphs without Dynamic Headers
28: Well-partitioned chordal graphs: obstruction set and disjoint paths
29: AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms
30: Efficient and Simple Algorithms for Fault Tolerant Spanners
31: Hedonic Seat Arrangement Problems
32: Integer Plane Multiflow Maximisation : Flow-Cut Gap and One-Quarter-Approximation
33: Improved Lower Bound for Competitive Graph Exploration
34: Stochastic Makespan Minimization in Structured Set Systems
35: 2-Dimensional Palindromes with $k$ Mismatches
36: Dynamic Set Cover: Improved Amortized and Worst-Case Update Time
37: Spectral Sparsification via Bounded-Independence Sampling
38: Comparing copy-number profiles under multi-copy amplifications and deletions
39: Computational Aspects of Geometric Algebra Products of Two Homogeneous Multivectors
40: Asymmetric Streaming Algorithms for Edit Distance and LCS
41: Space Efficient Representations of Finite Groups
42: Computation of Dynamic Equilibria in Series-Parallel Networks
43: On Learning a Hidden Directed Graph with Path Queries
44: Random-Order Models
45: Query-Efficient Correlation Clustering
46: Appending Atomically in Byzantine Distributed Ledgers
47: A Polynomial Time Algorithm for Almost Optimal Vertex Fault Tolerant Spanners
48: Revisiting compact RDF stores based on k2-trees
49: Contextual Search in the Presence of Adversarial Corruptions
50: Data Structures & Algorithms for Exact Inference in Hierarchical Clustering
51: Limitations of Greed: Influence Maximization in Undirected Networks Re-visited
52: Bitvectors with runs and the successor/predecessor problem
53: Finding large matchings in 1-planar graphs of minimum degree 3
54: Polynomial algorithms for p-dispersion problems in a planar Pareto Front
55: Stochastic Matching with Few Queries: $(1-\varepsilon)$ Approximation
56: Layered Sampling for Robust Optimization Problems
57: On Metric DBSCAN with Low Doubling Dimension
58: The Complexity of Contracts
59: Semantrix: A Compressed Semantic Matrix
60: A Data-Dependent Algorithm for Querying Earth Mover’s Distance with Low Doubling Dimensions
61: Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
62: PAPRIKA: Private Online False Discovery Rate Control
63: Explainable $k$-Means and $k$-Medians Clustering
64: Fast Indexes for Gapped Pattern Matching
65: Edge-Disjoint Branchings in Temporal Graphs
66: A (probably) optimal algorithm for Bisection on bounded-treewidth graphs