About the Authors
Abbas Bazzi
Software engineer
Google, Zürich, Switzerland
bazzi[ta]google[td]com
Software engineer
Google, Zürich, Switzerland
bazzi[ta]google[td]com
Abbas Bazzi graduated from EPFL in 2017; his advisor was Ola Svensson.
His thesis focused on the strength and limitations of Linear Programming relaxations. After finishing his Ph.D., he joined Google Zürich as Software Engineer.
Samuel Fiorini
Associate professor
Université libre de Bruxelles
Brussels, Belgium
sfiorini[ta]ulb[td]ac[td]be
homepages.ulb.ac.be/~sfiorini/
Associate professor
Université libre de Bruxelles
Brussels, Belgium
sfiorini[ta]ulb[td]ac[td]be
homepages.ulb.ac.be/~sfiorini/
Samuel Fiorini graduated from Université libre de Bruxelles (ULB, Brussels) in 2001 under the supervision of Jean-Paul Doignon. He has held research positions at CWI, MIT, and GERAD - HEC Montreal. In 2005, he joined the faculty of the Department of Mathematics and
the Department of Computer Science at ULB. His research focuses on combinatorial optimization, more precisely polyhedral combinatorics and approximation algorithms. He is the principal investigator of the ERC grant FOREFRONT,
focusing on extended formulations. In addition to spending time with his family, windsurfing and climbing bring balance to his life.
Sangxia Huang
Research scientist
Sony Mobile Communications
Lund, Sweden
huang[td]sangxia[ta]gmail[td]com
http://huang.sangxia.info/home
Research scientist
Sony Mobile Communications
Lund, Sweden
huang[td]sangxia[ta]gmail[td]com
http://huang.sangxia.info/home
Sangxia Huang graduated from KTH Royal Institute of Technology
in 2015 under the supervision of Johan Håstad.
The topic of his thesis is hardness
of approximation and probabilistically checkable proofs.
He worked as a postdoc at EPFL in Ola Svensson's group for two years.
He then returned to Sweden and joined Sony Mobile Communications as a research
engineer in machine learning.
Ola Svensson
Assistant professor
EPFL, Lausanne, Switzerland
ola[td]svensson[ta]epfl[td]ch
theory.epfl.ch/osven/
Assistant professor
EPFL, Lausanne, Switzerland
ola[td]svensson[ta]epfl[td]ch
theory.epfl.ch/osven/
Ola Svensson (not to be confused with the singer
Ola Svensson)
graduated from IDSIA in 2009; his advisor was
Monaldo Mastrolilli.
The subject of his thesis was
the approximability of graph and scheduling problems.
After spending two years as a postdoc with
Johan Håstad at
KTH Royal Institute of Technology, Sweden,
he is now back in Switzerland as an assistant professor in the
theory group at
EPFL. Apart from doing
research, he enjoys the Alps that are in complete contrast to the flat
but still beautiful landscape in South Sweden where he grew up.