/* This is the template for an ALGO member's page */ /* The image that goes into the square on the right. See bottom of http://algo.epfl.ch/en/private/howto for how-to create the image. Once ready, you can upload the image with the standard button (the forth from the right up here) Note the white space preceding the image address. This because the image has to be right-aligned in order to be placed in the correct place. */ {{ :en:group:members:rimg_ola.jpg|Portrait of Ola}} /* Here you should write the content of the page (and remove the lorem ipsum placeholder */ Ola Svensson received his M.Sc. degree in Computer Science from the University of Uppsala in May 2005. His major was on theoretical aspects of computer science and in particular algorithms. Ola received his PhD from IDSIA affiliated to the University of Lugano in 2009 for which he worked on approximation algorithms and inapproximability results for combinatorial optimization problems. Research interests include: approximation algorithms, combinatorial optimization, computational complexity and scheduling. [[http://algo.epfl.ch/~osven|personal home page]] /* This is the database entry used to auto-generate some other page (e.g. the members listing page). - the dates should be in the form YYYY-MM-DD; - listgroup is used for sorting in the members listing page (a_amin for amin, b_NAME for natascha and invited profs, c_NAME for post-docs, d_NAME for phD students, e_NAME for developers - status can be active or past - table must be "members" */ ---- dataentry member ---- title : Dr. fullname : Ola Svensson link_title : en:group:members:ola|Ola Svensson birthday_dt : 1981-11-15 join_dt : 2011-07-01 left_dt : 2012-12-31 webpage_url : http://theory.epfl.ch/osven/|Ola Svensson portrait_media : en:group:members:rimg_ola.jpg avatar_img64 : en:group:members:rimg_ola.jpg email_mail : ola.svensson@epfl.ch tel : +41 21 693 13 16 position : Post-Doc listgroup : c_svensson state : past table : members Summary : Ola Svensson received his M.Sc. degree in Computer Science from the University of Uppsala in May 2005. His major was on theoretical aspects of computer science and in particular algorithms. Ola received his PhD from IDSIA affiliated to the University of Lugano in 2009 for which he worked on approximation algorithms and inapproximability results for combinatorial optimization problems.Research interests include: approximation algorithms, combinatorial optimization, computational complexity and scheduling.He is currently a professor in the Theory Group at EPFL. ----