Similar Items: Connectivity augmentation is fixed-parameter tractable
- The tractability landscape of diffusion alignment: regularization, rewards, and computational primitives
- Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
- Optimal Learning-Augmented Algorithm for Online Bidding
- The Pareto Frontier of Randomized Learning-Augmented Online Bidding
- Designing sparse temporal graphs satisfying connectivity requirements
- Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks