1: Fast Approximations for Rooted Connectivity in Weighted Directed Graphs
2: A Gaussian fixed point random walk
3: Exact and Approximate Hierarchical Clustering Using A(star)
4: A Better-Than-2 Approximation for Weighted Tree Augmentation
5: Faster Algorithms for Rooted Connectivity in Directed Graphs
6: On the Assessment of Benchmark Suites for Algorithm Comparison
7: A Single-Exponential Time 2-Approximation Algorithm for Treewidth
8: Lipschitz Selectors may not Yield Competitive Algorithms for Convex Body Chasing
9: SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems
10: Fair and Reliable Reconnections for Temporary Disruptions in Electric Distribution Networks using Submodularity
11: Approximation algorithms for 1-Wasserstein distance between persistence diagrams
12: Minimum Cuts in Directed Graphs via $\sqrt{n}$ Max-Flows
13: Parameterized Complexity of Categorical Clustering with Size Constraints
14: Complexity and algorithms for injective edge-coloring in graphs
15: Shared-Memory n-level Hypergraph Partitioning
16: Priority Promotion with Parysian Flair
17: Finding Motifs in Knowledge Graphs using Compression
18: Approximate Triangle Counting via Sampling and Fast Matrix Multiplication
19: Load-Balancing Succinct B Trees
20: HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields
21: Online List Access with Precedence Constraints
22: Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks
23: Joint replenishment meets scheduling
24: Minimizing the total weighted pairwise connection time in network construction problems
25: Explaining the Entombed Algorithm
26: Linear-time uniform generation of random sparse contingency tables with specified marginals
27: Local Pair and Bundle Discovery over Co-Evolving Time Series
28: Learning GMMs with Nearly Optimal Robustness Guarantees
29: Locally Private k-Means in One Round
30: Robust Online Algorithms for Dynamic Choosing Problems
31: Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
32: Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable
33: PTHash: Revisiting FCH Minimal Perfect Hashing