# Selected Publications

- Tight Sum-of-Squares lower bounds for binary polynomial optimization problems, ICALP 2016 (track A).
- Sum-Of-Squares hierarchy lower bounds for symmetric formulations, IPCO 2016
- Semidefinite and linear programming integrality gaps for scheduling identical machines, IPCO 2016
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy. ICALP (1) 2015
- (to appear in Mathematics of Operations Research 2016)
- A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem. ESA 2015
- How to sell hyperedges: the hyper matching assignment problem SODA 2013
- Vertex cover in graphs with locally few colors

ICALP 2011, Information and Computation (ICALP 2011 invited paper) __Hardness of Approximating Flow and Job Shop Scheduling Problems__

Journal of the ACM 2011

(FOCS 2008, ICALP 2009)__Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constraint Scheduling__

SICOMP 2011 (FOCS 2007)__On the approximability of the Single-Machine Scheduling with Precedence Constraints__

Mathematics of Operations Research 2011 (APPROX 2006 & IPCO 2007 & FOCS 2007)__Grouping techniques for scheduling problems: simpler and faster__

Algorithmica 2008__Single machine precedence constrained scheduling is a vertex cover problem__

Algorithmica 2009 (ESA 2006)__Effective neighbourhood functions for the flexible job shop problem__

Journal of Scheduling, 2000 [__.html__]

# PC Member

- WAOA 2016 (co-chair), WAOA 2014, WADS 2013, WG 2013,
__APPROX 2012__,__STACS 2012__, WAOA 2011,__MAPSP 2011__,__APPROX 2010__,__WAOA 2010__,__WAOA 2009__,__HiPC 2009__

# PhD Students

__Ola Svensson__(2006-2009)__Nikos Mutsanas__(2006-2010)- Georgios Stamoulis (2010-2014)
- Sam Leppanen (2013-?)