Abstract is missing.
- On the Complexity of the Odd-Red Bipartite Perfect Matching PolytopeMartin Nägele, Christian Nöbel, Rico Zenklusen. 1-16 [doi]
- A PTAS for Weighted Triangle-Free 2-MatchingMiguel Bosch Calvo, Fabrizio Grandoni 0001, Yusuke Kobayashi 0001, Takashi Noguchi. 17-31 [doi]
- Stronger Hardness for Maximum Robust Flow and Randomized Network InterdictionJannik Matuschke. 32-46 [doi]
- Approximation Schemes for Planar Graph Connectivity ProblemsMeike Neuwohner, Vera Traub, Rico Zenklusen. 47-63 [doi]
- Degree Realization with Minimum Dominating SetAmotz Bar-Noy, Igor Kalinichev, David Peleg, Dror Rawitz. 64-80 [doi]
- 1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LPChenglin Fan, Dahoon Lee, Euiwoong Lee. 81-96 [doi]
- O(log n)-Approximation Algorithms for Bipartiteness RatioTasuku Soma, Mingquan Ye, Yuichi Yoshida. 97-111 [doi]
- Approximating Multiple-Depot Capacitated Vehicle Routing via LP RoundingZachary Friggstad, Tobias Mömke. 112-127 [doi]
- The Integrality Gap of the Traveling Salesman Problem is $\frac{4}{3}$ if the LP Solution Has at Most n + 6 Non-Zero ComponentsTullio Villa, Eleonora Vercesi, János Barta, Monaldo Mastrolilli. 128-143 [doi]
- The Local Dyadic ConjectureMahtab Alghasi, Bertrand Guenin, Levent Tunçel. 144-157 [doi]
- On Integer Programs That Look Like PathsMarcin Brianski, Alexandra Lassota, Kristýna Pekárková, Michal Pilipczuk, Janina Reuter. 158-172 [doi]
- Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand SidesAlexandra Lassota, Koen Ligthart. 173-187 [doi]
- A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity NormStefan Kuhlmann, Robert Weismantel. 188-203 [doi]
- Lattice Structure and Efficient Basis Construction for Strongly Connected OrientationsSiyue Liu 0001, Olha Silina. 204-219 [doi]
- On Lattice Diameter Segments: Algorithms and StructureGennadiy Averkov, Anouk E. Brose, Jesús A. De Loera, Gyivan Lopez-Campos, Antonio J. Torres. 220-232 [doi]
- On Circuit Diameter and Straight Line ComplexityDaniel Dadush, Stefan Kober, Zhuan Khye Koh. 233-248 [doi]
- Improved Approximation Algorithms for Orthogonally Constrained Problems Using Semidefinite OptimizationRyan Cory-Wright, Jean Pauphilet. 249-264 [doi]
- Polytope Scheduling with Groups: Unified Models and Optimal GuaranteesAlexander Lindermayr, Zhenwei Liu, Nicole Megow. 265-281 [doi]
- An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load BalancingDaniel Blankenburg, Antonia Ellerbrock, Thomas Kesselheim, Jens Vygen. 282-298 [doi]
- Stochastic Load Balancing with Machine ReservationsDavid Alemán Espinosa, Naveen Garg 0001, Sharat Ibrahimpur, Neil Olver, Chaitanya Swamy. 299-314 [doi]
- s,t-Separating Principal Partition Sequence of Submodular FunctionsKristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Daniel P. Szabo. 315-330 [doi]
- Hedgegraph PolymatroidsKarthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang 0002, Weihao Zhu. 331-345 [doi]
- Efficiently Coloring the Intersection of a General Matroid and Combinatorial MatroidsStephen Arndt, Benjamin Moseley, Kirk Pruhs, Michael Zlatin. 346-361 [doi]
- Polynomial Kernels with Reachability for Weighted d-Matroid IntersectionChien-Chung Huang 0001, Naonori Kakimura, Yusuke Kobayashi 0001, Tatsuya Terao. 362-377 [doi]
- A Weighted-to-Unweighted Reduction for Matroid IntersectionAditi Dudeja, Mara Grilnberger. 378-393 [doi]
- Arithmetic Circuits and Neural Networks for Regular MatroidsChristoph Hertrich, Stefan Kober, Georg Loho. 394-409 [doi]
- Bayesian Probing on GraphsAnupam Gupta 0001, Benjamin Moseley, Rudy Zhou. 410-425 [doi]
- Complexity of Bilevel Linear Programming with a Single Upper-Level VariableNagisa Sugishita, Margarida Carvalho. 426-440 [doi]
- A Framework for Handling and Exploiting Symmetry in Benders DecompositionChristopher Hojny, Cédric Roy. 441-456 [doi]
- Structure-Preserving Symmetry Presolving for Mixed-Binary Linear ProblemsAnnika Jäger, Marc E. Pfetsch. 457-473 [doi]
- The Strength of Root Cuts in an Extended Abstract Branch-and-Cut ModelBoyang Han, Aleksandr M. Kazachkov. 474-490 [doi]
- Linear Programming Hierarchies Collapse Under SymmetryYuri Faenza, Victor Verdugo, José Verschae, Matías Villagra. 491-506 [doi]
- Closing the Gap: Efficient Algorithms for Discrete Wasserstein BarycentersJiaqi Wang, Weijun Xie 0001. 507-520 [doi]