The following pages link to Khaled M. Elbassioni (Q835214):
Displaying 50 items.
- (Q344515) (redirect page) (← links)
- A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
- The relation of connected set cover and group Steiner tree (Q441864) (← links)
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors (Q443903) (← links)
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- A nested family of \(k\)-total effective rewards for positional games (Q521891) (← links)
- Sufficient conditions for the existence of Nash equilibria in bimatrix games in terms of forbidden \(2 \times 2\) subgames (Q524983) (← links)
- Improved approximations for guarding 1.5-dimensional terrains (Q534789) (← links)
- On a cone covering problem (Q617540) (← links)
- Approximation algorithms for the interval constrained coloring problem (Q639285) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- On the readability of monotone Boolean formulae (Q652622) (← links)
- On the complexity of the highway problem (Q690481) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- Complexity of approximating the vertex centroid of a polyhedron (Q764376) (← links)
- A note on systems with max-min and max-product constraints (Q835215) (← links)
- Upper bound on the number of vertices of polyhedra with 0,1-constraint matrices (Q845830) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Multiconsistency and robustness with global constraints (Q857890) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Simultaneous matchings: Hardness and approximation (Q931730) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- (Q1410679) (redirect page) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices (Q1424303) (← links)
- On the approximability of the maximum interval constrained coloring problem (Q1662109) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
- Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726) (← links)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Generating clause sequences of a CNF formula (Q2219060) (← links)
- On tree-constrained matchings and generalizations (Q2258075) (← links)
- On effectivity functions of game forms (Q2268107) (← links)
- Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
- Computational aspects of optimal strategic network diffusion (Q2304561) (← links)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
