The SCEAS System
| |||||||

## Search the dblp DataBase
Khaled M. Elbassioni:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich
**A stronger version of Bárány's theorem in the plane.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:4-6 [Conf] - Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
**Efficient answering of polyhedral queries in r**[Citation Graph (0, 0)][DBLP]^{d}using bbs-trees. CCCG, 2002, pp:54-57 [Conf] - Amr Elmasry, Khaled M. Elbassioni
**Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane.**[Citation Graph (0, 0)][DBLP] CCCG, 2005, pp:248-251 [Conf] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**A New Algorithm for the Hypergraph Transversal Problem.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:767-776 [Conf] - Khaled M. Elbassioni, Irit Katriel
**Multiconsistency and Robustness with Global Constraints.**[Citation Graph (0, 0)][DBLP] CPAIOR, 2005, pp:168-182 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems.**[Citation Graph (0, 0)][DBLP] ESA, 2004, pp:122-133 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals.**[Citation Graph (0, 0)][DBLP] ESA, 2003, pp:556-567 [Conf] - Khaled M. Elbassioni
**An Algorithm for Dualization in Products of Lattices and Its Applications.**[Citation Graph (0, 0)][DBLP] ESA, 2002, pp:424-435 [Conf] - Khaled M. Elbassioni
**On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:340-351 [Conf] - Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
**Enumerating Spanning and Connected Subsets in Graphs and Matroids.**[Citation Graph (0, 0)][DBLP] ESA, 2006, pp:444-455 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:92-103 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**An Intersection Inequality for Discrete Distributions and Related Generation Problems.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:543-555 [Conf] - Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters
**Approximation Algorithms for Euclidean Group TSP.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1115-1126 [Conf] - Mohamed F. Mokbel, Walid G. Aref, Khaled M. Elbassioni, Ibrahim Kamel
**Scalable Multimedia Disk Scheduling.**[Citation Graph (0, 0)][DBLP] ICDE, 2004, pp:498-509 [Conf] - Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
**An Efficient Indexing Scheme for Multi-dimensional Moving Objects.**[Citation Graph (0, 0)][DBLP] ICDT, 2003, pp:422-436 [Conf] - Mahfuzur Rahman, Khaled M. Elbassioni, Ibrahim Kamel
**Handling Large Real-Time Disk Access Requests With Variable Priorities.**[Citation Graph (0, 0)][DBLP] ICME, 2001, pp:- [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems.**[Citation Graph (0, 0)][DBLP] IPCO, 2004, pp:152-162 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**Algorithms for Enumerating Circuits in Matroids.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:485-494 [Conf] - Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters
**On Approximating the TSP with Intersecting Neighborhoods.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:213-222 [Conf] - Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan
**Simultaneous Matchings.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:106-115 [Conf] - Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
**Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:156-165 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections.**[Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:488-498 [Conf] - Khaled M. Elbassioni
**Finding All Minimal Infrequent Multi-dimensional Intervals.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:423-434 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**Matroid Intersections, Polymatroid Inequalities, and Related Problems.**[Citation Graph (0, 0)][DBLP] MFCS, 2002, pp:143-154 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**Generating Paths and Cuts in Multi-pole (Di)graphs.**[Citation Graph (0, 0)][DBLP] MFCS, 2004, pp:298-309 [Conf] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities.**[Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:556-567 [Conf] - Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich
**Generating all vertices of a polyhedron is hard.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:758-765 [Conf] - Khaled M. Elbassioni
**On Dualization in Products of Forests.**[Citation Graph (0, 0)][DBLP] STACS, 2002, pp:142-153 [Conf] - Khaled M. Elbassioni, Nabil H. Mustafa
**Conflict-Free Colorings of Rectangles Ranges.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:254-263 [Conf] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**An Efficient Implementation of a Joint Generation Algorithm.**[Citation Graph (0, 0)][DBLP] WEA, 2004, pp:114-128 [Conf] - Khaled M. Elbassioni, Irit Katriel
**Multiconsistency and Robustness with Global Constraints.**[Citation Graph (0, 0)][DBLP] Constraints, 2006, v:11, n:4, pp:335-352 [Journal] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**An inequality for polymatroid functions and its applications.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:131, n:2, pp:255-281 [Journal] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:16, pp:2350-2372 [Journal] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
**Enumerating disjunctions and conjunctions of paths and cuts in reliability theory.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:2, pp:137-149 [Journal] - Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel
**An Indexing Method for Answering Queries on Moving Objects.**[Citation Graph (0, 0)][DBLP] Distributed and Parallel Databases, 2005, v:17, n:3, pp:215-249 [Journal] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**A global parallel algorithm for the hypergraph transversal problem.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:101, n:4, pp:148-155 [Journal] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
**An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 2000, v:10, n:4, pp:253-266 [Journal] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
**Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:5, pp:1624-1643 [Journal] - Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
**On the Complexity of Some Enumeration Problems for Matroids.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2005, v:19, n:4, pp:966-984 [Journal] - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:53, n:3, pp:209-232 [Journal] - Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
**Generating Minimal k-Vertex Connected Spanning Subgraphs.**[Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:222-231 [Conf] - Khaled M. Elbassioni, René Sitters, Yan Zhang
**A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs.**[Citation Graph (0, 0)][DBLP] ESA, 2007, pp:451-462 [Conf] - Deepak Ajwani, Khaled Elbassioni, Sathish Govindarajan, Saurabh Ray
**Conflict-free coloring for rectangle ranges using**[Citation Graph (0, 0)][DBLP]*O*(*n*^{.382}) colors. SPAA, 2007, pp:181-187 [Conf] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino
**Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:379, n:3, pp:361-376 [Journal] - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich
**On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:382, n:2, pp:139-150 [Journal] **A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem.**[Citation Graph (, )][DBLP]**On a Cone Covering Problem.**[Citation Graph (, )][DBLP]**On the Readability of Monotone Boolean Formulae.**[Citation Graph (, )][DBLP]**On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.**[Citation Graph (, )][DBLP]**A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames.**[Citation Graph (, )][DBLP]**Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs.**[Citation Graph (, )][DBLP]**On Berge Multiplication for Monotone Boolean Dualization.**[Citation Graph (, )][DBLP]**A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information.**[Citation Graph (, )][DBLP]**Complexity of Approximating the Vertex Centroid of a Polyhedron.**[Citation Graph (, )][DBLP]**Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems.**[Citation Graph (, )][DBLP]**On the approximability of the maximum feasible subsystem problem with 0/1-coefficients.**[Citation Graph (, )][DBLP]**A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics.**[Citation Graph (, )][DBLP]**Improved Approximations for Guarding 1.5-Dimensional Terrains.**[Citation Graph (, )][DBLP]**Approximating the Interval Constrained Coloring Problem.**[Citation Graph (, )][DBLP]**On Profit-Maximizing Pricing for the Highway and Tollbooth Problems.**[Citation Graph (, )][DBLP]**On Enumerating Minimal Dicuts and Strongly Connected Subgraphs.**[Citation Graph (, )][DBLP]**Generating Cut Conjunctions in Graphs and Related Problems.**[Citation Graph (, )][DBLP]**Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices**[Citation Graph (, )][DBLP]**Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra**[Citation Graph (, )][DBLP]**On Computing the Vertex Centroid of a Polyhedron**[Citation Graph (, )][DBLP]**Improved Approximations for Guarding 1.5-Dimensional Terrains**[Citation Graph (, )][DBLP]**On Profit-Maximizing Pricing for the Highway and Tollbooth Problems**[Citation Graph (, )][DBLP]**Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions.**[Citation Graph (, )][DBLP]**On the complexity of monotone dualization and generating minimal hypergraph transversals.**[Citation Graph (, )][DBLP]**Generating All Vertices of a Polyhedron Is Hard.**[Citation Graph (, )][DBLP]**Polynomial-time dualization of r-exact hypergraphs with applications in geometry.**[Citation Graph (, )][DBLP]
Search in 0.089secs, Finished in 0.093secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |