Khaled M. Elbassioni
Orcid: 0000-0001-7021-5400Affiliations:
- Khalifa University, Masdar Institute, Abu Dhabi, UAE
- Masdar Institute of Science and Technology, Department of Electrical Engineering and Computer Science, Abu Dhabi, UAE
- Max Planck Institute for Informatics, Saarbrücken, Germany (former)
According to our database1,
Khaled M. Elbassioni
authored at least 188 papers
between 2000 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on masdar.ac.ae
-
on ku.ac.ae
-
on orcid.org
On csauthors.net:
Bibliography
2024
Discret. Comput. Geom., April, 2024
ACM Trans. Economics and Comput., March, 2024
2023
Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems.
IEEE Trans. Veh. Technol., November, 2023
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces.
Oper. Res. Lett., September, 2023
IEEE Trans. Veh. Technol., August, 2023
Autonomous Recharging and Flight Mission Planning for Battery-Operated Autonomous Drones.
IEEE Trans Autom. Sci. Eng., April, 2023
Improved Approximation Guarantees for Power Scheduling Problems With Sum-of-Squares Constraints.
CoRR, 2023
Approximations for generalized unsplittable flow on paths with application to power systems optimization.
Ann. Oper. Res., 2023
Joint Rate Allocation and Power Control for RSMA-Based Communication and Radar Coexistence Systems.
Proceedings of the IEEE Global Communications Conference, 2023
DClEVerNet: Deep Combinatorial Learning for Efficient EV Charging Scheduling in Large-scale Networked Facilities.
Proceedings of the 14th ACM International Conference on Future Energy Systems, 2023
2022
Access Management in Joint Sensing and Communication Systems: Efficiency Versus Fairness.
IEEE Trans. Veh. Technol., 2022
Theor. Comput. Sci., 2022
SIAM J. Optim., 2022
Approximation Algorithms for Cost-robust Discrete Minimization Problems Based on their LP-Relaxations.
Algorithmica, 2022
2021
ACM Trans. Economics and Comput., 2021
Oper. Res. Lett., 2021
Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems.
CoRR, 2021
2020
Multisensor Adaptive Control System for IoT-Empowered Smart Lighting with Oblivious Mobile Sensors.
ACM Trans. Sens. Networks, 2020
Theor. Comput. Sci., 2020
Combinatorial Optimization of AC Optimal Power Flow With Discrete Demands in Radial Networks.
IEEE Trans. Control. Netw. Syst., 2020
Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices.
SIAM J. Discret. Math., 2020
2019
IEEE Trans. Smart Grid, 2019
Theor. Comput. Sci., 2019
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs.
Theor. Comput. Sci., 2019
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions.
Inf. Comput., 2019
Some Black-box Reductions for Objective-robust Discrete Optimization Problems Based on their LP-Relaxations.
CoRR, 2019
Ann. Oper. Res., 2019
A Multiplicative Weight Updates Algorithm for Packing and Covering Semi-infinite Linear Programs.
Algorithmica, 2019
Proceedings of the Research in Computational Molecular Biology, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
Peer-to-Peer Energy Sharing: Effective Cost-Sharing Mechanisms and Social Efficiency.
Proceedings of the Tenth ACM International Conference on Future Energy Systems, 2019
2018
Efficient Algorithm for Scalable Event-Based Demand Response Management in Microgrids.
IEEE Trans. Smart Grid, 2018
Optimal Power Flow With Inelastic Demands for Demand Response in Radial Distribution Networks.
IEEE Trans. Control. Netw. Syst., 2018
IEEE Trans. Control. Netw. Syst., 2018
Discret. Optim., 2018
A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games.
Dyn. Games Appl., 2018
Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions.
Algorithmica, 2018
Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018
Combinatorial Optimization of Electric Vehicle Charging in AC Power Distribution Networks.
Proceedings of the 2018 IEEE International Conference on Communications, 2018
Proceedings of the 5th Conference on Systems for Built Environments, 2018
Approximation Scheduling Algorithms for Electric Vehicle Charging with Discrete Charging Options.
Proceedings of the Ninth International Conference on Future Energy Systems, 2018
Challenges in Scheduling Electric Vehicle Charging with Discrete Charging Rates in AC Power Networks.
Proceedings of the Ninth International Conference on Future Energy Systems, 2018
2017
Proceedings of the Encyclopedia of GIS., 2017
IEEE Trans. Intell. Transp. Syst., 2017
A convex programming-based algorithm for mean payoff stochastic games with perfect information.
Optim. Lett., 2017
Inf. Process. Lett., 2017
Int. J. Game Theory, 2017
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions.
Discret. Appl. Math., 2017
CoRR, 2017
From Electrical Power Flows to Unsplittabe Flows: A QPTAS for OPF with Discrete Demands in Line Distribution Networks.
CoRR, 2017
Flight Tour Planning with Recharging Optimization for Battery-operated Autonomous Drones.
CoRR, 2017
Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2017
Proceedings of the 33rd International Symposium on Computational Geometry, 2017
2016
Truthful Mechanisms for Combinatorial Allocation of Electric Power in Alternating Current Electric Systems for Smart Grid.
ACM Trans. Economics and Comput., 2016
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design.
Theory Comput. Syst., 2016
Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames.
Int. J. Game Theory, 2016
Online Algorithm for Demand Response with Inelastic Demands and Apparent Power Constraint.
CoRR, 2016
Dynamic Pricing in Smart Grids under Thresholding Policies: Algorithms and Heuristics.
CoRR, 2016
A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016
Fuel minimization of plug-in hybrid electric vehicles by optimizing drive mode selection.
Proceedings of the Seventh International Conference on Future Energy Systems, Waterloo, ON, Canada, June 21, 2016
2015
A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality.
J. Graph Algorithms Appl., 2015
Strong Price of Anarchy of Coalition Formation Game with Fair Cost Sharing and Bounded Capacity for Sharing Economy.
CoRR, 2015
Algorithmica, 2015
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015
Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-Rank.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015
2014
A Supermodularity-Based Differential Privacy Preserving Algorithm for Data Anonymization.
IEEE Trans. Knowl. Data Eng., 2014
Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism.
Graphs Comb., 2014
Fundam. Informaticae, 2014
Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions.
CoRR, 2014
On Finding Minimal Infrequent Elements in Multi-dimensional Data Defined over Partially Ordered Sets.
CoRR, 2014
Inapproximability of power allocation with inelastic demands in AC electric systems and networks.
Proceedings of the 23rd International Conference on Computer Communication and Networks, 2014
A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games.
Proceedings of the Combinatorial Optimization and Applications, 2014
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014
2013
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness.
Oper. Res. Lett., 2013
A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem.
ACM J. Exp. Algorithmics, 2013
2012
Theor. Comput. Sci., 2012
Theor. Comput. Sci., 2012
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games.
Discret. Math., 2012
Discret. Comput. Geom., 2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
Proceedings of the 2012 International Conference on Privacy, 2012
Proceedings of the Research in Computational Molecular Biology, 2012
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012
2011
Int. J. Comput. Geom. Appl., 2011
Discret. Comput. Geom., 2011
Ann. Oper. Res., 2011
Algorithmica, 2011
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
Discret. Math., 2010
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010
2009
SIAM J. Discret. Math., 2009
Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods.
Int. J. Comput. Geom. Appl., 2009
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs.
Proceedings of the Algorithms, 2009
2008
Proceedings of the Encyclopedia of GIS., 2008
Theory Comput. Syst., 2008
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions.
Discret. Appl. Math., 2008
On the complexity of monotone dualization and generating minimal hypergraph transversals.
Discret. Appl. Math., 2008
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra
CoRR, 2008
Proceedings of the Algorithm Theory, 2008
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames.
Proceedings of the Computer Science, 2008
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008
2007
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data.
Theor. Comput. Sci., 2007
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs.
Theor. Comput. Sci., 2007
Parallel Process. Lett., 2007
Inf. Process. Lett., 2007
Discret. Appl. Math., 2007
Conflict-free coloring for rectangle ranges using <i>O</i>(<i>n</i><sup>.382</sup>) colors.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007
Proceedings of the Algorithms, 2007
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007
2006
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms.
J. Graph Theory, 2006
Inf. Process. Lett., 2006
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation.
Discret. Appl. Math., 2006
Constraints An Int. J., 2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006
Proceedings of the Algorithms, 2006
Proceedings of the Algorithms, 2006
2005
SIAM J. Discret. Math., 2005
Distributed Parallel Databases, 2005
CoRR, 2005
Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005
2004
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004
Proceedings of the 20th International Conference on Data Engineering, 2004
Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems.
Proceedings of the Algorithms, 2004
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004
2003
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices.
Math. Program., 2003
Discret. Appl. Math., 2003
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
Proceedings of the Database Theory, 2003
An Intersection Inequality for Discrete Distributions and Related Generation Problems.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals.
Proceedings of the Algorithms, 2003
2002
Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
SIAM J. Comput., 2002
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
Proceedings of the Algorithms, 2002
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002
2001
Proceedings of the 2001 IEEE International Conference on Multimedia and Expo, 2001
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension.
Parallel Process. Lett., 2000