1: An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
2: Parameterized Restless Temporal Path
3: 25 Additional Problems – Extension to the Book “125 Problems in Text Algorithms”
4: A Formal Refutation of the Blockchain Trilemma
5: Non-Adaptive Evaluation of $k$-of-$n$ Functions: Tight Gap and a Unit-Cost PTAS
6: Instance-Optimal Quantum State Certification with Entangled Measurements
7: Learning-Augmented Online Covering Problems
8: Precomputed Dominant Resource Fairness
9: Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
10: Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
11: Multi-Queue SSD I/O Modeling & Its Implications for Data Structure Design
12: Designing Parallel Algorithms for Community Detection using Arachne
13: Prediction-Augmented Mechanism Design for Weighted Facility Location
14: Faster Algorithms for $(2k-1)$-Stretch Distance Oracles
15: Faster Estimation of the Average Degree of a Graph Using Random Edges and Structural Queries
16: Finding One Local Optimum Is Easy – But What about Two?
17: On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
18: Efficient and Adaptive Estimation of Local Triadic Coefficients
19: A Randomized Rounding Approach for DAG Edge Deletion
20: Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
21: Mallows Model with Learned Distance Metrics: Sampling and Maximum Likelihood Estimation
22: Finding a solution to the Erd\H{o}s-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
23: On the Parallel Complexity of Finding a Matroid Basis
24: Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
25: H-Planarity and Parametric Extensions: when Modulators Act Globally
26: Fast and Efficient Merge of Sorted Input Lists in Hardware Using List Offset Merge Sorters
27: Beer Path Problems in Temporal Graphs
28: On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
29: To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs
30: On Fair Epsilon Net and Geometric Hitting Set
31: Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers
32: m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
33: A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
34: Simultaneous Network Design with Restricted Link Usage
35: Nearly Tight Sample Complexity for Matroid Online Contention Resolution
36: Paths and Intersections: Exact Emulators for Planar Graphs
37: Minimum-Peak-Cost Flows Over Time
38: Phase transition of the Sinkhorn-Knopp algorithm
39: Improved Directed Expander Decompositions
40: Covering a Few Submodular Constraints and Applications
41: Improved bicriteria approximation for $k$-edge-connectivity
42: Bicriteria Submodular Maximization
43: Average Sensitivity of Hierarchical $k$-Median Clustering
44: Computing the probability of intersection