default search action
Khaled M. Elbassioni
Khaled Elbassioni
Person information
- affiliation: Khalifa University, Masdar Institute, Abu Dhabi, UAE
- affiliation: Masdar Institute of Science and Technology, Department of Electrical Engineering and Computer Science, Abu Dhabi, UAE
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j96]Khaled Elbassioni, Saurabh Ray:
Geometric Stabbing via Threshold Rounding and Factor Revealing LPs. Discret. Comput. Geom. 71(3): 787-822 (2024) - [j95]Mislav Blazevic, Stefan Canzar
, Khaled Elbassioni, Domagoj Matijevic
Anti Tai mapping for unordered labeled trees. Inf. Process. Lett. 185: 106454 (2024) - [j94]Andrés Abeliuk
Price of Anarchy in Algorithmic Matching of Romantic Partners. ACM Trans. Economics and Comput. 12(1): 2:1-2:25 (2024) - [c85]Trung Thanh Nguyen, Khaled Elbassioni, Jörg Rothe:
Complexity and Approximation Schemes for Social Welfare Maximization in the High-Multiplicity Setting. ECAI 2024: 3324-3331 - [i46]Khaled Elbassioni:
Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities. CoRR abs/2407.02201 (2024) - 2023
- [j93]Areg Karapetyan
Approximations for generalized unsplittable flow on paths with application to power systems optimization. Ann. Oper. Res. 320(1): 173-204 (2023) - [j92]Khaled Elbassioni
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces. Oper. Res. Lett. 51(5): 507-514 (2023) - [j91]Rashid Alyassi, Majid Khonji
Autonomous Recharging and Flight Mission Planning for Battery-Operated Autonomous Drones. IEEE Trans Autom. Sci. Eng. 20(2): 1034-1046 (2023) - [j90]Trung Thanh Nguyen
Jamming-Based Covert Communication for Rate-Splitting Multiple Access. IEEE Trans. Veh. Technol. 72(8): 11074-11079 (2023) - [j89]Trung Thanh Nguyen
Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems. IEEE Trans. Veh. Technol. 72(11): 14673-14687 (2023) - [c84]Bushra Alshehhi
DClEVerNet: Deep Combinatorial Learning for Efficient EV Charging Scheduling in Large-scale Networked Facilities. e-Energy 2023: 287-298 - [c83]Trung Thanh Nguyen, Nguyen Cong Luong, Shaohan Feng, Khaled Elbassioni, Dusit Niyato, Dong In Kim:
Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems. GLOBECOM 2023: 6675-6680 - [i45]Nassim Nicholas Taleb, Pierre A. Zalloua, Khaled Elbassioni, Andreas Henschel, Daniel E. Platt:
Informational Rescaling of PCA Maps with Application to Genetic Distance. CoRR abs/2303.12654 (2023) - [i44]Trung Thanh Nguyen, Nguyen Cong Luong, Shaohan Feng, Tien-Hoa Nguyen, Khaled M. Elbassioni, Dusit Niyato, Dong In Kim:
Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems. CoRR abs/2303.17392 (2023) - [i43]Bushra Alshehhi, Areg Karapetyan, Khaled M. Elbassioni, Sid Chi-Kin Chau, Majid Khonji:
DClEVerNet: Deep Combinatorial Learning for Efficient EV Charging Scheduling in Large-scale Networked Facilities. CoRR abs/2305.11195 (2023) - [i42]Trung Thanh Nguyen, Khaled Elbassioni, Areg Karapetyan, Majid Khonji:
Improved Approximation Guarantees for Power Scheduling Problems With Sum-of-Squares Constraints. CoRR abs/2312.15432 (2023) - 2022
- [j88]Khaled M. Elbassioni
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations. Algorithmica 84(12): 3622-3654 (2022) - [j87]Khaled M. Elbassioni:
On Dualization over Distributive Lattices. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j86]Khaled M. Elbassioni
Finding Sparse Solutions for Packing and Covering Semidefinite Programs. SIAM J. Optim. 32(2): 321-353 (2022) - [j85]Khaled M. Elbassioni:
Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs. Theor. Comput. Sci. 902: 64-75 (2022) - [j84]Trung Thanh Nguyen, Khaled M. Elbassioni
Access Management in Joint Sensing and Communication Systems: Efficiency Versus Fairness. IEEE Trans. Veh. Technol. 71(5): 5128-5142 (2022) - 2021
- [j83]Trung Thanh Nguyen
A PTAS for a class of binary non-linear programs with low-rank functions. Oper. Res. Lett. 49(5): 633-638 (2021) - [j82]Kristóf Bérczi, Endre Boros, Ondrej Cepek
Generating clause sequences of a CNF formula. Theor. Comput. Sci. 856: 68-74 (2021) - [j81]Khaled M. Elbassioni:
A QPTAS for ɛ-Envy-Free Profit-Maximizing Pricing on Line Graphs. ACM Trans. Economics and Comput. 9(3): 16:1-16:31 (2021) - [i41]Khaled M. Elbassioni, Saurabh Ray:
Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems. CoRR abs/2106.12385 (2021) - [i40]Mislav Blazevic, Stefan Canzar, Khaled M. Elbassioni, Domagoj Matijevic:
Anti Tai Mapping for Unordered Labeled Trees. CoRR abs/2107.08292 (2021) - [i39]Trung Thanh Nguyen, Khaled M. Elbassioni, Nguyen Cong Luong, Dusit Niyato, Dong In Kim:
Access Management in Joint Sensing and Communication Systems: Efficiency versus Fairness. CoRR abs/2111.04217 (2021) - 2020
- [j80]Khaled M. Elbassioni
Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices. SIAM J. Discret. Math. 34(1): 843-864 (2020) - [j79]Majid Khonji
Combinatorial Optimization of AC Optimal Power Flow With Discrete Demands in Radial Networks. IEEE Trans. Control. Netw. Syst. 7(2): 887-898 (2020) - [j78]Marcin Waniek
Computational aspects of optimal strategic network diffusion. Theor. Comput. Sci. 814: 153-168 (2020) - [j77]Areg Karapetyan, Sid Chi-Kin Chau
Multisensor Adaptive Control System for IoT-Empowered Smart Lighting with Oblivious Mobile Sensors. ACM Trans. Sens. Networks 16(1): 11:1-11:21 (2020) - [c82]Khaled M. Elbassioni
Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations. LATIN 2020: 27-37 - [i38]Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino:
Generating clause sequences of a CNF formula. CoRR abs/2002.06727 (2020) - [i37]Khaled M. Elbassioni:
On Dualization over Distributive Lattices. CoRR abs/2006.15337 (2020) - [i36]Sid Chi-Kin Chau, Khaled M. Elbassioni, Yue Zhou:
Approximately Socially-Optimal Decentralized Coalition Formation. CoRR abs/2009.08632 (2020)
2010 – 2019
- 2019
- [j76]Khaled M. Elbassioni
A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs. Algorithmica 81(6): 2377-2429 (2019) - [j75]Khaled M. Elbassioni
Approximation schemes for r-weighted Minimization Knapsack problems. Ann. Oper. Res. 279(1-2): 367-386 (2019) - [j74]Endre Boros, Khaled M. Elbassioni
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. Inf. Comput. 267: 74-95 (2019) - [j73]Majid Khonji
Complex-demand scheduling problem with application in smart grid. Theor. Comput. Sci. 761: 34-50 (2019) - [j72]Khaled M. Elbassioni
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs. Theor. Comput. Sci. 767: 26-33 (2019) - [j71]Zaid Almahmoud
Dynamic Pricing in Smart Grids Under Thresholding Policies. IEEE Trans. Smart Grid 10(3): 3415-3429 (2019) - [c81]Sid Chi-Kin Chau
Peer-to-Peer Energy Sharing: Effective Cost-Sharing Mechanisms and Social Efficiency. e-Energy 2019: 215-225 - [c80]Khaled M. Elbassioni
Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs. ESA 2019: 43:1-43:15 - [c79]Van Hoan Do, Mislav Blazevic, Pablo Monteagudo, Luka Borozan, Khaled M. Elbassioni, Sören Laue, Francisca Rojas Ringeling, Domagoj Matijevic, Stefan Canzar:
Dynamic Pseudo-time Warping of Complex Single-Cell Trajectories. RECOMB 2019: 294-296 - [i35]Andrés Abeliuk, Khaled M. Elbassioni, Talal Rahwan, Manuel Cebrián, Iyad Rahwan:
Price of Anarchy in Algorithmic Matching of Romantic Partners. CoRR abs/1901.03192 (2019) - [i34]Khaled M. Elbassioni:
Quasi-polynomial Algorithms for List-coloring of Nearly Intersecting Hypergraphs. CoRR abs/1904.02425 (2019) - [i33]Khaled M. Elbassioni:
Some Black-box Reductions for Objective-robust Discrete Optimization Problems Based on their LP-Relaxations. CoRR abs/1907.06786 (2019) - 2018
- [j70]Endre Boros, Khaled M. Elbassioni
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions. Algorithmica 80(11): 3132-3157 (2018) - [j69]Endre Boros, Khaled M. Elbassioni
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games. Dyn. Games Appl. 8(1): 22-41 (2018) - [j68]Stefan Canzar
On the approximability of the maximum interval constrained coloring problem. Discret. Optim. 27: 57-72 (2018) - [j67]Majid Khonji
Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks. IEEE Trans. Control. Netw. Syst. 5(1): 513-524 (2018) - [j66]Chi-Kin Chau
Quantifying Inefficiency of Fair Cost-Sharing Mechanisms for Sharing Economy. IEEE Trans. Control. Netw. Syst. 5(4): 1809-1818 (2018) - [j65]Areg Karapetyan
Efficient Algorithm for Scalable Event-Based Demand Response Management in Microgrids. IEEE Trans. Smart Grid 9(4): 2714-2725 (2018) - [c78]Majid Khonji
Challenges in Scheduling Electric Vehicle Charging with Discrete Charging Rates in AC Power Networks. e-Energy 2018: 183-186 - [c77]Majid Khonji
Approximation Scheduling Algorithms for Electric Vehicle Charging with Discrete Charging Options. e-Energy 2018: 579-585 - [c76]Areg Karapetyan
Smart lighting control using oblivious mobile sensors. BuildSys@SenSys 2018: 158-167 - [c75]Majid Khonji, Sid Chi-Kin Chau
Combinatorial Optimization of Electric Vehicle Charging in AC Power Distribution Networks. SmartGridComm 2018: 1-6 - [c74]Khaled M. Elbassioni
Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices. SWAT 2018: 18:1-18:14 - [i32]Marcin Waniek, Khaled M. Elbassioni, Flávio L. Pinheiro
Computational Aspects of Optimal Strategic Network Diffusion. CoRR abs/1809.03141 (2018) - [i31]Khaled M. Elbassioni, Kazuhisa Makino:
Finding Sparse Solutions for Packing and Covering Semidefinite Programs. CoRR abs/1809.09698 (2018) - 2017
- [j64]Khaled M. Elbassioni
Guest Editors' Foreword. Algorithmica 79(3): 884-885 (2017) - [j63]Khaled M. Elbassioni
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions. Discret. Appl. Math. 230: 56-70 (2017) - [j62]Mark de Berg
Guest Editors' Foreword. Int. J. Comput. Geom. Appl. 27(1-2): 1-2 (2017) - [j61]Endre Boros
A nested family of \(\varvec{k}\) -total effective rewards for positional games. Int. J. Game Theory 46(1): 263-293 (2017) - [j60]Khaled M. Elbassioni
A polynomial-time algorithm for computing low CP-rank decompositions. Inf. Process. Lett. 118: 10-14 (2017) - [j59]Endre Boros, Khaled M. Elbassioni
A convex programming-based algorithm for mean payoff stochastic games with perfect information. Optim. Lett. 11(8): 1499-1512 (2017) - [j58]Khaled M. Elbassioni, Adrian Dumitrescu:
Computational Geometry Column 66. SIGACT News 48(4): 57-74 (2017) - [j57]Chi-Kin Chau
Drive Mode Optimization and Path Planning for Plug-In Hybrid Electric Vehicles. IEEE Trans. Intell. Transp. Syst. 18(12): 3421-3432 (2017) - [c73]Khaled M. Elbassioni
Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension. SoCG 2017: 40:1-40:15 - [c72]Vahid Hashemi
Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs. SETTA 2017: 25-41 - [r2]Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
Indexing Schemes for Multidimensional Moving Objects. Encyclopedia of GIS 2017: 947-954 - [i30]Chien-Ming Tseng, Chi-Kin Chau, Khaled M. Elbassioni, Majid Khonji:
Flight Tour Planning with Recharging Optimization for Battery-operated Autonomous Drones. CoRR abs/1703.10049 (2017) - [i29]Khaled M. Elbassioni, Kazuhisa Makino:
Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices. CoRR abs/1707.03914 (2017) - [i28]Khaled M. Elbassioni, Chi-Kin Chau, Majid Khonji:
From Electrical Power Flows to Unsplittabe Flows: A QPTAS for OPF with Discrete Demands in Line Distribution Networks. CoRR abs/1709.05876 (2017) - [i27]Majid Khonji, Chi-Kin Chau, Khaled M. Elbassioni:
Combinatorial Optimization of AC Optimal Power Flow in Radial Distribution Networks. CoRR abs/1709.08431 (2017) - 2016
- [j56]Endre Boros
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames. Int. J. Game Theory 45(4): 1111-1131 (2016) - [j55]Stefan Canzar
Resolving Conflicting Predictions from Multimapping Reads. J. Comput. Biol. 23(3): 203-217 (2016) - [j54]Khaled M. Elbassioni
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. Theory Comput. Syst. 59(4): 641-663 (2016) - [j53]Chi-Kin Chau, Khaled M. Elbassioni, Majid Khonji:
Truthful Mechanisms for Combinatorial Allocation of Electric Power in Alternating Current Electric Systems for Smart Grid. ACM Trans. Economics and Comput. 5(1): 7:1-7:29 (2016) - [c71]Majid Khonji
Complex-Demand Scheduling Problem with Application in Smart Grid. COCOON 2016: 496-509 - [c70]Sid Chi-Kin Chau
Fuel minimization of plug-in hybrid electric vehicles by optimizing drive mode selection. e-Energy 2016: 13:1-13:11 - [c69]Khaled M. Elbassioni
Exact Algorithms for List-Coloring of Intersecting Hypergraphs. IPEC 2016: 12:1-12:15 - [c68]Khaled M. Elbassioni
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs. WAOA 2016: 78-91 - [i26]Majid Khonji, Sid Chi-Kin Chau, Khaled M. Elbassioni:
Optimal Power Flow with Inelastic Demands for Demand Response in Radial Distribution Networks. CoRR abs/1601.02323 (2016) - [i25]Majid Khonji, Areg Karapetyan, Khaled M. Elbassioni, Sid Chi-Kin Chau:
Complex-demand Scheduling Problem with Application in Smart Grid. CoRR abs/1603.01786 (2016) - [i24]Areg Karapetyan, Majid Khonji, Chi-Kin Chau, Khaled M. Elbassioni, Hatem H. Zeineldin:
Efficient Algorithm for Scalable Event-based Demand Response Management in Microgrids. CoRR abs/1610.03002 (2016) - [i23]Khaled M. Elbassioni:
Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-dimension. CoRR abs/1610.03812 (2016) - [i22]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information. CoRR abs/1610.06681 (2016) - [i21]Zaid Almahmoud, Jacob W. Crandall, Khaled M. Elbassioni, Trung Thanh Nguyen, Mardavij Roozbehani:
Dynamic Pricing in Smart Grids under Thresholding Policies: Algorithms and Heuristics. CoRR abs/1610.07559 (2016) - [i20]Areg Karapetyan, Majid Khonji, Chi-Kin Chau, Khaled M. Elbassioni:
Online Algorithm for Demand Response with Inelastic Demands and Apparent Power Constraint. CoRR abs/1611.00559 (2016) - [i19]Chi-Kin Chau, Khaled M. Elbassioni, Chien-Ming Tseng:
Drive Mode Optimization and Path Planning for Plug-in Hybrid Electric Vehicles. CoRR abs/1611.01032 (2016) - 2015
- [j52]Stefan Canzar
On Tree-Constrained Matchings and Generalizations. Algorithmica 71(1): 98-119 (2015) - [j51]Khaled M. Elbassioni
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. Algorithmica 73(2): 441-459 (2015) - [j50]Khaled M. Elbassioni
A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality. J. Graph Algorithms Appl. 19(1): 273-280 (2015) - [c67]Khaled M. Elbassioni
Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank. ADT 2015: 273-287 - [c66]Khaled M. Elbassioni
Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design. SAGT 2015: 98-109 - [c65]Endre Boros, Khaled M. Elbassioni
Markov Decision Processes and Stochastic Games with Total Effective Payoff. STACS 2015: 103-115 - [e1]Khaled M. Elbassioni, Kazuhisa Makino:
Algorithms and Computation - 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings. Lecture Notes in Computer Science 9472, Springer 2015, ISBN 978-3-662-48970-3 [contents] - [i18]Sid Chi-Kin Chau, Khaled M. Elbassioni, Majid Khonji:
Truthful Mechanisms for Combinatorial Allocation of Electric Power in Alternating Current Electric Systems for Smart Grid. CoRR abs/1507.01762 (2015) - [i17]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions. CoRR abs/1508.03431 (2015) - [i16]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games. CoRR abs/1508.03455 (2015) - [i15]Sid Chi-Kin Chau, Khaled M. Elbassioni:
Strong Price of Anarchy of Coalition Formation Game with Fair Cost Sharing and Bounded Capacity for Sharing Economy. CoRR abs/1511.05270 (2015) - 2014
- [j49]Khaled M. Elbassioni
A Lower Bound for the HBC Transversal Hypergraph Generation. Fundam. Informaticae 130(4): 409-414 (2014) - [j48]Hans Raj Tiwary
Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism. Graphs Comb. 30(3): 729-742 (2014) - [j47]Mohamed R. Fouad, Khaled M. Elbassioni
A Supermodularity-Based Differential Privacy Preserving Algorithm for Data Anonymization. IEEE Trans. Knowl. Data Eng. 26(7): 1591-1601 (2014) - [c64]Sid Chi-Kin Chau, Khaled M. Elbassioni, Majid Khonji:
Truthful mechanisms for combinatorial AC electric power allocation. AAMAS 2014: 1005-1012 - [c63]Endre Boros
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. COCOA 2014: 694-709 - [c62]Majid Khonji
Inapproximability of power allocation with inelastic demands in AC electric systems and networks. ICCCN 2014: 1-6 - [i14]Sid Chi-Kin Chau, Khaled M. Elbassioni, Majid Khonji:
Truthful Mechanisms for Combinatorial AC Electric Power Allocation. CoRR abs/1403.3907 (2014) - [i13]Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani:
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design. CoRR abs/1408.1577 (2014) - [i12]Khaled M. Elbassioni:
A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality. CoRR abs/1411.2262 (2014) - [i11]Khaled M. Elbassioni:
On Finding Minimal Infrequent Elements in Multi-dimensional Data Defined over Partially Ordered Sets. CoRR abs/1411.2275 (2014) - [i10]Khaled M. Elbassioni, Trung Thanh Nguyen:
Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions. CoRR abs/1411.5050 (2014) - [i9]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Nested Family of Cyclic Games with $k$-total Effective Rewards. CoRR abs/1412.6072 (2014) - 2013
- [j46]Endre Boros, Khaled M. Elbassioni
On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games. Dyn. Games Appl. 3(2): 128-161 (2013) - [j45]Stefan Canzar
Charge Group Partitioning in Biomolecular Simulation. J. Comput. Biol. 20(3): 188-198 (2013) - [j44]Stefan Canzar
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem. ACM J. Exp. Algorithmics 18 (2013) - [j43]Endre Boros
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. Oper. Res. Lett. 41(4): 357-362 (2013) - [c61]Khaled M. Elbassioni
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. COCOON 2013: 65-76 - [c60]Endre Boros, Khaled M. Elbassioni
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. ICALP (1) 2013: 220-231 - [i8]Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani:
On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets. CoRR abs/1301.5290 (2013) - [i7]Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swamy:
Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply. CoRR abs/1312.0137 (2013) - 2012
- [j42]Deepak Ajwani
Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors. Discret. Comput. Geom. 48(1): 39-52 (2012) - [j41]Endre Boros
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games. Discret. Math. 312(4): 772-788 (2012) - [j40]Khaled M. Elbassioni
Guarding 1.5D terrains with demands. Int. J. Comput. Math. 89(16): 2143-2151 (2012) - [j39]Khaled M. Elbassioni
Complexity of approximating the vertex centroid of a polyhedron. Theor. Comput. Sci. 421: 56-61 (2012) - [j38]Khaled M. Elbassioni
The relation of Connected Set Cover and Group Steiner Tree. Theor. Comput. Sci. 438: 96-101 (2012) - [j37]Khaled M. Elbassioni
On the complexity of the highway problem. Theor. Comput. Sci. 460: 70-77 (2012) - [c59]Khaled M. Elbassioni
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. FSTTCS 2012: 267-275 - [c58]Khaled M. Elbassioni
A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs. ICALP (2) 2012: 513-524 - [c57]Stefan Canzar
Charge Group Partitioning in Biomolecular Simulation. RECOMB 2012: 29-43 - [c56]Mohamed R. Fouad, Khaled M. Elbassioni
Modeling the Risk & Utility of Information Sharing in Social Networks. SocialCom/PASSAT 2012: 441-450 - [c55]Katarzyna E. Paluch
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. STACS 2012: 501-506 - [i6]Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun:
Multi-Attribute Profit-Maximizing Pricing (Extended Abstract). CoRR abs/1202.2840 (2012) - 2011
- [j36]Khaled M. Elbassioni
Improved Approximations for Guarding 1.5-Dimensional Terrains. Algorithmica 60(2): 451-463 (2011) - [j35]Ernst Althaus, Stefan Canzar
Approximation Algorithms for the Interval Constrained Coloring Problem. Algorithmica 61(2): 342-361 (2011) - [j34]Endre Boros
The negative cycles polyhedron and hardness of checking some polyhedral properties. Ann. Oper. Res. 188(1): 63-76 (2011) - [j33]Khaled M. Elbassioni
On a cone covering problem. Comput. Geom. 44(3): 129-134 (2011) - [j32]T.-H. Hubert Chan, Khaled M. Elbassioni
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. Discret. Comput. Geom. 46(4): 704-723 (2011) - [j31]Khaled M. Elbassioni
Finding Simplices containing the Origin in Two and Three Dimensions. Int. J. Comput. Geom. Appl. 21(5): 495-506 (2011) - [j30]Khaled M. Elbassioni
On the readability of monotone Boolean formulae. J. Comb. Optim. 22(3): 293-304 (2011) - [c54]Khaled M. Elbassioni, Imran Rauf, Saurabh Ray:
Enumerating Minimal Transversals of Geometric Hypergraphs. CCCG 2011 - [c53]Stefan Canzar
On Tree-Constrained Matchings and Generalizations. ICALP (1) 2011: 98-109 - [c52]Endre Boros, Khaled M. Elbassioni
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. ICALP (1) 2011: 147-158 - 2010
- [j29]Khaled M. Elbassioni
Polynomial-time dualization of r-exact hypergraphs with applications in geometry. Discret. Math. 310(17-18): 2356-2363 (2010) - [j28]Endre Boros
On effectivity functions of game forms. Games Econ. Behav. 68(2): 512-531 (2010) - [j27]Endre Boros
Left-to-Right Multiplication for Monotone Boolean Dualization. SIAM J. Comput. 39(7): 3424-3439 (2010) - [c51]Stefan Canzar
A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. ALENEX 2010: 23-33 - [c50]Endre Boros, Khaled M. Elbassioni
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. IPCO 2010: 341-354 - [c49]Stefan Canzar
On the Approximability of the Maximum Interval Constrained Coloring Problem. ISAAC (2) 2010: 168-179 - [c48]T.-H. Hubert Chan, Khaled M. Elbassioni
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. SODA 2010: 256-267 - [c47]George Christodoulou
Truthful Mechanisms for Exhibitions. WINE 2010: 170-181 - [c46]Khaled M. Elbassioni
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply. WINE 2010: 462-472
2000 – 2009
- 2009
- [j26]Khaled M. Elbassioni
Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods. Int. J. Comput. Geom. Appl. 19(2): 173-193 (2009) - [j25]Khaled M. Elbassioni
Algorithms for Dualization over Products of Partially Ordered Sets. SIAM J. Discret. Math. 23(1): 487-510 (2009) - [c45]Khaled M. Elbassioni
On the Readability of Monotone Boolean Formulae. COCOON 2009: 496-505 - [c44]Khaled M. Elbassioni
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. ESA 2009: 143-154 - [c43]Khaled M. Elbassioni
Complexity of Approximating the Vertex Centroid of a Polyhedron. ISAAC 2009: 413-422 - [c42]Khaled M. Elbassioni
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT 2009: 275-286 - [c41]Khaled M. Elbassioni
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA 2009: 1210-1219 - [c40]Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains. STACS 2009: 361-371 - [i5]Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray:
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. CoRR abs/0901.1140 (2009) - 2008
- [j24]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008) - [j23]Leonid Khachiyan, Endre Boros
Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica 51(3): 239-263 (2008) - [j22]Leonid Khachiyan, Endre Boros
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Discret. Appl. Math. 156(11): 2020-2034 (2008) - [j21]Khaled M. Elbassioni
On the complexity of monotone dualization and generating minimal hypergraph transversals. Discret. Appl. Math. 156(11): 2109-2123 (2008) - [j20]Leonid Khachiyan, Endre Boros
Generating All Vertices of a Polyhedron Is Hard. Discret. Comput. Geom. 39(1-3): 174-190 (2008) - [j19]Khaled M. Elbassioni
A note on systems with max-min and max-product constraints. Fuzzy Sets Syst. 159(17): 2272-2277 (2008) - [j18]Martin Kutz, Khaled M. Elbassioni
Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74(5): 884-897 (2008) - [j17]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43(2): 204-233 (2008) - [c39]Khaled M. Elbassioni, Hans Raj Tiwary:
On a Cone Covering Problem. CCCG 2008 - [c38]Hans Raj Tiwary
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. SCG 2008: 192-198 - [c37]Endre Boros, Khaled M. Elbassioni
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR 2008: 99-109 - [c36]Endre Boros, Khaled M. Elbassioni
On Berge Multiplication for Monotone Boolean Dualization. ICALP (1) 2008: 48-59 - [c35]Khaled M. Elbassioni
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. IWPEC 2008: 91-102 - [c34]Ernst Althaus, Stefan Canzar
Approximating the Interval Constrained Coloring Problem. SWAT 2008: 210-221 - [r1]Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
Indexing Schemes for Multi-dimensional Moving Objects. Encyclopedia of GIS 2008: 523-529 - [i4]Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary:
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra. CoRR abs/0801.3790 (2008) - [i3]Khaled M. Elbassioni, Hans Raj Tiwary:
On Computing the Vertex Centroid of a Polyhedron. CoRR abs/0806.3456 (2008) - [i2]Khaled M. Elbassioni, Domagoj Matijevic, Julián Mestre, Domagoj Severdija:
Improved Approximations for Guarding 1.5-Dimensional Terrains. CoRR abs/0809.0159 (2008) - 2007
- [j16]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discret. Appl. Math. 155(2): 137-149 (2007) - [j15]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni
A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101(4): 148-155 (2007) - [j14]Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni
Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Process. Lett. 17(2): 141-152 (2007) - [j13]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data. Theor. Comput. Sci. 379(3): 361-376 (2007) - [j12]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor. Comput. Sci. 382(2): 139-150 (2007) - [c33]Endre Boros, Konrad Borys, Khaled M. Elbassioni
Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON 2007: 222-231 - [c32]Khaled M. Elbassioni
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. ESA 2007: 451-462 - [c31]Deepak Ajwani
Conflict-free coloring for rectangle ranges using O(n.382) colors. SPAA 2007: 181-187 - 2006
- [j11]Khaled M. Elbassioni
Multiconsistency and Robustness with Global Constraints. Constraints An Int. J. 11(4): 335-352 (2006) - [j10]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discret. Appl. Math. 154(16): 2350-2372 (2006) - [j9]Khaled M. Elbassioni
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. Inf. Process. Lett. 100(2): 69-71 (2006) - [j8]Endre Boros, Khaled M. Elbassioni
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. J. Graph Theory 53(3): 209-232 (2006) - [c30]Khaled M. Elbassioni
On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization. ESA 2006: 340-351 - [c29]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni
Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA 2006: 444-455 - [c28]Khaled M. Elbassioni
On Approximating the TSP with Intersecting Neighborhoods. ISAAC 2006: 213-222 - [c27]Khaled M. Elbassioni
Finding All Minimal Infrequent Multi-dimensional Intervals. LATIN 2006: 423-434 - [c26]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich:
Generating all vertices of a polyhedron is hard. SODA 2006: 758-765 - [c25]Khaled M. Elbassioni
Conflict-Free Colorings of Rectangles Ranges. STACS 2006: 254-263 - 2005
- [j7]Khaled M. Elbassioni
An Indexing Method for Answering Queries on Moving Objects. Distributed Parallel Databases 17(3): 215-249 (2005) - [j6]Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni
On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discret. Math. 19(4): 966-984 (2005) - [c24]Amr Elmasry, Khaled M. Elbassioni:
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane. CCCG 2005: 248-251 - [c23]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni
A New Algorithm for the Hypergraph Transversal Problem. COCOON 2005: 767-776 - [c22]Khaled M. Elbassioni
Multiconsistency and Robustness with Global Constraints. CPAIOR 2005: 168-182 - [c21]Khaled M. Elbassioni
Approximation Algorithms for Euclidean Group TSP. ICALP 2005: 1115-1126 - [c20]Khaled M. Elbassioni
Simultaneous Matchings. ISAAC 2005: 106-115 - [c19]Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC 2005: 156-165 - [c18]Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni
Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. MFCS 2005: 556-567 - [i1]Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel:
Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices. CoRR abs/cs/0507038 (2005) - 2004
- [c17]Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich:
A stronger version of Bárány's theorem in the plane. CCCG 2004: 4-6 - [c16]Endre Boros, Khaled M. Elbassioni
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. ESA 2004: 122-133 - [c15]Mohamed F. Mokbel, Walid G. Aref, Khaled M. Elbassioni
Scalable Multimedia Disk Scheduling. ICDE 2004: 498-509 - [c14]Endre Boros, Khaled M. Elbassioni
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162 - [c13]Endre Boros
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498 - [c12]Endre Boros, Khaled M. Elbassioni
Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309 - [c11]Endre Boros, Khaled M. Elbassioni
An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128 - 2003
- [j5]Endre Boros
An inequality for polymatroid functions and its applications. Discret. Appl. Math. 131(2): 255-281 (2003) - [j4]Endre Boros
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices. Math. Program. 98(1-3): 355-368 (2003) - [c10]Endre Boros, Khaled M. Elbassioni
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA 2003: 556-567 - [c9]Endre Boros, Khaled M. Elbassioni
An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP 2003: 543-555 - [c8]Khaled M. Elbassioni
An Efficient Indexing Scheme for Multi-dimensional Moving Objects. ICDT 2003: 422-436 - [c7]Endre Boros, Khaled M. Elbassioni
Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494 - 2002
- [j3]Endre Boros
Generating dual-bounded hypergraphs. Optim. Methods Softw. 17(5): 749-781 (2002) - [j2]Endre Boros
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. SIAM J. Comput. 31(5): 1624-1643 (2002) - [c6]Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel:
Efficient answering of polyhedral queries in rd using bbs-trees. CCCG 2002: 54-57 - [c5]Khaled M. Elbassioni
An Algorithm for Dualization in Products of Lattices and Its Applications. ESA 2002: 424-435 - [c4]Endre Boros, Khaled M. Elbassioni
Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154 - [c3]Khaled M. Elbassioni
On Dualization in Products of Forests. STACS 2002: 142-153 - 2001
- [c2]Endre Boros, Khaled M. Elbassioni
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ICALP 2001: 92-103 - [c1]Mahfuzur Rahman, Khaled M. Elbassioni
Handling Large Real-Time Disk Access Requests With Variable Priorities. ICME 2001 - 2000
- [j1]Endre Boros, Khaled M. Elbassioni
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. Parallel Process. Lett. 10(4): 253-266 (2000)
Coauthor Index
[j82] [i38] [j74] [j70] [j69] [j61] [j59] [j56] [i22] [c65] [i17] [i16] [c63] [i9] [j46] [j43] [c60] [j41] [j34] [c52] [j28] [j27] [c50] [j24] [j23] [j22] [j20] [j17] [c37] [c36] [i4] [j16] [j15] [j14] [j13] [j12] [c33] [j10] [j8] [c29] [c26] [j6] [c23] [c19] [c18] [c16] [c14] [c13] [c12] [c11] [j5] [j4] [c10] [c9] [c7] [j3] [j2] [c4] [c2] [j1]
Sid Chi-Kin Chau
aka: Chi-Kin Chau
aka: Chi-Kin Chau
[j74] [j70] [j69] [j61] [j59] [j56] [i22] [c65] [i17] [i16] [c63] [i9] [j46] [j43] [c60] [j41] [j34] [c52] [j28] [c50] [j24] [j23] [j22] [j20] [j17] [c37] [i4] [j16] [j15] [j14] [j13] [j12] [c33] [j10] [j8] [c29] [c26] [j6] [c23] [c19] [c18] [c17] [c16] [c14] [c13] [c12] [c11] [j5] [j4] [c10] [c9] [c7] [j3] [j2] [c4] [c2] [j1]
Leonid Khachiyan
aka: Leonid G. Khachiyan
aka: Leonid G. Khachiyan
[j86] [j82] [j80] [i38] [j76] [j74] [c80] [j70] [j69] [c74] [i31] [j64] [j61] [j59] [i29] [j56] [c68] [i22] [j51] [c65] [e1] [i17] [i16] [c63] [i9] [j46] [j43] [c61] [c60] [i8] [j41] [j31] [j30] [c52] [j28] [j27] [c50] [c45] [c44] [j23] [c37] [c36] [j16] [j13] [c33] [c29] [j6] [c19] [c12] [c9] [j2] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: