☰

Khaled M. Elbassioni, Ph.D. - Publications

Affiliations: 
2002 Rutgers University, New Brunswick, New Brunswick, NJ, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

57 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Elbassioni KM, Makino K. Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices Siam Journal On Discrete Mathematics. 34: 843-864. DOI: 10.1137/18M1198995  0.347
2020 Khonji M, Chau SC, Elbassioni K. Combinatorial Optimization of AC Optimal Power Flow With Discrete Demands in Radial Networks Ieee Transactions On Control of Network Systems. 7: 887-898. DOI: 10.1109/Tcns.2019.2951657  0.456
2020 Waniek M, Elbassioni KM, Pinheiro FL, Hidalgo CA, Alshamsi A. Computational aspects of optimal strategic network diffusion Theoretical Computer Science. 814: 153-168. DOI: 10.1016/J.Tcs.2020.01.027  0.412
2019 Almahmoud Z, Crandall J, Elbassioni K, Nguyen TT, Roozbehani M. Dynamic Pricing in Smart Grids Under Thresholding Policies Ieee Transactions On Smart Grid. 10: 3415-3429. DOI: 10.1109/Tsg.2018.2825997  0.369
2019 Elbassioni KM, Karapetyan A, Nguyen TT. Approximation schemes for r-weighted Minimization Knapsack problems Annals of Operations Research. 279: 367-386. DOI: 10.1007/S10479-018-3111-9  0.479
2019 Elbassioni KM, Makino K, Najy W. A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs Algorithmica. 81: 2377-2429. DOI: 10.1007/S00453-018-00539-4  0.46
2018 Khonji M, Chau C, Elbassioni K. Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks Ieee Transactions On Control of Network Systems. 5: 513-524. DOI: 10.1109/Tcns.2016.2622362  0.377
2017 Elbassioni K, Dumitrescu A. Computational Geometry Column 66 Sigact News. 48: 57-74. DOI: 10.1145/3173127.3173138  0.433
2017 Elbassioni K, Nguyen TT. A polynomial-time algorithm for computing low CP-rank decompositions Information Processing Letters. 118: 10-14. DOI: 10.1016/J.Ipl.2016.09.004  0.441
2017 Elbassioni KM, Nguyen TT. Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions Discrete Applied Mathematics. 230: 56-70. DOI: 10.1016/J.Dam.2017.06.020  0.456
2017 Boros E, Elbassioni K, Fouz M, Gurvich V, Makino K, Manthey B. Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions Algorithmica. 80: 3132-3157. DOI: 10.1007/S00453-017-0372-7  0.311
2016 Boros E, Elbassioni K, Gurvich V, Makino K. A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games Dynamic Games and Applications. 8: 22-41. DOI: 10.1007/S13235-016-0199-X  0.352
2016 Elbassioni K, Mehlhorn K, Ramezani F. Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design Theory of Computing Systems \/ Mathematical Systems Theory. 59: 641-663. DOI: 10.1007/S00224-016-9704-2  0.336
2015 Boros E, Elbassioni K, Gurvich V, Makino K, Oudalov V. Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden $$2 \times 2$$ 2 × 2 subgames International Journal of Game Theory. 45: 1111-1131. DOI: 10.1007/S00182-015-0513-7  0.325
2014 Elbassioni K, Hagen M, Rauf I. A Lower Bound for the HBC Transversal Hypergraph Generation Fundamenta Informaticae. 130: 409-414. DOI: 10.3233/Fi-2014-997  0.43
2014 Fouad MR, Elbassioni K, Bertino E. A supermodularity-based differential privacy preserving algorithm for data anonymization Ieee Transactions On Knowledge and Data Engineering. 26: 1591-1601. DOI: 10.1109/Tkde.2013.107  0.36
2014 Tiwary HR, Elbassioni K. Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism Graphs and Combinatorics. 30: 729-742. DOI: 10.1007/S00373-013-1299-7  0.418
2013 Boros E, Elbassioni K, Gurvich V, Makino K. On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness Operations Research Letters. 41: 357-362. DOI: 10.1016/J.Orl.2013.04.006  0.38
2013 Boros E, Elbassioni K, Gurvich V, Makino K. On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games Dynamic Games and Applications. 3: 128-161. DOI: 10.1007/S13235-013-0075-X  0.32
2012 Elbassioni K, Matijević D, Ševerdija D. Guarding 1.5D terrains with demands International Journal of Computer Mathematics. 89: 2143-2151. DOI: 10.1080/00207160.2012.707800  0.456
2012 Elbassioni K, Raman R, Ray S, Sitters R. On the complexity of the highway problem Theoretical Computer Science. 460: 70-77. DOI: 10.1016/J.Tcs.2012.07.028  0.437
2012 Elbassioni K, Jeli S, Matijevi D. The relation of Connected Set Cover and Group Steiner Tree Theoretical Computer Science. 438: 96-101. DOI: 10.1016/J.Tcs.2012.02.035  0.464
2012 Boros E, Elbassioni K, Gurvich V, Makino K. On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games Discrete Mathematics. 312: 772-788. DOI: 10.1016/J.Disc.2011.11.011  0.304
2012 Ajwani D, Elbassioni K, Govindarajan S, Ray S. Conflict-free coloring for rectangle ranges using O(n .382) colors Discrete and Computational Geometry. 48: 39-52. DOI: 10.1007/S00454-012-9425-5  0.328
2011 Elbassioni KM, Elmasry A, Makino K. Finding Simplices Containing The Origin In Two And Three Dimensions International Journal of Computational Geometry and Applications. 21: 495-506. DOI: 10.1142/S0218195911003779  0.376
2011 Althaus E, Canzar S, Elbassioni K, Karrenbauer A, Mestre J. Approximation Algorithms for the Interval Constrained Coloring Problem Algorithmica. 61: 342-361. DOI: 10.1007/S00453-010-9406-0  0.414
2011 Elbassioni K, Krohn E, Matijević D, Mestre J, Ševerdija D. Improved Approximations for Guarding 1.5-Dimensional Terrains Algorithmica. 60: 451-463. DOI: 10.1007/S00453-009-9358-4  0.454
2010 Boros E, Elbassioni K, Makino K. Left-to-right multiplication for monotone Boolean dualization Siam Journal On Computing. 39: 3424-3439. DOI: 10.1137/080734881  0.411
2010 Boros E, Elbassioni K, Gurvich V, Makino K. On effectivity functions of game forms Games and Economic Behavior. 68: 512-531. DOI: 10.1016/J.Geb.2009.09.002  0.337
2010 Elbassioni K, Rauf I. Polynomial-time dualization of r-exact hypergraphs with applications in geometry Discrete Mathematics. 310: 2356-2363. DOI: 10.1016/J.Disc.2010.05.017  0.414
2010 Boros E, Elbassioni K, Gurvich V, Tiwary HR. The negative cycles polyhedron and hardness of checking some polyhedral properties Annals of Operations Research. 188: 63-76. DOI: 10.1007/S10479-010-0690-5  0.401
2009 Raman R, Elbassioni KM, Ray S, Sitters RA. On profit-maximizing pricing for the highway and tollbooth problems Lecture Notes in Computer Science. 5814: 275-286. DOI: 10.1007/978-3-642-04645-2_25  0.351
2008 Elbassioni KM. Algorithms for dualization over products of partially ordered sets Siam Journal On Discrete Mathematics. 23: 487-510. DOI: 10.1137/050622250  0.456
2008 Kutz M, Elbassioni K, Katriel I, Mahajan M. Simultaneous matchings: Hardness and approximation Journal of Computer and System Sciences. 74: 884-897. DOI: 10.1016/J.Jcss.2008.02.001  0.43
2008 Elbassioni KM. A note on systems with max-min and max-product constraints Fuzzy Sets and Systems. 159: 2272-2277. DOI: 10.1016/J.Fss.2008.02.020  0.385
2008 Elbassioni KM. On the complexity of monotone dualization and generating minimal hypergraph transversals Discrete Applied Mathematics. 156: 2109-2123. DOI: 10.1016/J.Dam.2007.05.030  0.498
2008 Khachiyan L, Boros E, Elbassioni K, Gurvich V. Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions Discrete Applied Mathematics. 156: 2020-2034. DOI: 10.1016/J.Dam.2007.04.018  0.678
2008 Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V. Generating All Vertices of a Polyhedron Is Hard Discrete & Computational Geometry. 39: 174-190. DOI: 10.1007/S00454-008-9050-5  0.481
2008 Khachiyan L, Boros E, Elbassioni K, Gurvich V. On enumerating minimal dicuts and strongly connected subgraphs Algorithmica (New York). 50: 159-172. DOI: 10.1007/S00453-007-9074-X  0.716
2008 Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Rudolf G, Zhao J. On short paths interdiction problems: Total and node-wise limited interdiction Theory of Computing Systems. 43: 204-233. DOI: 10.1007/S00224-007-9025-6  0.694
2007 Khachiyan L, Boros E, Borys K, Elbassioni K, Gurvich V, Makino K. ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(the 50th Anniversary of the Operations Research Society of Japan) Journal of the Operations Research Society of Japan. 50: 325-338. DOI: 10.15807/Jorsj.50.325  0.612
2007 Khachiyan L, Boros E, Gurvich V, Elbassioni K. Computing many maximal independent sets for hypergraphs in parallel Parallel Processing Letters. 17: 141-152. DOI: 10.1142/S0129626407002934  0.662
2007 Khachiyan L, Boros E, Elbassioni K, Gurvich V. On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs Theoretical Computer Science. 382: 139-150. DOI: 10.1016/J.Tcs.2007.03.005  0.691
2007 Khachiyan L, Boros E, Elbassioni K, Gurvich V. A global parallel algorithm for the hypergraph transversal problem Information Processing Letters. 101: 148-155. DOI: 10.1016/J.Ipl.2006.09.006  0.715
2006 Elbassioni K, Lotker Z, Seidel R. Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices Information Processing Letters. 100: 69-71. DOI: 10.1016/J.Ipl.2006.05.011  0.345
2006 Elbassioni KM. Finding all minimal infrequent multi-dimensional intervals Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3887: 423-434. DOI: 10.1007/11682462_40  0.358
2006 Boros E, Elbassioni K, Gurvich V. Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms Journal of Graph Theory. 53: 209-232. DOI: 10.1002/Jgt.V53:3  0.454
2005 Khachiyan L, Boros E, Elbassioni K, Gurvich V, Makino K. On the complexity of some enumeration problems for matroids Siam Journal On Discrete Mathematics. 19: 966-984. DOI: 10.1137/S0895480103428338  0.721
2005 Elbassioni K, Elmasry A, Kamel I. An Indexing Method for Answering Queries on Moving Objects Distributed and Parallel Databases. 17: 215-249. DOI: 10.1007/S10619-005-6830-2  0.372
2004 Boros E, Elbassioni KM, Gurvich V, Khachiyan L. An Efficient Implementation of a Joint Generation Algorithm Lecture Notes in Computer Science. 114-128. DOI: 10.1007/978-3-540-24838-5_9  0.704
2003 Boros E, Elbassioni K, Gurvich V, Khachiyan L. An inequality for polymatroid functions and its applications Discrete Applied Mathematics. 131: 255-281. DOI: 10.1016/S0166-218X(02)00455-9  0.639
2003 Boros E, Elbassioni K, Gurvich V, Khachiyan L. Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices Mathematical Programming. 98: 355-368. DOI: 10.1007/S10107-003-0408-4  0.667
2002 Boros E, Elbassioni K, Gurvich V, Khachiyan L, Makino K. Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities Siam Journal On Computing. 31: 1624-1643. DOI: 10.1137/S0097539701388768  0.713
2002 Boros E, Elbassioni K, Gurvich V, Khachiyan L. Generating dual-bounded hypergraphs Optimization Methods and Software. 17: 749-781. DOI: 10.1080/1055678021000060801  0.698
2002 Elbassioni KM. An algorithm for dualization in products of lattices and its applications Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2461: 424-435.  0.411
2002 Elbassioni KM. On dualization in products of forests Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2285: 142-153.  0.314
2000 Boros E, Gurvich V, Elbassioni K, Khachiyan L. An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension Parallel Processing Letters. 10: 253-266. DOI: 10.1142/S0129626400000251  0.722
Show low-probability matches.