Is this you? Create Your Porfile
Avatar

Khaled M. Elbassioni

Max Planck Society

Network

Latest external collaboration on country level. Dive into details by clicking on the dots.

Explore More

Hotspot

Dive into the research topics where Khaled M. Elbassioni is active.

Explore More

Publication

Featured researches published by Khaled M. Elbassioni.

SIAM Journal on Discrete Mathematics | 2005

On the Complexity of Some Enumeration Problems for Matroids

Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Kazuhisa Makino

Let

SIAM Journal on Computing | 2002

Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities

Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Leonid Khachiyan; Kazuhisa Makino

M

symposium on discrete algorithms | 2006

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich

be a matroid defined by an independence oracle on ground set

european symposium on algorithms | 2007

A quasi-PTAS for profit-maximizing pricing on line graphs

Khaled M. Elbassioni; René Sitters; Y. Zhang

S

acm symposium on parallel algorithms and architectures | 2007

Conflict-free coloring for rectangle ranges using O ( n .382 ) colors

Deepak Ajwani; Khaled M. Elbassioni; Sathish Govindarajan; Saurabh Ray

, and let

International Journal of Computational Geometry and Applications | 2009

APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS

Khaled M. Elbassioni; Aleksei V. Fishkin; René Sitters

A\subseteq S

Information Processing Letters | 2007

A global parallel algorithm for the hypergraph transversal problem

Leonid Khachiyan; Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich

. We present an incremental polynomial-time algorithm for enumerating all minimal (maximal) subsets of

algorithmic game theory | 2009

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems

Khaled M. Elbassioni; Rajiv Raman; Saurabh Ray; René Sitters

S

symposium on theoretical aspects of computer science | 2006

Conflict-Free colorings of rectangles ranges

Khaled M. Elbassioni; Nabil H. Mustafa

which span (do not span)

Optimization Methods & Software | 2002

Generating Dual-Bounded Hypergraphs

Endre Boros; Khaled M. Elbassioni; Leonid Khachiyan; Vladimir Gurvich

A

Explore More

Collaboration

Dive into the Khaled M. Elbassioni's collaboration.

Top Co-Authors
Avatar

Endre Boros

Rutgers University

View shared research outputs
Top Co-Authors
Avatar

Vladimir Gurvich

Rutgers University

View shared research outputs
Top Co-Authors
Avatar

Leonid Khachiyan

Rutgers University

View shared research outputs
Top Co-Authors
Avatar

Kazuhisa Makino

Kyoto University

View shared research outputs
Top Co-Authors
Avatar

Konrad Borys

Rutgers University

View shared research outputs
Top Co-Authors
Avatar

Stefan Canzar

Toyota Technological Institute at Chicago

View shared research outputs
Top Co-Authors
Avatar

René Sitters

VU University Amsterdam

View shared research outputs
Top Co-Authors
Avatar

Julián Mestre

University of Sydney

View shared research outputs
Top Co-Authors
Avatar

Amr Elmasry

Alexandria University

View shared research outputs
Top Co-Authors
Avatar

Saurabh Ray

New York University Abu Dhabi

View shared research outputs
Explore More
Researchain Logo
Decentralizing Knowledge