1: Trace Reconstruction: Generalized and Parameterized
2: Scheduling to Approximate Minimization Objectives on Identical Machines
3: Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
4: Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
5: Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation
6: Almost Optimal Testers for Concise Representations
7: Hierarchical b-Matching
8: Multicast Communications in Tree Networks with Heterogeneous Capacity Constraints
9: A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
10: Faster Algorithms for All Pairs Non-decreasing Paths Problem
11: Reoptimization of Path Vertex Cover Problem
12: Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio
13: Building a Nest by an Automaton
14: Normalizers and permutational isomorphisms in simply-exponential time
15: Summarizing Data Succinctly with the Most Informative Itemsets
16: On adaptive algorithms for maximum matching
17: Stochastic rounding and reduced-precision fixed-point arithmetic for solving neural ordinary differential equations
18: Detecting and Counting Small Patterns in Planar Graphs in Subexponential Parameterized Time
19: Performance Prediction for Coarse-Grained Locking
20: Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
21: Distributed Detection of Cliques in Dynamic Networks
22: Quantum Walk Sampling by Growing Seed Sets
23: Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
24: Approximation Algorithms for Min-Distance Problems
25: The minimum cost query problem on matroids with uncertainty areas
26: The Potential of Restarts for ProbSAT
27: Tight Bounds for Online Weighted Tree Augmentation
28: Dynamic inference in probabilistic graphical models
29: Improving the complexity of Parys’ recursive algorithm
30: An efficient branch-and-cut algorithm for approximately submodular function maximization
31: Analog quantum algorithms for the mixing of Markov chains
32: Retracting Graphs to Cycles
33: On the fixed-parameter tractability of the maximum connectivity improvement problem
34: Parameterized algorithms for Partial vertex covers in bipartite graphs
35: Truly Optimal Euclidean Spanners
36: A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
37: Authenticated Key-Value Stores with Hardware Enclaves
38: Phase Transition in Democratic Opinion Dynamics
39: A computational model for analytic column stores
40: Fast Utility Mining on Complex Sequences
41: Generalizing the Covering Path Problem on a Grid