| 1 | -- | 2 | Jaroslaw Byrka, Jens Vygen. Preface |
| 3 | -- | 27 | Jesús A. De Loera, Brittney Marsters, Luze Xu, Shixuan Zhang. Integer points in arbitrary convex cones: the case of the PSD and SOC cones |
| 29 | -- | 48 | Iskander Aliev, Marcel Celaya, Martin Henk. Sparsity and proximity transference in integer programming |
| 49 | -- | 86 | Javier Marinkovic, José A. Soto, Victor Verdugo. Online combinatorial assignment in independence systems |
| 87 | -- | 109 | Jannis Blauth, Nathan Klein, Martin Nägele. A better-than-1.6-approximation for prize-collecting TSP |
| 111 | -- | 133 | Meike Neuwohner. A $\nicefrac {4}{3}$-approximation for the maximum leaf spanning arborescence problem in DAGs |
| 135 | -- | 176 | Jamico Schade, Makrand Sinha, Stefan Weltge. Lower bounds on the complexity of mixed-integer programs for stable set and knapsack |
| 177 | -- | 220 | Théo Barré, Omar El Housni, Marouane Ibn Brahim, Andrea Lodi 0001, Danny Segev. Assortment optimization with visibility constraints |
| 221 | -- | 254 | Madison Van Dyk, Kim Klause, Jochen Könemann, Nicole Megow. Fast Combinatorial Algorithms for Efficient Sortation |
| 255 | -- | 274 | Zeev Nutov. Extending the primal-dual 2-approximation algorithm beyond uncrossable set families |
| 275 | -- | 294 | Neelima Gupta, Rajni Dabas, Naveen Garg 0001. Capacitated facility location with outliers and uniform facility costs |
| 295 | -- | 338 | Anupam Gupta 0001, Jinqiao Hu, Gregory Kehne, Roie Levin. Pairwise-independent contention resolution |
| 339 | -- | 377 | Richard Cole 0001, Christoph Hertrich, Yixin Tao, László A. Végh. A first order method for linear programming parameterized by circuit imbalance |
| 379 | -- | 424 | Diego Cifuentes, Santanu S. Dey, Jingye Xu. Sensitivity analysis for mixed binary quadratic programming |
| 425 | -- | 447 | Billy Jin, Nathan Klein, David P. Williamson. A lower bound for the max entropy algorithm for TSP |
| 449 | -- | 488 | Yuri Faenza, Cliff Stein 0001, Jia Wan 0002. Von Neumann-Morgenstern stability and internal closedness in matching theory |
| 489 | -- | 520 | Haripriya Pulyassary, Kostas Kollias, Aaron Schild, David B. Shmoys, Manxi Wu. Network flow problems with electric vehicles |
| 521 | -- | 538 | Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin. Tight lower bounds for block-structured integer programs |
| 539 | -- | 572 | Bart T. C. van Rossum, Rui Chen 0034, Andrea Lodi 0001. Efficient branching rules for optimizing range and order-based objective functions |
| 573 | -- | 603 | Ayoub Foussoul, Vineet Goyal, Amit Kumar. Fully-Dynamic Load Balancing |
| 605 | -- | 626 | Chien-Chung Huang 0001, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai. An FPTAS for Connectivity Interdiction |
| 627 | -- | 650 | Tasuku Soma, Kam Chuen Tung, Yuichi Yoshida. Online Algorithms for Spectral Hypergraph Sparsification |
| 651 | -- | 708 | Yongchun Li, Weijun Xie 0001. On the partial convexification for low-rank spectral optimization: rank bounds and algorithms |
| 709 | -- | 756 | Ryuhei Mizutani, Yuki Yoshida. Weakly polynomial-time algorithms to minimize 2/3-submodular functions |
| 757 | -- | 791 | Kirill Kukharenko, Laura Sanità. On the number of degenerate simplex pivots |