Integrality gaps for strengthened LP relaxations of Capacitated and Lower-Bounded Facility Location ,

Improved approximation for 3-dimensional matching via bounded pathwidth local search 17:00?17:25 Antonios Varvitsiotis: On the rank constrained Grothendieck constant of graphs and a new tree-width-like graph parameter, pp.25-1735 ,

The planar directed k-Vertex Disjoint Paths problem is fixed-parameter tractable 10:45?11:10 M S Ramanujan: Cuts on Skew-Symmetric Graphs and Linear Time FPT algorithms 11:10?11:45 Nicolas Trotignon: The stable set problem is FPT in bull-free graphs 11, Break Session, vol.10, pp.45-1155 ,

The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial 12:45?13:10 Daniel Lokshtanov: Independent Set in P5-Free Graphs in Polynomial Time, pp.30-1430 ,