Short bio

Studied Computer Science at the University of Wroclaw. 2004-2008: PhD student in PNA1 group at CWI in Amsterdam. 2007-2008: PhD student in Algorithms group at TU Eindhoven. 2008-2009: PostDoc in Combinatorial Optimization group at TU Eindhoven. 2009-2010: PostDoc in Discrete Optimization group at EPFL. 2013: habilitation. Since 2021: full professor.

Research

Topics

• Discrete Optimization,

• Location and Covering Problems,

• Network Design,

• LP-rounding Approximation Algorithms,

• Randomized Rounding Techniques.

Publications

• listing form DBLP,

• Google Scholar.

Awards

• STOC 2010 best paper award,

• Witold Lipski prize .

PhD students

• Bartosz Rybicki (graduated in 2016),

• Krzysztof Sornat (graduated in 2019),

• Mateusz Lewandowski (graduated in 2020),

• Jan Marcinkowski,

• Fateme Abbasi,

• Mansooreh Shoghi.

Postdocs

• Joachim Spoerhase (in 2016)

• Meesum Syed Mohammad (2017-2020)

• Martin Boehm (2020-2021)

• Sandip Banerjee

Teaching

• Theory of Linear and Integer Programming, spring of odd years,

• Algorithmic Game Theory, spring of even years,

• Consultations: room 244 (appointments via email please).

Other services

Conference organization

• ALGO 2014 (local co-chair)

PC membersip

• ESA 2017, 2022

• WAOA 2021

• LAGOS 2021

• APPROX 2020 (PC chair)

• ICALP (track A) 2019

• WADS 2019

• COCOON 2017, 2018, 2019

• TTCS 2017

• CIAC 2017

• FUN 2016

• MFCS 2015

• ISCO 2012

Invited talks

• 6PCC 2016

• FIT 2016

• COCOON 2015

Invited tutorials

• Hausdorff School on Combinatorial Optimization 2018

• A tutorial on network design, Bejing 2016

PhD courses

• in 2015 we organized a series of lectures for PhD students, some of the materials available there might still be useful.