----------------------------------------------------------------
IPCO XVI, 2013 (Valparaiso):  List of accepted papers   
----------------------------------------------------------------

* Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza and Roland Grappe.
  Reverse Chvatal-Gomory rank

* Bertrand Guenin and Leanne Stuive.
  Single commodity-flow algorithms for lifts of graphic and co-graphic matroids.	

* Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi and Andreas Wiese.
  Constant Integrality Gap LP formulations of Unsplittable Flow on a Path.

* Thomas Rothvoss and Laura Sanita.
  0/1 Polytopes with Quadratic Chvatal Rank.

* Takasu Soma.
  Fast Deterministic Algorithms for Matrix Completion Problems

* Thomas Rothvoss.
  A simpler proof for O(congestion + dilation) packet routing.

* Kent Andersen and Anders Jensen.
  Intersection Cuts for Mixed Integer Conic Quadratic Sets.

* Karen Aardal and Frederik von Heymann.
  On the Structure of Reduced Kernel Lattice Bases.

* David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee and K.K. Ramakrishnan.
  Content placement via the exponential potential function method.

* Hongbo Dong and Jeff Linderoth.
  On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators

* Viswanath Nagarajan, Hadas Shachnai and Baruch Schieber.
  The Euclidean k-Supplier Problem.

* Alberto Caprara, Margarida Carvalho, Andrea Lodi and Gerhard Woeginger.
  A complexity and approximability study of the bilevel knapsack problem.

* Diego Moran and Santanu Dey.
  A Polynomial-time Algorithm to Check Closedness of Simple Second Order Mixed-integer Sets.

* Michael Dinitz and Anupam Gupta.
  Packing Interdiction and Partial Covering Problems.

* Tim Nonner and Maxim Sviridenko.
  An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem

* Vishnu Narayanan.
  Facial Structure and Representation of Integer Hulls of Convex Sets.

* Danny Chen, Jian Li, Hongyu Liang and Haitao Wang.
  Matroid and Knapsack Center Problems.

* Ruben Hoeksma and Marc Uetz.
  Two Dimensional Optimal Mechanism Design for a Sequencing Problem.

* Benjamin Moseley, Kirk Pruhs and Cliff Stein.
  The Complexity of Scheduling for p-norms of Flow and Stretch.

* Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels and Gautier Stauffer.
  Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property.

* Andras Sebo.
  Eight-Fifth Approximation for TSP Paths.

* Maxim Sviridenko and Andreas Wiese.
  Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines.

* Attila Bernath and Gyula Pap.
  Blocking optimal arborescences.

* Zachary Friggstad, Anupam Gupta and Mohit Singh.
  An Improved Integrality Gap for Asymmetric TSP Paths.

* Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai and Tami Tamir.
  All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns.

* Stephan Held and Daniel Rotter.
  Shallow-Light Steiner Arborescences with Vertex Delays. 

* Neil Olver and Rico Zenklusen.
  Chain-Constrained Spanning Trees.

* Patrick Jaillet, Jose Soto and Rico Zenklusen.
  Advances on Matroid Secretary Problems: Free Order Model and Laminar Case.

* Amitabh Basu, Robert Hildebrand and Matthias Koeppe.
  Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. II. The Unimodular Two-Dimensional Case    

* Anupam Gupta and Viswanath Nagarajan.
  A Stochastic Probing Problem with Applications.

* Sanjeeb Dash, Oktay Gunluk and Diego Alejandro Moran Ramirez.
  On some generalizations of the split closure. 		 

* Anupam Gupta, Viswanath Nagarajan and Vijay Vazirani.
  Thrifty Algorithms for Multistage Robust Optimization.

* Michele Conforti, Gerard Cornuejols, Aris Daniilidis, Claude Lemarechal and Jerome Malick.
  Cut-generating functions