Selected Publications
- How to sell hyperedges: the hyper matching assignment problem SODA 2013
- Vertex cover in graphs with locally few colors
ICALP 2011, to appear in 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
- 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-?)
Teaching
- Algorithms and Complexity
(University of Lugano) - Operations Research
(University of Applied Science of Southern Switzerland)