Khaled Elbassioni Department of Electrical Engineering and Computer Science

Computing & Information Science
Email : - This email address is being protected from spambots. You need JavaScript enabled to view it.


Phone number: +971 2 810 9349

Dr. Khaled Elbassioni is an associate professor at Masdar Institute. He received B.S. and M.S. degrees in Computer Science from Alexandria University, Egypt, and a Ph.D. degree in Computer Science from Rutgers University, USA.   

From 2006 to 2012, he was a senior researcher at Max-Planck Institute for Informatics, Saarbruecken. His main research interests are in Theoretical Computer Science, in particular, in the complexity of enumeration problems, approximation algorithms, optimization and game theory.

For further details, please refer to Dr. Khaled Elbassioni’s home page:



  • Design and Analysis of Algorithms, planned for Spring 2013
  • Algorithmic Game Theory, planned for Fall 2013

Advisor to Current Masdar Institute Students:

  • Andor Kovacs   
  • Mukesh Jha
  • Aishah Mohamed Abdulla Ghaseb Al Yammahi   




Research Interest/Research Projects

  • Approximation algorithms for hard geometric optimization problems: e.g. TSP with neighbourhoods, guarding problems
  • Approximation algorithms for optimization problems arising in Bioinformatics: e.g. matching of live cell video, charge group partitioning
  • Computational and algorithmic  game theory: e.g. stochastic games, pricing problems for combinatorial auctions
  • Combinatorial optimization
  • Enumeration algorithms: e.g. enumerating vertices of polyhedral and minimal hypergraph transversals


Selected Publications

  • T.-H. Hubert Chan, Khaled M. Elbassioni: A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. Discrete & Computational Geometry 46(4): 704-723 (2011)
  • Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. Integer Programming and Combinatorial Optimization, 14th International Conference (IPCO 2010): 341-354
  • Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating All Vertices of a Polyhedron Is Hard. Discrete & Computational Geometry 39(1-3): 174-190 (2008)