----------------------------------------------------------------
IPCO XVIII, 2016 (Liège):  List of accepted papers
----------------------------------------------------------------

* Alberto Del Pia
  On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming.

* Amitabh Basu and Timm Oertel
  Centerpoints: A link between optimization and convex geometry.

* Daniel Dadush, László A. Végh and Giacomo Zambelli
  Rescaled coordinate descent methods for Linear Programming.

* André Linhares and Chaitanya Swamy
  Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems.

* Jon Lee, Viswanath Nagarajan and Xiangkun Shen
  Max-Cut under Graph Constraints

* Mourad Baïou and Francisco Barahona
  Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem.

* Matteo Fischetti, Ivana Ljubić, Michele Monaci and Markus Sinnl
  Intersection Cuts for Bilevel Optimization.

* Thai Dinh, Ricardo Fukasawa and James Luedtke
  Exact Algorithms for the Chance-Constrained Vehicle Routing Problem.

* Miles Lubin, Emre Yamangil, Russell Bent and Juan Pablo Vielma
  Extended Formulations in Mixed-integer Convex Programming.

* Mohit Singh and Rico Zenklusen
  k-Trails: Recognition, Complexity, and Approximations.

* Corinna Gottschalk and Jens Vygen
  Better s-t-Tours by Gao Trees.

* Ágnes Cseh and Telikepalli Kavitha
  Popular Edges and Dominant Matchings.

* Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo and Andreas Wiese
  Semidefinite and linear programming integrality gaps for scheduling identical machines.

* Sara Ahmadian, Laura Sanità and Hamideh Hosseinzadeh
  Stabilizing network bargaining games by blocking players.

* Erik Lambrechts, Annette M.C. Ficker, Dries R. Goossens and Frits C.R. Spieksma
  Round Robin Tournaments Generated by the Circle Method have Maximum Carry-Over.

* Amitabh Basu, Michele Conforti, Marco Di Summa and Joseph Paat
  Extreme Functions with an Arbitrary Number of Slopes.

* Amitabh Basu, Robert Hildebrand and Marco Molinaro
  Minimal cut-generating functions are nearly extreme.

* Alberto Del Pia and Jeffrey Poskin
  On the Mixed Binary Representability of Ellipsoidal Regions.

* Ola Svensson, Jakub Tarnawski and László A. Végh
  Constant Factor Approximation for ATSP with Two Edge Weights.

* Samuel Fiorini, Gwenaël Joret and Oliver Schaudt
  Improved Approximation Algorithms for Hitting 3-Vertex Paths.

* Anke van Zuylen
  Improved Approximations for Cubic Bipartite and Cubic TSP.

* Jarosław Byrka, Bartosz Rybicki and Sumedha Uniyal
  An approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation.

* Cong Han Lim, Jeff Linderoth and James Luedtke
  Valid Inequalities for Separable Concave Constraints with Indicator Variables

* Alfredo Torrico, Shabbir Ahmed and Alejandro Toriello
  A Polyhedral Approach to Online Bipartite Matching

* Gérard Cornuéjols and Dabeen Lee
  On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvatal Rank

* Rajan Udwani, Andreas S. Schulz and James B. Orlin
  Robust Monotone Submodular Function Maximization.

* Tasuku Soma and Yuichi Yoshida
  Maximizing Monotone Submodular Functions over the Integer Lattice.

* Anna Adamaszek, Parinya Chalermsook, Alina Ene and Andreas Wiese
  Submodular Unsplittable Flow on Trees.

* Gábor Braun, Sebastian Pokutta and Aurko Roy
  Strong reductions for extended formulations.

* Adam Kurpisz, Samuli Leppänen and Monaldo Mastrolilli
  Sum-of-squares lower bounds for maximally symmetric formulations.

* Nikhil Bansal and Viswanath Nagarajan
  Approximation-Friendly Discrepancy Rounding.

* Gérard Cornuéjols and Yanjun Li
  Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point.