Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Elbassioni, Khaled - Max-Planck-Institut für Informatik
Two Lectures on the Ellipsoid Method for Solving Linear Programs
DualBounded Generating Problems: An Intersection Inequality for Discrete Distributions and Its
On the Complexity of Some Enumeration Problems for Matroids #
Improved Approximations for Guarding 1.5-Dimensional Terrains
On approximating the TSP with intersecting neighborhoods
Potential Reduction Algorithm for Ergodic Mean Payo# Zerosum Stochastic Games with Perfect Information #+
Generating all vertices of a polyhedron is hard Leonid Khachiyan # Endre Boros + Konrad Borys #
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
An Indexing Method for Answering Queries on Moving Objects Khaled Elbassioni Amr Elmasry y Ibrahim Kamel z
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Enumerating Spanning and Connected Subsets in Graphs and Matroids
Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and
Every stochastic game with perfect information admits a canonical Endre Boros
October 18, 2010 15:44 WSPC/Guidelines final International Journal of Computational Geometry & Applications
On effectivity functions of game forms Endre Boros
Discrete Comput Geom (2008) 39: 174190 DOI 10.1007/s00454-008-9050-5
DUAL-BOUNDED GENERATING PROBLEMS: ALL MINIMAL INTEGER SOLUTIONS FOR
An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in
Complexity of Approximating the Vertex Centroid of a Polyhedron
On the Complexity of Checking Self-duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism
Conflict-Free Coloring for Rectangle Ranges Using ~O(n.382+
Generating Minimal k-Vertex Connected Spanning Subgraphs
On a Cone Covering Problem Khaled Elbassioni
Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane
Simultaneous Matchings: Hardness and Approximation #
On the Approximability of the Maximum Interval Constrained Coloring Problem
Upper Bound on the Number of Vertices of Polyhedra with 0, 1Constraint Matrices.
Algorithms for Dualization over Products of Partially Ordered Sets
On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
Enumerating Spanning and Connected Subsets in Graphs and Matroids #
On Dualization of Hypergraphs with Bounded Edge-Intersections and Other Related Classes
Polynomial-time Dualization of r-Exact Hypergraphs with Applications in Geometry
Computer-generated theorems on Nash-solvability of bimatrix games based on excluding certain 2 2
On Berge Multiplication for Monotone Boolean Dualization
On the Complexity of Monotone Dualization and Generating Minimal Hypergraph
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Approximation Algorithms for Non-Single-minded Profit-Maximization Problems with Limited Supply
Approximation Algorithms for Euclidean Group Khaled Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, and Ren e Sitters
Finding All Minimal Infrequent Multi-dimensional Intervals
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem
A Pumping Algorithm for Ergodic Mean Payoff Stochastic Games with Perfect Information
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
SpaceEfficient Approximate Voronoi Diagrams Department of Computer
Some fixed-parameter tractable classes of Dual and related problems
Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric
Generating All Minimal Integral Solutions to Monotone ^; _-Systems of Linear, Transversal
Multiconsistency and Robustness with Global Constraints
INCREMENTAL ALGORITHMS FOR ENUMERATING EXTREMAL SOLUTIONS OF MONOTONE SYSTEMS OF
Approximating the Interval Constrained Coloring Problem Ernst Althaus
A New Algorithm for the Hypergraph Transversal Problem
Generating Dual-Bounded Hypergraphs Endre Boros y Khaled Elbassioni z Vladimir Gurvich y
Transversal Hypergraphs to Perfect Matchings in Bipartite Graphs: Characterization and Generation
The Negative Cycles Polyhedron and Hardness of Checking Some Polyhedral Properties
On Tree-Constrained Matchings and Generalizations
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes