Khaled M. Elbassioni

According to our database1, Khaled M. Elbassioni authored at least 175 papers between 2000 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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 of Network Systems, 2018

On the approximability of the maximum interval constrained coloring problem.
Discrete Optimization, 2018

A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games.
Dynamic Games and Applications, 2018

Finding Sparse Solutions for Packing and Covering Semidefinite Programs.
CoRR, 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

Smart lighting control using oblivious mobile sensors.
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
Indexing Schemes for Multidimensional Moving Objects.
Proceedings of the Encyclopedia of GIS., 2017

Drive Mode Optimization and Path Planning for Plug-In Hybrid Electric Vehicles.
IEEE Trans. Intelligent Transportation Systems, 2017

A convex programming-based algorithm for mean payoff stochastic games with perfect information.
Optimization Letters, 2017

A polynomial-time algorithm for computing low CP-rank decompositions.
Inf. Process. Lett., 2017

A nested family of \(\varvec{k}\) -total effective rewards for positional games.
Int. J. Game Theory, 2017

Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions.
Discrete Applied Mathematics, 2017

Combinatorial Optimization of AC Optimal Power Flow in Radial Distribution Networks.
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

Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices.
CoRR, 2017

Guest Editors' Foreword.
Algorithmica, 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

Resolving Conflicting Predictions from Multimapping Reads.
Journal of Computational Biology, 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

Complex-demand Scheduling Problem with Application in Smart Grid.
CoRR, 2016

Optimal Power Flow with Inelastic Demands for Demand Response in Radial Distribution Networks.
CoRR, 2016

Efficient Algorithm for Scalable Event-based Demand Response Management in Microgrids.
CoRR, 2016

Online Algorithm for Demand Response with Inelastic Demands and Apparent Power Constraint.
CoRR, 2016

Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-dimension.
CoRR, 2016

Drive Mode Optimization and Path Planning for Plug-in Hybrid Electric Vehicles.
CoRR, 2016

A Convex Programming-based Algorithm for Mean Payoff Stochastic Games with Perfect Information.
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

Exact Algorithms for List-Coloring of Intersecting Hypergraphs.
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

Complex-Demand Scheduling Problem with Application in Smart Grid.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality.
J. Graph Algorithms Appl., 2015

Truthful Mechanisms for Combinatorial Allocation of Electric Power in Alternating Current Electric Systems for Smart Grid.
CoRR, 2015

Strong Price of Anarchy of Coalition Formation Game with Fair Cost Sharing and Bounded Capacity for Sharing Economy.
CoRR, 2015

A Potential Reduction Algorithm for Two-person Zero-sum Mean Payoff Stochastic Games.
CoRR, 2015

A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and Few Random Positions.
CoRR, 2015

On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets.
Algorithmica, 2015

On Tree-Constrained Matchings and Generalizations.
Algorithmica, 2015

Markov Decision Processes and Stochastic Games with Total Effective Payoff.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 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 and Combinatorics, 2014

A Lower Bound for the HBC Transversal Hypergraph Generation.
Fundam. Inform., 2014

Approximation Schemes for Binary Quadratic Programming Problems with Low cp-Rank Decompositions.
CoRR, 2014

Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design.
CoRR, 2014

On Finding Minimal Infrequent Elements in Multi-dimensional Data Defined over Partially Ordered Sets.
CoRR, 2014

A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality.
CoRR, 2014

Truthful Mechanisms for Combinatorial AC Electric Power Allocation.
CoRR, 2014

Nested Family of Cyclic Games with $k$-total Effective Rewards.
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

Truthful mechanisms for combinatorial AC electric power allocation.
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 Journal of Experimental Algorithmics, 2013

Charge Group Partitioning in Biomolecular Simulation.
Journal of Computational Biology, 2013

On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games.
Dynamic Games and Applications, 2013

On Randomized Fictitious Play for Approximating Saddle Points Over Convex Sets
CoRR, 2013

Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply.
CoRR, 2013

A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
Complexity of approximating the vertex centroid of a polyhedron.
Theor. Comput. Sci., 2012

On the complexity of the highway problem.
Theor. Comput. Sci., 2012

The relation of Connected Set Cover and Group Steiner Tree.
Theor. Comput. Sci., 2012

Guarding 1.5D terrains with demands.
Int. J. Comput. Math., 2012

On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games.
Discrete Mathematics, 2012

Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors.
Discrete & Computational Geometry, 2012

Multi-Attribute Profit-Maximizing Pricing (Extended Abstract)
CoRR, 2012

Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Modeling the Risk & Utility of Information Sharing in Social Networks.
Proceedings of the 2012 International Conference on Privacy, 2012

Charge Group Partitioning in Biomolecular Simulation.
Proceedings of the Research in Computational Molecular Biology, 2012

A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
On the readability of monotone Boolean formulae.
J. Comb. Optim., 2011

Finding Simplices containing the Origin in Two and Three Dimensions.
Int. J. Comput. Geometry Appl., 2011

A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics.
Discrete & Computational Geometry, 2011

On a cone covering problem.
Comput. Geom., 2011

The negative cycles polyhedron and hardness of checking some polyhedral properties.
Annals OR, 2011

Improved Approximations for Guarding 1.5-Dimensional Terrains.
Algorithmica, 2011

Approximation Algorithms for the Interval Constrained Coloring Problem.
Algorithmica, 2011

On Tree-Constrained Matchings and Generalizations.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Enumerating Minimal Transversals of Geometric Hypergraphs.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Left-to-Right Multiplication for Monotone Boolean Dualization.
SIAM J. Comput., 2010

On effectivity functions of game forms.
Games and Economic Behavior, 2010

Polynomial-time dualization of r-exact hypergraphs with applications in geometry.
Discrete Mathematics, 2010

Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Truthful Mechanisms for Exhibitions.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

On the Approximability of the Maximum Interval Constrained Coloring Problem.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem.
Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, 2010

2009
Algorithms for Dualization over Products of Partially Ordered Sets.
SIAM J. Discrete Math., 2009

Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods.
Int. J. Comput. Geometry Appl., 2009

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
CoRR, 2009

Improved Approximations for Guarding 1.5-Dimensional Terrains.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 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

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Complexity of Approximating the Vertex Centroid of a Polyhedron.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs.
Proceedings of the Algorithms, 2009

On the Readability of Monotone Boolean Formulae.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Indexing Schemes for Multi-dimensional Moving Objects.
Proceedings of the Encyclopedia of GIS., 2008

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction.
Theory Comput. Syst., 2008

Simultaneous matchings: Hardness and approximation.
J. Comput. Syst. Sci., 2008

A note on systems with max-min and max-product constraints.
Fuzzy Sets and Systems, 2008

Generating All Vertices of a Polyhedron Is Hard.
Discrete & Computational Geometry, 2008

Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions.
Discrete Applied Mathematics, 2008

On the complexity of monotone dualization and generating minimal hypergraph transversals.
Discrete Applied Mathematics, 2008

Improved Approximations for Guarding 1.5-Dimensional Terrains
CoRR, 2008

On Computing the Vertex Centroid of a Polyhedron
CoRR, 2008

Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra
CoRR, 2008

On Enumerating Minimal Dicuts and Strongly Connected Subgraphs.
Algorithmica, 2008

Generating Cut Conjunctions in Graphs and Related Problems.
Algorithmica, 2008

Approximating the Interval Constrained Coloring Problem.
Proceedings of the Algorithm Theory, 2008

Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems.
Proceedings of the Parameterized and Exact Computation, Third International Workshop, 2008

On Berge Multiplication for Monotone Boolean Dualization.
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

On a Cone Covering Problem.
Proceedings of the 20th Annual Canadian Conference 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

Computing Many Maximal Independent Sets for Hypergraphs in Parallel.
Parallel Processing Letters, 2007

A global parallel algorithm for the hypergraph transversal problem.
Inf. Process. Lett., 2007

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory.
Discrete Applied Mathematics, 2007

Conflict-free coloring for rectangle ranges using O(n.382) colors.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.
Proceedings of the Algorithms, 2007

Generating Minimal k-Vertex Connected Spanning Subgraphs.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms.
Journal of Graph Theory, 2006

Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices.
Inf. Process. Lett., 2006

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation.
Discrete Applied Mathematics, 2006

Multiconsistency and Robustness with Global Constraints.
Constraints, 2006

Conflict-Free Colorings of Rectangles Ranges.
Proceedings of the STACS 2006, 2006

Generating all vertices of a polyhedron is hard.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Finding All Minimal Infrequent Multi-dimensional Intervals.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

On Approximating the TSP with Intersecting Neighborhoods.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Enumerating Spanning and Connected Subsets in Graphs and Matroids.
Proceedings of the Algorithms, 2006

On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization.
Proceedings of the Algorithms, 2006

2005
On the Complexity of Some Enumeration Problems for Matroids.
SIAM J. Discrete Math., 2005

An Indexing Method for Answering Queries on Moving Objects.
Distributed and Parallel Databases, 2005

Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices
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

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Simultaneous Matchings.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Approximation Algorithms for Euclidean Group TSP.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Multiconsistency and Robustness with Global Constraints.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005

A New Algorithm for the Hypergraph Transversal Problem.
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
An Efficient Implementation of a Joint Generation Algorithm.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Generating Paths and Cuts in Multi-pole (Di)graphs.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections.
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

Scalable Multimedia Disk Scheduling.
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

A stronger version of Bárány's theorem in the plane.
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

An inequality for polymatroid functions and its applications.
Discrete Applied Mathematics, 2003

Algorithms for Enumerating Circuits in Matroids.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

An Efficient Indexing Scheme for Multi-dimensional Moving Objects.
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

Generating dual-bounded hypergraphs.
Optimization Methods and Software, 2002

On Dualization in Products of Forests.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

Matroid Intersections, Polymatroid Inequalities, and Related Problems.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

An Algorithm for Dualization in Products of Lattices and Its Applications.
Proceedings of the Algorithms, 2002

Efficient answering of polyhedral queries in rd using bbs-trees.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Handling Large Real-Time Disk Access Requests With Variable Priorities.
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 Processing Letters, 2000


  Loading...