Dr. Khaled Elbassioni

Dr. Khaled Elbassioni

Dr. Khaled Elbassioni joined Masdar Institute (part of Khalifa University of Science and Technology since 2017) as an associate professor in 2012. He received BS and MS degrees in Computer Science from Alexandria University, Egypt, and a PhD degree in Computer Science from Rutgers University, USA. From 2006 to 2012, he was a senior researcher at Max-Planck Institute for Informatics, Saarbruecken, Germany.

Dr. Elbassioni’s main research interests are in the design and analysis of algorithms, with special focus on developing efficient algorithms for large-scale optimization problems and stochastic games. He has more than 100 papers in refereed conferences and journals. He has served on the technical program committees of a number of international conferences, and has been a guest editor for two special issues of the journals Algorithmica and the International Journal on Computational Geometry & Applications.

Students advised:

  • Imran Rauf, PhD, University of Saarland, Germany, 2011
  • Mukesh Jha, MSc, Masdar Institute, 2014
  • Areg Karapetyan, MSc, Masdar Institute, 2015
  • Fahimeh Ramezani, PhD, University of Saarland, Germany, 2015
  • Zaid Almahmoud, MSc, Masdar Institute, 2016
  • Gahneya Al Darei, MSc, Masdar Institute, 2016
  • Waleed Najy, PhD, Masdar Institute (A part of Khalifa University of Science and Technology), 2017

Current students:

  • Areg Karapetyan, PhD, Masdar Institute (a part of Khalifa University of Science and Technology)
  • BS and MS degrees in Computer Science from Alexandria University, Egypt,
  • PhD degree in Computer Science from Rutgers University, USA.
  • CIS507 Design and Analysis of Algorithms
  • CIS619 Topics in Algorithmic Game Theory
  • CIS622 Efficient Algorithms for Convex Programming
  • Research interests: Design and analysis of algorithms, continuous and discrete optimization, algorithmic game theory

Current Projects:

  • Optimal Power Flow in Radial AC Distribution Networks with Discrete Demands
  • Approximation Schemes for Packing and Covering Semi-infinite and Semi-definite Programs

Selected Journal Publications:

  • E. Boros, K. Elbassioni, V. Gurvich, K. Makino. A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. Dynamic Games and Applications 8(1): 22-41 (2018)
  • M. Khonji, C.-K. Chau, K. Elbassioni. Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks. IEEE Trans. Control of Network Systems 5(1): 513-524 (2018)
  • K. Elbassioni and T. T. Nguyen. Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions, Discrete Applied Mathematics 230: 56-70 (2017).
  • K. Elbassioni, K. Mehlhorn and F. Ramezani. Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design, Theory of Computing Systems 59(4): 641-663 (2016).
  • C-K. Chau, K. Elbassioni and M. Khonji. Truthful Mechanisms for Combinatorial Allocation of Alternating Current Electric Power, ACM Transactions on Algorithms and Computation 5(1): 7:1-7:29 (2016).
  • S. Canzar, M. El-Kebir, R. Pool, K. Elbassioni, A. K. Malde, A. E. Mark, D. P. Geerke, L. Stougie and G. W. Klau. Charge Group Partitioning in Biomolecular Simulation, Journal of Computational Biology 20(3): 188-198 (2013).
  • D. Ajwani, K. Elbassioni, S. Govindarajan and S. Ray. Conflict-Free Coloring for Rectangle Ranges Using $O(n^{.382+\epsilon}) Colors, Discrete & Computational Geometry 48(1): 39-52 (2012).
  • K. Elbassioni, E. Krohn, D. Matijevic, J. Mestre and D. Severdija. Improved Approximations for Guarding 1.5-Dimensional Terrains, Algorithmica, 60(2): 451-463, 2011.
  • L. Khachiyan, E. Boros, K. Borys, K. Elbassioni and V. Gurvich. Generating All Vertices of a Polyhedron is Hard, Discrete & Computational Geometry 39(1-3): 174-190, 2008.
  • L. Khachiyan, E. Boros, K. Borys, K. Elbassioni,  V. Gurvich, G. Rudolf and J. Zhao. On short paths interdiction problems: Total and node-wise limited interdiction, Theory of Computing Systems 43(2): 204-233, 2008.
  • E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino. Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities, SIAM Journal on Computing 31(5):1621–1643, 2002.

Selected Conference Publications:

  • K. Elbassioni. Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-dimension, in Proceedings of the 33rd Annual Symposium on Computational geometry (SOCG 2017), pp. 40:1-40:15.
  • C-K. Chau, K. Elbassioni and C.-M. Tseng. Fuel minimization of plug-in hybrid electric vehicles by optimizing drive mode selection, in Proceedings of the 7th International Conference on Future Energy Systems (e-Energy 2016), pp. 13:1-13:11.
  • K. Elbassioni, K. Makino and W. Najy. A Multiplicative Weights Update Algorithm for Packing and Covering Semi-Infinite Linear Programs, in Proceedings of the the 14th Workshop on Approximation and Online Algorithms (WAOA 2016), LNCS 10138, pp. 78-91.
  • E. Boros, K. Elbassioni, V. Gurvich and K. Makino. A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions, in Proceedings of Automata, Languages and Programming, 39-th International Colloquium (ICALP 2013), LNCS 7965, pp.  220-231.
  • K. Elbassioni, K. Paluch and A. van Zuylen. Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem, in Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012),  LIPIcs 14, pp. 501-506.
  • K. Elbassioni, R. Raman, S. Ray and R. Sitters. On the approximability of the maximum feasible subsystem problem with 0/1-coefficients, in Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 1210-1219.
  • K. Elbassioni, A. V. Fishkin, N. H. Mustafa and R. Sitters. Approximation Algorithms for Euclidean Group TSP, in Proceedings of Automata, Languages and Programming, 28-th International Colloquium, ICALP 2005, LNCS 3580, pp. 1115-1126.
  • E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino. On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities, in Proceedings of Automata, Languages and Programming, 28th International Colloquium (ICALP 2001), Lecture Notes in Computer Science (LNCS) 2076, pp. 92-103.

New to site? Create an Account


Login

Lost password? (close)

Already have an account? Login


Signup

(close)