Table of Contents

• Strongly Connected Orientations and Integer LatticesAhmad Abdi, Gérard Cornuéjols, Siyue Liu, Olha Silina. 1-14 [doi]
• Prize-Collecting Forest with Submodular Penalties: Improved ApproximationAli Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi. 15-28 [doi]
• On the Approximability of Unsplittable Flow on a Path with Time WindowsAlexander Armbruster, Fabrizio Grandoni 0001, Edin Husic, Antoine Tinguely, Andreas Wiese. 29-42 [doi]
• A Constant-Factor Approximation for Pairwise Fair k-Center ClusteringSayan Bandyapadhyay, Tianzhi Chen, Zachary Friggstad, Mahya Jamshidian. 43-57 [doi]
• A Global Analysis of the Primal-Dual Method for Edge Augmentation ProblemsIshan Bansal. 58-71 [doi]
• Monotone Submodular Multiway PartitionRichard Bi, Karthekeyan Chandrasekaran, Soham Joshi. 72-85 [doi]
• Exponential Lower Bounds for Many Pivot Rules for the Simplex MethodAlexander E. Black. 86-99 [doi]
• Online Matching on 3-Uniform HypergraphsSander Borst, Danish Kashaev, Zhuan Khye Koh. 100-113 [doi]
• On the Bidirected Cut Relaxation for Steiner ForestJaroslaw Byrka, Fabrizio Grandoni 0001, Vera Traub. 114-127 [doi]
• Matroid Secretary via Labeling SchemesKristóf Bérczi, Vasilis Livanos, José A. Soto, Victor Verdugo. 128-141 [doi]
• Valid Cuts for the Design of Potential-Based Flow NetworksPascal Börner, Max Klimm, Annette Lutz, Marc E. Pfetsch, Martin Skutella, Lea Strubberg. 142-156 [doi]
• The Differentiable Feasibility PumpMatteo Cacciola, Alexandre Forel, Antonio Frangioni, Andrea Lodi 0001. 157-171 [doi]
• Approximate Cut & Packing Ratios for Multi-commodity ArborescencesParinya Chalermsook, Chien-Chung Huang. 172-183 [doi]
• Lagrangian Dual for Integer Optimization with Zero Duality Gap that Admits DecompositionDiego Cifuentes, Santanu S. Dey, Jingye Xu. 184-198 [doi]
• Reducing the Large Set Threshold for Oertel's Conjecture on the Mixed-Integer VolumeAndrés Cristi, David Salas. 199-212 [doi]
• An Unconditional Lower Bound for the Active-Set Method on the HypercubeYann Disser, Nils Mosis. 213-227 [doi]
• Non-distributive Lattices, Stable Matchings, and Linear OptimizationChristopher En, Yuri Faenza. 228-241 [doi]
• Separating Coverage and Submodular: Maximization Subject to a Cardinality ConstraintYuval Filmus, Roy Schwartz 0002, Alexander V. Smal. 242-255 [doi]
• Completeness in the Polynomial Hierarchy for Many Natural Problems in Bilevel and Robust OptimizationChristoph Grüne, Lasse Wulf. 256-269 [doi]
• Semirandom Planted Clique via 1-Norm Isometry PropertyVenkatesan Guruswami, Hsin-Po Wang 0001. 270-282 [doi]
• Sequential Testing with Subadditive CostsBlake Harris, Viswanath Nagarajan, Rayen Tan. 283-296 [doi]
• (Near)-Optimal Algorithms for Sparse Separable Convex Integer ProgramsChristoph Hunkenschröder, Martin Koutecký, Asaf Levin, Tung Anh Vu. 297-311 [doi]
• An O(log n)-Approximation Algorithm for (p, q)-Flexible Graph Connectivity via Independent RoundingSharat Ibrahimpur, László A. Végh. 312-325 [doi]
• A Black-Box Approach for Exogenous Replenishment in Online Resource AllocationSuho Kang, Ziyang Liu, Rajan Udwani. 326-340 [doi]
• Generalized Assignment and Knapsack Problems in the Random-Order ModelMax Klimm, Martin Knaack. 341-354 [doi]
• Totally $\varDelta $-Modular IPs with Two Non-zeros in Most RowsStefan Kober. 355-370 [doi]
• Sparse Approximation in Lattices and SemigroupsStefan Kuhlmann, Timm Oertel, Robert Weismantel. 371-384 [doi]
• Unsplittable Multicommodity Flows in Outerplanar GraphsDavid Alemán Espinosa, Nikhil Kumar. 385-399 [doi]
• A Simple and Fast Algorithm for Fair CutsJason Li, Owen Li. 400-411 [doi]
• The Augmented Factorization Bound for Maximum-Entropy SamplingYongchun Li. 412-426 [doi]
• Integer and Unsplittable Multiflows in Series-Parallel DigraphsMohammed Majthoub Almoghrabi, Martin Skutella, Philipp Warode. 427-441 [doi]
• Space-Efficient Algorithm for Integer Programming with Few ConstraintsLars Rohwedder, Karol Wegrzycki. 442-451 [doi]
• Implied Integrality in Mixed-Integer OptimizationRolf van der Hulst, Matthias Walter. 452-465 [doi]