1: Sum-of-Max Chain Partition of a Tree
2: Finding a Fair Scoring Function for Top-$k$ Selection: Hardness, Algorithms, and Experiments
3: Local Pan-Privacy for Federated Analytics
4: PREAMBLE: Private and Efficient Aggregation of Block Sparse Vectors and Applications
5: Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNs
6: Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
7: Optimal mass estimation in the conditional sampling model
8: Constant Approximation of Fr'echet Distance in Strongly Subquadratic Time
9: Semi-Streaming Algorithms for Graph Property Certification
10: Impact of Knowledge on the Cost of Treasure Hunt in Trees
11: Connected Partitions via Connected Dominating Sets
12: Graph Discovery and Source Detection in Temporal Graphs
13: Parallel Minimum Cost Flow in Near-Linear Work and Square Root Depth for Dense Instances
14: Hierarchical Multicriteria Shortest Path Search
15: Optimal Bounds for Adversarial Constrained Online Convex Optimization
16: Deciding if a DAG is Interesting is Hard
17: A $(1+\epsilon)$-Approximation for Ultrametric Embedding in Subquadratic Time
18: Optimal Non-Oblivious Open Addressing
19: Quantum EigenGame for excited state calculation
20: Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms
21: Color-Constrained Arborescences in Edge-Colored Digraphs
22: Efficient Greedy Discrete Subtrajectory Clustering
23: Streaming and Massively Parallel Algorithms for Euclidean Max-Cut
24: Better Private Distribution Testing by Leveraging Unverified Auxiliary Data
25: A Variational-Calculus Approach to Online Algorithm Design and Analysis
26: On $G^p$-unimodality of radius functions in graphs: structure and algorithms
27: Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
28: Online Matching under KIID: Enhanced Competitive Analysis through Ordinary Differential Equation Systems
29: A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
30: Dispersion is (Almost) Optimal under (A)synchrony
31: Near-Linear Runtime for a Classical Matrix Preconditioning Algorithm
32: A parallel algorithm for the odd two-face shortest k-disjoint path problem
33: Fast online node labeling with graph subsampling
34: Local Ratio based Real-time Job Offloading and Resource Allocation in Mobile Edge Computing
35: Fast Quantum Amplitude Encoding of Typical Classical Data