Khaled Elbassioni
Khaled Elbassioni
Masdar Institute, Khalifa University of Science and Technology
ليس هناك بريد إلكتروني تم التحقق منه
عنوانعدد مرات الاقتباساتالسنة
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
Quality of service management in network gateways
C Akinlar, K Elbassioni, I Kamel
US Patent 7,802,008, 2010
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
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
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
Approximation algorithms for Euclidean group TSP
K Elbassioni, AV Fishkin, NH Mustafa, R Sitters
International Colloquium on Automata, Languages, and Programming, 1115-1126, 2005
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
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
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
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
Improved approximations for guarding 1.5-dimensional terrains
K Elbassioni, E Krohn, D Matijević, J Mestre, D Ševerdija
Algorithmica 60 (2), 451-463, 2011
A quasi-PTAS for profit-maximizing pricing on line graphs
K Elbassioni, R Sitters, Y Zhang
European Symposium on Algorithms, 451-462, 2007
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
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
Conflict-free colorings of rectangles ranges
K Elbassioni, NH Mustafa
Annual Symposium on Theoretical Aspects of Computer Science, 254-263, 2006
On profit-maximizing pricing for the highway and tollbooth problems
K Elbassioni, R Raman, S Ray, R Sitters
International Symposium on Algorithmic Game Theory, 275-286, 2009
A global parallel algorithm for the hypergraph transversal problem
L Khachiyan, E Boros, K Elbassioni, V Gurvich
Information Processing Letters 101 (4), 148-155, 2007
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
E Boros, K Elbassioni, V Gurvich, K Makino
International Conference on Integer Programming and Combinatorial …, 2010
Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems
E Boros, K Elbassioni, V Gurvich, L Khachiyan
International Conference on Integer Programming and Combinatorial …, 2004
An inequality for polymatroid functions and its applications
E Boros, K Elbassioni, V Gurvich, L Khachiyan
Discrete Applied Mathematics 131 (2), 255-281, 2003
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20