1: Longest Common Prefix Arrays for Succinct k-Spectra
2: Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling
3: A Cover Time Study of a non-Markovian Algorithm
4: Analysis of Knuth’s Sampling Algorithm D and D’
5: Robust Topological Orderings for Directed Graphs
6: An Improved Algorithm for Finding Maximum Outerplanar Subgraphs
7: Space-time Trade-offs for the LCP Array of Wheeler DFAs
8: DP-HyPO: An Adaptive Private Hyperparameter Optimization Framework
9: Improved and Deterministic Online Service with Deadlines or Delay
10: Adaptivity Complexity for Causal Graph Discovery
11: Expectation-Complete Graph Representations with Homomorphisms
12: Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case
13: Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs
14: Optimal distance query reconstruction for graphs without long induced cycles
15: Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
16: Semi-online Scheduling with Lookahead
17: Branching via Cutting Plane Selection: Improving Hybrid Branching
18: Covering Planar Metrics (and Beyond): O(1) Trees Suffice
19: Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions
20: On Improving the Cohesiveness of Graphs by Merging Nodes: Formulation, Analysis, and Algorithms
21: GuP: Fast Subgraph Matching by Guard-based Pruning
22: Importance Sparsification for Sinkhorn Algorithm
23: Learning the Positions in CountSketch
24: Counting Distinct Elements in the Turnstile Model with Differential Privacy under Continual Observation
25: Time-limited Bloom Filter
26: Approximation Algorithms for Fair Range Clustering
27: Scalable Fair Influence Maximization
28: Fitch Graph Completion
29: RIP Linked List
30: Invertible Bloom Lookup Tables with Less Memory and Randomness
31: Differentially Private One Permutation Hashing and Bin-wise Consistent Weighted Sampling
32: Expanding the Scope of DAWN: A Novel Version for Weighted Shortest Path Problem
33: Continual Release of Differentially Private Synthetic Data from Longitudinal Data Collections
34: Online Matching in Geometric Random Graphs
35: Robustly Learning a Single Neuron via Sharpness
36: GraphVine: A Data Structure to Optimize Dynamic Graph Processing on GPUs
37: The Secretary Problem with Predictions
38: Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors
39: Recoverable Robust Optimization with Commitment
40: Noise Stability Optimization for Flat Minima with Tight Rates