1: Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problem
2: Dominating Set Knapsack: Profit Optimization on Dominating Sets
3: Translating between the representations of an acyclic convex geometry of bounded degree
4: A Refined Kernel for $d$-Hitting Set
5: A Simple Algorithm for Trimmed Multipoint Evaluation
6: Lazy B-Trees
7: Best Agent Identification for General Game Playing
8: Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
9: On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
10: Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
11: Inverse matroid optimization under subset constraints
12: Optimal Dispersion Under Asynchrony
13: Faster Algorithm for Second (s,t)-mincut and Breaking Quadratic barrier for Dual Edge Sensitivity for (s,t)-mincut
14: Dynamic Similarity Graph Construction with Kernel Density Estimation
15: A Deterministic Partition Tree and Applications
16: SPARSE-PIVOT: Dynamic correlation clustering for node insertions
17: Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
18: New algorithms for girth and cycle detection
19: A Computational Proof of the Highest-Scoring Boggle Board
20: On the Adversarial Robustness of Online Importance Sampling
21: Numerical Linear Algebra in Linear Space
22: Online Conformal Prediction with Efficiency Guarantees
23: Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
24: On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms
25: Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
26: Indexing Tries within Entropy-Bounded Space
27: An Easy Proof of a Weak Version of Chernoff inequality
28: Connected k-Median with Disjoint and Non-disjoint Clusters
29: On the Structure of Replicable Hypothesis Testers
30: Barvinok’s interpolation method meets Weitz’s correlation decay approach
31: Discovering Algorithms with Computational Language Processing
32: Going Beyond Surfaces in Diameter Approximation
33: Bayesian Optimal Stopping with Maximum Value Knowledge
34: On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
35: A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
36: Bicriteria approximation for $k$-edge-connectivity
37: A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
38: Maximizing the Margin between Desirable and Undesirable Elements in a Covering Problem
39: Combination generators with optimal cache utilization and communication free parallel execution
40: Online Makespan Scheduling under Scenarios
41: HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
42: Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
43: Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
44: Agentic Distributed Computing
45: Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
46: Heights of butterfly trees
47: The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
48: The Fair Periodic Assignment Problem
49: Decremental Greedy Polygons and Polyhedra Without Sharp Angles
50: Greedy Dynamic Matching
51: Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
52: Truthful, Credible, and Optimal Auctions for Matroids via Blockchains and Commitments
53: Improved Algorithms for Effective Resistance Computation on Graphs
54: Liar’s vertex-edge domination in subclasses of chordal graphs
55: Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
56: Recent Advances in Maximum-Entropy Sampling