1: Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
2: Estimating Principal Components under Adversarial Perturbations
3: A Fast Algorithm for Online k-servers Problem on Trees
4: Provable guarantees for decision tree induction: the agnostic setting
5: Note to “An efficient Data Structure for Lattice Operation”
6: Secretary and Online Matching Problems with Machine Learned Advice
7: Streaming Coresets for Symmetric Tensor Factorization
8: Approximation Guarantees of Local Search Algorithms via Localizability of Set Functions
9: Zone Theorem for Arrangements in three dimensions
10: Fast Algorithms for Join Operations on Tree Decompositions
11: Efficient tree-structured categorical retrieval
12: Hierarchical Clustering: a 0.585 Revenue Approximation
13: Designing Differentially Private Estimators in High Dimensions
14: Sparsification of Directed Graphs via Cut Balance
15: Palindromic Trees for a Sliding Window and Its Applications
16: LCP-Aware Parallel String Sorting
17: Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs
18: ExKMC: Expanding Explainable $k$-Means Clustering
19: Dynamic Longest Common Substring in Polylogarithmic Time
20: Spread of Influence in Graphs
21: Batch greedy maximization of non-submodular functions: Guarantees and applications to experimental design
22: Tensor Completion Made Practical
23: Partitioned Learned Bloom Filter
24: Efficient Semi-External Depth-First Search
25: Linear Programming and Community Detection
26: From Checking to Inference: Actual Causality Computations as Optimization Problems
27: The Baggage Belt Assignment Problem
28: Scaling Up Distance-generalized Core Decomposition
29: Single-machine scheduling with an external resource
30: Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts
31: An Improved and Parallel Version of a Scalable Algorithm for Analyzing Time Series Data
32: VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints
33: Differentially private partition selection
34: Distributed Approximation on Power Graphs
35: Attribute-Efficient Learning of Halfspaces with Malicious Noise: Near-Optimal Label Complexity and Noise Tolerance
36: On the Maximum Cardinality Cut Problem in Proper Interval Graphs and Related Graph Classes
37: Average Sensitivity of Spectral Clustering
38: Learning Restricted Boltzmann Machines with Sparse Latent Variables