Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2009 | ||
---|---|---|

75 | Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf: On the Readability of Monotone Boolean Formulae. COCOON 2009: 496-505 | |

74 | Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf: Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. ESA 2009: 143-154 | |

73 | Khaled M. Elbassioni, Hans Raj Tiwary: Complexity of Approximating the Vertex Centroid of a Polyhedron. ISAAC 2009: 413-422 | |

72 | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT 2009: 275-286 | |

71 | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters: On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. SODA 2009: 1210-1219 | |

70 | Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, Domagoj Severdija: Improved Approximations for Guarding 1.5-Dimensional Terrains. STACS 2009: 361-371 | |

69 | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems CoRR abs/0901.1140: (2009) | |

68 | Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters: Approximation Algorithms for the Euclidean Traveling Salesman Problem with Discrete and Continuous Neighborhoods. Int. J. Comput. Geometry Appl. 19(2): 173-193 (2009) | |

67 | Khaled M. Elbassioni: Algorithms for Dualization over Products of Partially Ordered Sets. SIAM J. Discrete Math. 23(1): 487-510 (2009) | |

2008 | ||

66 | Khaled M. Elbassioni, Hans Raj Tiwary: On a Cone Covering Problem. CCCG 2008 | |

65 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov: A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames. CSR 2008: 99-109 | |

64 | Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino: On Berge Multiplication for Monotone Boolean Dualization. ICALP (1) 2008: 48-59 | |

63 | Khaled M. Elbassioni, Matthias Hagen, Imran Rauf: Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems. IWPEC 2008: 91-102 | |

62 | Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre: Approximating the Interval Constrained Coloring Problem. SWAT 2008: 210-221 | |

61 | Hans Raj Tiwary, Khaled M. Elbassioni: On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. Symposium on Computational Geometry 2008: 192-198 | |

60 | Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel: Indexing Schemes for Multi-dimensional Moving Objects. Encyclopedia of GIS 2008: 523-529 | |

59 | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: On Enumerating Minimal Dicuts and Strongly Connected Subgraphs. Algorithmica 50(1): 159-172 (2008) | |

58 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Generating Cut Conjunctions in Graphs and Related Problems. Algorithmica 51(3): 239-263 (2008) | |

57 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary: Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra CoRR abs/0801.3790: (2008) | |

56 | Khaled M. Elbassioni, Hans Raj Tiwary: On Computing the Vertex Centroid of a Polyhedron CoRR abs/0806.3456: (2008) | |

55 | Khaled M. Elbassioni, Domagoj Matijevic, Julián Mestre, Domagoj Severdija: Improved Approximations for Guarding 1.5-Dimensional Terrains CoRR abs/0809.0159: (2008) | |

54 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating All Vertices of a Polyhedron Is Hard. Discrete & Computational Geometry 39(1-3): 174-190 (2008) | |

53 | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions. Discrete Applied Mathematics 156(11): 2020-2034 (2008) | |

52 | Khaled M. Elbassioni: On the complexity of monotone dualization and generating minimal hypergraph transversals. Discrete Applied Mathematics 156(11): 2109-2123 (2008) | |

51 | Khaled M. Elbassioni: A note on systems with max-min and max-product constraints. Fuzzy Sets and Systems 159(17): 2272-2277 (2008) | |

50 | Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan: Simultaneous matchings: Hardness and approximation. J. Comput. Syst. Sci. 74(5): 884-897 (2008) | |

49 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao: On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43(2): 204-233 (2008) | |

2007 | ||

48 | Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf: Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON 2007: 222-231 | |

47 | Khaled M. Elbassioni, René Sitters, Yan Zhang: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. ESA 2007: 451-462 | |

46 | Deepak Ajwani,
Khaled M. Elbassioni,
Sathish Govindarajan,
Saurabh Ray:
Conflict-free coloring for rectangle ranges using O(n^{.382}) colors.
SPAA 2007: 181-187 | |

45 | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory. Discrete Applied Mathematics 155(2): 137-149 (2007) | |

44 | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101(4): 148-155 (2007) | |

43 | Leonid Khachiyan, Endre Boros, Vladimir Gurvich, Khaled M. Elbassioni: Computing Many Maximal Independent Sets for Hypergraphs in Parallel. Parallel Processing Letters 17(2): 141-152 (2007) | |

42 | 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. Theor. Comput. Sci. 379(3): 361-376 (2007) | |

41 | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs. Theor. Comput. Sci. 382(2): 139-150 (2007) | |

2006 | ||

40 | Khaled M. Elbassioni: On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization. ESA 2006: 340-351 | |

39 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Enumerating Spanning and Connected Subsets in Graphs and Matroids. ESA 2006: 444-455 | |

38 | Khaled M. Elbassioni, Aleksei V. Fishkin, René Sitters: On Approximating the TSP with Intersecting Neighborhoods. ISAAC 2006: 213-222 | |

37 | Khaled M. Elbassioni: Finding All Minimal Infrequent Multi-dimensional Intervals. LATIN 2006: 423-434 | |

36 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich: Generating all vertices of a polyhedron is hard. SODA 2006: 758-765 | |

35 | Khaled M. Elbassioni, Nabil H. Mustafa: Conflict-Free Colorings of Rectangles Ranges. STACS 2006: 254-263 | |

34 | Khaled M. Elbassioni, Irit Katriel: Multiconsistency and Robustness with Global Constraints. Constraints 11(4): 335-352 (2006) | |

33 | 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. Discrete Applied Mathematics 154(16): 2350-2372 (2006) | |

32 | Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel: Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. Inf. Process. Lett. 100(2): 69-71 (2006) | |

31 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. Journal of Graph Theory 53(3): 209-232 (2006) | |

2005 | ||

30 | Amr Elmasry, Khaled M. Elbassioni: Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in the Plane. CCCG 2005: 248-251 | |

29 | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: A New Algorithm for the Hypergraph Transversal Problem. COCOON 2005: 767-776 | |

28 | Khaled M. Elbassioni, Irit Katriel: Multiconsistency and Robustness with Global Constraints. CPAIOR 2005: 168-182 | |

27 | Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, René Sitters: Approximation Algorithms for Euclidean Group TSP. ICALP 2005: 1115-1126 | |

26 | Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan: Simultaneous Matchings. ISAAC 2005: 106-115 | |

25 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. ISAAC 2005: 156-165 | |

24 | 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. MFCS 2005: 556-567 | |

23 | Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel: Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices CoRR abs/cs/0507038: (2005) | |

22 | Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel: An Indexing Method for Answering Queries on Moving Objects. Distributed and Parallel Databases 17(3): 215-249 (2005) | |

21 | Leonid G. Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino: On the Complexity of Some Enumeration Problems for Matroids. SIAM J. Discrete Math. 19(4): 966-984 (2005) | |

2004 | ||

20 | Khaled M. Elbassioni, Amr Elmasry, Vladimir Gurvich: A stronger version of Bárány's theorem in the plane. CCCG 2004: 4-6 | |

19 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich: Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. ESA 2004: 122-133 | |

18 | Mohamed F. Mokbel, Walid G. Aref, Khaled M. Elbassioni, Ibrahim Kamel: Scalable Multimedia Disk Scheduling. ICDE 2004: 498-509 | |

17 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. IPCO 2004: 152-162 | |

16 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. LATIN 2004: 488-498 | |

15 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: Generating Paths and Cuts in Multi-pole (Di)graphs. MFCS 2004: 298-309 | |

14 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Joint Generation Algorithm. WEA 2004: 114-128 | |

2003 | ||

13 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. ESA 2003: 556-567 | |

12 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: An Intersection Inequality for Discrete Distributions and Related Generation Problems. ICALP 2003: 543-555 | |

11 | Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel: An Efficient Indexing Scheme for Multi-dimensional Moving Objects. ICDT 2003: 422-436 | |

10 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Algorithms for Enumerating Circuits in Matroids. ISAAC 2003: 485-494 | |

9 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An inequality for polymatroid functions and its applications. Discrete Applied Mathematics 131(2): 255-281 (2003) | |

2002 | ||

8 | Khaled M. Elbassioni,
Amr Elmasry,
Ibrahim Kamel:
Efficient answering of polyhedral queries in r^{d} using bbs-trees.
CCCG 2002: 54-57 | |

7 | Khaled M. Elbassioni: An Algorithm for Dualization in Products of Lattices and Its Applications. ESA 2002: 424-435 | |

6 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: Matroid Intersections, Polymatroid Inequalities, and Related Problems. MFCS 2002: 143-154 | |

5 | Khaled M. Elbassioni: On Dualization in Products of Forests. STACS 2002: 142-153 | |

4 | 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. SIAM J. Comput. 31(5): 1624-1643 (2002) | |

2001 | ||

3 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino: On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. ICALP 2001: 92-103 | |

2 | Mahfuzur Rahman, Khaled M. Elbassioni, Ibrahim Kamel: Handling Large Real-Time Disk Access Requests With Variable Priorities. ICME 2001 | |

2000 | ||

1 | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan: An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension. Parallel Processing Letters 10(4): 253-266 (2000) |