1: On Diverse Solutions to Packing and Covering Problems
2: Improved Decoding of Tanner Codes
3: On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs
4: A Fast Counting-Free Algorithm for Computing Atomic Sets in Feature Models
5: Stable Matching with Interviews
6: An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
7: Making Temporal Betweenness Computation Faster and Restless
8: Online Rack Placement in Large-Scale Data Centers
9: On Tradeoffs in Learning-Augmented Algorithms
10: Non-adaptive Learning of Random Hypergraphs with Queries
11: A Note on Deterministic FPTAS for Partition
12: QuaRs: A Transform for Better Lossless Compression of Integers
13: Guaranteed Recovery of Unambiguous Clusters
14: Corecursive Coding of High Computational Derivatives and Power Series
15: Complexity and Algorithm for the Matching vertex-cutset Problem
16: Markovian Search with Socially Aware Constraints
17: New Oracles and Labeling Schemes for Vertex Cut Queries
18: Graphs with no long claws: An improved bound for the analog of the Gy'{a}rf'{a}s’ path argument
19: On Extended Concentration Inequalities for Fast JL Embeddings of Infinite Sets
20: RadiK: Scalable and Optimized GPU-Parallel Radix Top-K Selection
21: Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
22: Efficient parameterized approximation
23: Forbidden Subgraph Problems with Predictions
24: Tree independence number V. Walls and claws
25: Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare
26: Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
27: Complexity of Minimal Faithful Permutation Degree for Fitting-free Groups
28: Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models
29: Latency Guarantees for Caching with Delayed Hits
30: Differentially Private Set Representations
31: Near-Optimal Algorithms for Omniprediction