Seguir
Khaled Elbassioni
Khaled Elbassioni
Masdar Institute, Khalifa University of Science and Technology
Nenhum email confirmado
Título
Citado por
Citado por
Ano
Generating all vertices of a polyhedron is hard
L Khachiyan, E Boros, K Borys, V Gurvich, K Elbassioni
Discrete & Computational Geometry 39, 174–190, 2009
2462009
Quality of service management in network gateways
C Akinlar, K Elbassioni, I Kamel
US Patent 7,802,008, 2010
1832010
Charge group partitioning in biomolecular simulation
S Canzar, M El-Kebir, R Pool, K Elbassioni, AK Malde, AE Mark, ...
Journal of Computational Biology 20 (3), 188-198, 2013
1712013
On short paths interdiction problems: Total and node-wise limited interdiction
L Khachiyan, E Boros, K Borys, K Elbassioni, V Gurvich, G Rudolf, J Zhao
Theory of Computing Systems 43 (2), 204-233, 2008
1382008
Autonomous recharging and flight mission planning for battery-operated autonomous drones
R Alyassi, M Khonji, A Karapetyan, SCK Chau, K Elbassioni, CM Tseng
IEEE Transactions on Automation Science and Engineering 20 (2), 1034-1046, 2022
1232022
A unified online deep learning prediction model for small signal and transient stability
SK Azman, YJ Isbeih, MS El Moursi, K Elbassioni
IEEE transactions on power systems 35 (6), 4585-4598, 2020
1022020
On the complexity of some enumeration problems for matroids
L Khachiyan, E Boros, K Elbassioni, V Gurvich, K Makino
SIAM Journal on Discrete Mathematics 19 (4), 966-984, 2005
952005
Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities
E Boros, K Elbassioni, V Gurvich, L Khachiyan, K Makino
SIAM Journal on Computing 31 (5), 1624-1643, 2002
802002
Approximation algorithms for Euclidean group TSP
K Elbassioni, AV Fishkin, NH Mustafa, R Sitters
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
782005
An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension
E Boros, V Gurvich, K Elbassioni, L Khachiyan
Parallel Processing Letters 10 (04), 253-266, 2000
752000
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
L Khachiyan, E Boros, K Elbassioni, V Gurvich
Discrete Applied Mathematics 154 (16), 2350-2372, 2006
722006
Flight tour planning with recharging optimization for battery-operated autonomous drones
CM Tseng, CK Chau, KM Elbassioni, M Khonji
CoRR, abs/1703.10049, 2017
702017
Generating maximal independent sets for hypergraphs with bounded edge-intersections
E Boros, K Elbassioni, V Gurvich, L Khachiyan
Latin American Symposium on Theoretical Informatics, 488-498, 2004
642004
Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
K Elbassioni, AV Fishkin, R Sitters
International Journal of Computational Geometry & Applications 19 (02), 173-193, 2009
632009
Drive mode optimization and path planning for plug-in hybrid electric vehicles
CK Chau, K Elbassioni, CM Tseng
IEEE Transactions on Intelligent Transportation Systems 18 (12), 3421-3432, 2017
592017
Improved approximations for guarding 1.5-dimensional terrains
K Elbassioni, E Krohn, D Matijević, J Mestre, D Ševerdija
Algorithmica 60, 451-463, 2011
582011
Peer-to-peer energy sharing: Effective cost-sharing mechanisms and social efficiency
SCK Chau, J Xu, W Bow, K Elbassioni
Proceedings of the Tenth ACM International Conference on Future Energy …, 2019
492019
A quasi-PTAS for profit-maximizing pricing on line graphs
K Elbassioni, R Sitters, Y Zhang
European Symposium on Algorithms, 451-462, 2007
422007
Conflict-free coloring for rectangle ranges using O(n.382) colors
D Ajwani, K Elbassioni, S Govindarajan, S Ray
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007
392007
A competitive scheduling algorithm for online demand response in islanded microgrids
A Karapetyan, M Khonji, SCK Chau, K Elbassioni, H Zeineldin, ...
IEEE Transactions on Power Systems 36 (4), 3430-3440, 2020
372020
O sistema não pode efectuar a operação agora. Tente mais tarde.
Artigos 1–20