| 1 | -- | 2 | Jon Lee, Jens Vygen. Preface |
| 3 | -- | 28 | Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne. Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs |
| 29 | -- | 53 | Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson. Centrality of trees for capacitated k-center |
| 55 | -- | 80 | Alejandro Angulo, Daniel Espinoza, Rodrigo Palma. Sequence independent lifting for mixed knapsack problems with GUB constraints |
| 81 | -- | 111 | Gennadiy Averkov, Amitabh Basu. Lifting properties of maximal lattice-free polyhedra |
| 113 | -- | 144 | Manish Bansal, Kiavash Kianfar. n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem |
| 145 | -- | 172 | Nikhil Bansal, Viswanath Nagarajan. On the adaptivity gap of stochastic orienteering |
| 173 | -- | 196 | Adrian Bock, Karthekeyan Chandrasekaran, Jochen Könemann, Britta Peis, Laura Sanità. Finding small stabilizers for unstable graphs |
| 197 | -- | 223 | Pierre Bonami, François Margot. Cut generation through binarization |
| 225 | -- | 247 | Amit Chakrabarti, Sagar Kale. Submodular maximization meets streaming: matchings, matroids, and more |
| 249 | -- | 272 | Chandra Chekuri, Alina Ene. The all-or-nothing flow problem in directed graphs with symmetric demand pairs |
| 273 | -- | 303 | Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza. Reverse split rank |
| 305 | -- | 328 | José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, José Verschae. Strong LP formulations for scheduling splittable jobs on unrelated machines |
| 329 | -- | 352 | Santanu S. Dey, Marco Molinaro, Qianyi Wang. Approximating polyhedra with sparse inequalities |
| 353 | -- | 380 | Chien-Chung Huang, Telikepalli Kavitha. Improved approximation algorithms for two variants of the stable marriage problem with ties |
| 381 | -- | 406 | Volker Kaibel, Matthias Walter. Simple extensions of polytopes |
| 407 | -- | 425 | Volker Kaibel, Stefan Weltge. Lower bounds on the sizes of integer programs without additional variables |
| 427 | -- | 462 | Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukás Polácek, Ola Svensson. On the configuration LP for maximum budgeted allocation |
| 463 | -- | 491 | Fatma Kilinç-Karzan, Sercan Yildiz. Two-term disjunctions on the second-order cone |
| 493 | -- | 514 | Madhukar R. Korupolu, Adam Meyerson, Rajmohan Rajaraman, Brian Tagiku. Coupled and k-sided placements: generalizing generalized assignment |
| 515 | -- | 532 | Lap Chi Lau, Hong Zhou. A unified algorithm for degree bounded survivable network design |
| 533 | -- | 562 | Matthias Mnich, Andreas Wiese. Scheduling and fixed-parameter tractability |