Database Entry Point
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications, generated: 8:05, 20 April 2014

Search the publication database

  . Return

Your search returned the following 113 documents:

  1. Khaled Elbassioni, Imran Rauf, and Saurabh Ray
    On Enumerating Minimal Transversals of Geometric Hypergraphs

  2. Khaled Elbassioni, Parinya Chalermsook, Danupon Nanongkai, and He Sun
    Multi-Attribute Profit-Maximizing Pricing

  3. Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, and Fahimeh Ramezani
    On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
    In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), Hangzhou, China, 2013, 65-76
  4. Khaled Elbassioni
    A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
    In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 513-524
  5. Khaled Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, and Arindam Pal
    Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
    In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, Hyderabad, India, 2012, 267-275
  6. Stefan Canzar, Mohammed El-Kebir, Rene Pool, Khaled Elbassioni, Alpeshkumar K. Malde, Alan E. Mark, Daan P. Geerke, Leen Stougie, and Gunnar W. Klau
    Charge Group Partitioning in Biomolecular Simulation
    In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, Barcelona, Spain, 2012, 29-43
  7. Khaled Elbassioni and Hans Raj Tiwary
    Complexity of Approximating the Vertex Centroid of a Polyhedron
    Theoretical Computer Science 421: 56-61, 2012
  8. Deepak Ajwani, Khaled Elbassioni, Sathish Govindarajan, and Saurabh Ray
    Conflict-free coloring for rectangle ranges using O(n .382) colors
    Discrete & Computational Geometry 48 (1): 39-52, 2012
  9. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    Every Stochastic Game with Perfect Information Admits a Canonical Form
    Springer
  10. Khaled Elbassioni, Domagoj Matijevic, and Domagoj Severdija
    Guarding 1.5D terrains with demands
    International Journal of Computer Mathematics 89 (16): 2143-2151, 2012
  11. Khaled Elbassioni, Mohamed Fouad, and Elisa Bertino
    Modeling the Risk & Utility of Information Sharing in Social Networks
    In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, Amsterdam, the Netherlands, 2012, 441-450
  12. Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and René Sitters
    On the complexity of the highway problem
    Theoretical Computer Science 460: 70-77, 2012
  13. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
    Discrete Mathematics 312 (4): 772-788, 2012
  14. Khaled Elbassioni, Katarzyna Paluch, and Anke van Zuylen
    Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
    In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 501-506
  15. Khaled Elbassioni, Slobodan Jeli´c, and Domagoj Matijevi`c
    The relation of Connected Set Cover and Group Steiner Tree
    Theoretical Computer Science 438: 96-101, 2012
  16. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games
    . Note: unpublished
  17. T.-H. Hubert Chan and Khaled Elbassioni
    A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
    Discrete & Computational Geometry 46 (4): 704-723, 2011
  18. Ernst Althaus, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, and Julian Mestre
    Approximation Algorithms for the Interval Constrained Coloring Problem
    Algorithmica 61 (2): 342-361, 2011
  19. Khaled Elbassioni, Imran Rauf, and Saurabh Ray
    Enumerating Minimal Transversals of Geometric Hypergraphs
    In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), Toronto, Canada, 2011, 437-442
  20. Khaled Elbassioni, Amr Elmasry, and Kazuhisa Makino
    Finding Simplices containing the Origin in Two and Three Dimensions
    International Journal of Computational Geometry & Applications 21 (5): 495-506, 2011
  21. Khaled Elbassioni, Erik Krohn, Domagoj Matijevic, Julian Mestre, and Domagoj Severdija
    Improved Approximations for Guarding 1.5-Dimensional Terrains
    Algorithmica 60 (2): 451-463, 2011
  22. Khaled Elbassioni and Hans Raj Tiwary
    On a cone covering problem
    Computational Geometry 44 (3): 129-134, 2011
  23. Khaled Elbassioni, Kazuhisa Makino, and Imran Rauf
    On the readability of monotone Boolean formulae
    Journal of Combinatorial Optimization 22 (3): 293-304, 2011
  24. Stefan Canzar, Khaled Elbassioni, Gunnar W. Klau, and Julian Mestre
    On Tree-Constrained Matchings and Generalizations

  25. Stefan Canzar, Khaled Elbassioni, Gunnar W. Klau, and Julian Mestre
    On Tree-Constrained Matchings and Generalizations
    In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 98-109
  26. Endre Boros, Khaled Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, and Bodo Manthey
    Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
    In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Zurich, Switzerland, 2011, 147-158
  27. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Hans Raj Tiwary
    The negative cycles polyhedron and hardness of checking some polyhedral properties
    Annals of Operations Research 188 (1): 63-76, 2011
  28. Stefan Canzar, Khaled Elbassioni, and Julian Mestre
    A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
    In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), Austin, Texas, 2010, 23-33
  29. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
    In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, Lausanne, Switzerland, 2010, 341-354
  30. Khaled Elbassioni and Hubert Chan
    A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
    In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, USA, 2010, 256-267
  31. Khaled Elbassioni, Mahmoud Fouz, and Chaitanya Swamy
    Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
    In: Internet and Network Economics : 6th International Workshop, WINE 2010, Stanford, CA, USA, 2010, 462-472
  32. Khaled Elbassioni, Domagoj Matijevic, and Domagoj Severdija
    Guarding 1.5-Dimensional with Demands
    In: 26th European Workshop on Computational Geometry (EuroCG 2010), Dortmund, Germany, 2010, 133-136
  33. Endre Boros, Khaled Elbassioni, and Kazuhisa Makino
    Left-to-right multiplication for monotone Boolean dualization
    SIAM Journal on Computing 39 (7): 3424-3439, 2010
  34. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    On effectivity functions of game forms
    Games and Economic Behavior 68 (2): 512-531, 2010
  35. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games

  36. Stefan Canzar, Khaled Elbassioni, Amr Elmasry, and Rajiv Raman
    On the Approximability of the Maximum Interval Constrained Coloring Problem
    In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, Jeju Island, Korea, 2010, 168-179
  37. Khaled Elbassioni and Imran Rauf
    Polynomial-time dualization of r-exact hypergraphs with applications in geometry
    Discrete Mathematics 310 (17-18): 2356-2363, 2010
  38. Khaled Elbassioni and Imran Rauf
    Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry
    . Note: (submitted to a journal)
  39. George Christodoulou, Khaled Elbassioni, and Mahmoud Fouz
    Truthful Mechanisms for Exhibitions
    In: Internet and Network Economics : 6th International Workshop, WINE 2010, Stanford, CA, USA, 2010, 170-181
  40. Khaled Elbassioni
    Algorithms for Dualization over Products of Partially Ordered Sets
    SIAM Journal on Discrete Mathematics 23 (1): 487-510, 2009
  41. Khaled Elbassioni, Aleksei V. Fishkin, and René Sitters
    Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
    International Journal of Computational Geometry & Applications 19 (2): 173-193, 2009
  42. Khaled Elbassioni and Hans Raj Tiwary
    Complexity of Approximating the Vertex Centroid of a Polyhedron
    In: Algorithms and Computation, 20th International Symposium (ISAAC), Honolulu, Hawaii, USA, 2009, 413-422
  43. Khaled Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, and Domagoj Severdija
    Improved Approximation Algorithms for 1.5D Terrain Guarding
    In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), Freiburg - Germany, 2009, 361-371
  44. Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julián Mestre, and Domagoj Severdija
    Improved Approximations for Guarding 1.5-Dimensional Terrains
    Algorithmica Online First: 1-13, 2009
  45. Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and Rene Sitters
    On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
    In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, Paphos, Cyprus, 2009, 275-286
    [PDF: Download: 0901.1140v2.pdf]
  46. Khaled Elbassioni, Rajiv Raman, Saurabh Ray, and Rene Sitters
    On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
    In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009, 1210-1219, paper no. 12.B.
  47. Khaled Elbassioni, Kazuhisa Makino, and Imran Rauf
    On the Readability of Monotone Boolean Formulae
    In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, Niagara Falls, New York, USA, 2009, 496-505
    [PDF: Download: cocoon09.pdf]
  48. Khaled Elbassioni, Kazuhisa Makino, and Imran Rauf
    Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
    In: Algorithms - ESA 2009 : 17th Annual European Symposium, Copenhagen, Denmark, 2009, 143-154
    [PDF: Download: esa09.pdf]
  49. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino, and Vladimir Oudalov
    A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
    In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, 2008, 99-109
  50. Khaled Elbassioni
    A note on systems with max-min and max-product constraints
    Fuzzy Sets and Systems 159 (17): 2272-2277, 2008
  51. Ernst Althaus, Stefan Canzar, Khaled Elbassioni, Andreas Karrenbauer, and Julián Mestre
    Approximating the Interval Constrained Coloring Problem
    In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), Gothenburg, Sweden, 2008, 210-221
  52. Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Hans Raj Tiwary
    Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
    CoRR abs/0801.3790, 2008
  53. Leonid Khachiyan, Endre Boros, Khaled Elbassioni, and 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
  54. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, and Vladimir Gurvich
    Generating All Vertices of a Polyhedron Is Hard
    Discrete & Computational Geometry 39 (1-3): 174-190, 2008
  55. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    Generating Cut Conjunctions in Graphs and Related Problems
    Algorithmica 51 (3): 239-263, 2008
  56. Khaled Elbassioni, Amr Elmasry, and Ibrahim Kamel
    Indexing Schemes for Multi-dimensional Moving Objects
    In: Encyclopedia of GIS, 2008, 523-529
  57. Khaled Elbassioni and Hans Raj Tiwary
    On a Cone Covering Problem
    In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montreal, Canada, 2008, 171-174
  58. Endre Boros, Khaled Elbassioni, and Kazuhisa Makino
    On Berge Multiplication for Monotone Boolean Dualization
    In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, 2008, 48-59
  59. Khaled Elbassioni and Hans Raj Tiwary
    On Computing the Vertex Centroid of a Polyhedron
    CoRR abs/0806.3456, 2008
  60. Leonid Khachiyan, Endre Boros, Khaled Elbassioni, and Vladimir Gurvich
    On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
    Algorithmica 50 (1): 159-172, 2008
  61. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, Gabor Rudolf, and Jihui Zhao
    On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
    Theory Comput. Syst. 43 (2): 204-233, 2008
  62. Hans Raj Tiwary and Khaled Elbassioni
    On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
    In: Symposium on Computational Geometry 2008, College Park, MD, USA,, 2008, 192-198
  63. Khaled Elbassioni
    On the complexity of monotone dualization and generating minimal hypergraph transversals
    Discrete Applied Mathematics 156 (11): 2109-2123, 2008
  64. Martin Kutz, Khaled Elbassioni, Irit Katriel, and Meena Mahajan
    Simultaneous matchings: Hardness and approximation
    J. Comput. Syst. Sci. 74 (5): 884-897, 2008
  65. Khaled Elbassioni, Matthias Hagen, and Imran Rauf
    Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
    In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, 2008, 91-102
  66. Leonid Khachiyan, Endre Boros, Khaled Elbassioni, and Vladimir Gurvich
    A global parallel algorithm for the hypergraph transversal problem
    Information Processing Letters 101 (4): 148-155, 2007
  67. Khaled M. Elbassioni, Rene Sitters, and Yan Zhang
    A Quasi-PTAS for Envy-free Pricing on Line Graphs

    [PS: Download: htp.ps]
  68. Khaled Elbassioni, Rene Sitters, and Yan Zhang
    A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
    In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, Eilat, Israel, 2007, 451-462
  69. Deepak Ajwani, Khaled Elbassioni, Sathish Govindarajan, and Saurabh Ray
    Conflict-free coloring for rectangle ranges using $n^.382$ colors
    In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, San Diego, California, 2007, 181-187
  70. Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, and Saurabh Ray
    Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
    In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), San Diego, CA, USA, 2007. Note: To Appear
  71. Leonid Khachiyan, Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
    Theoretical Computer Science 379 (3): 361-376, 2007
  72. Leonid Khachiyan, Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
    Discrete Applied Mathematics 155 (2): 137-149, 2007
  73. Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino, and Gabor Rudolf
    Generating Minimal k-Vertex Connected Spanning Subgraphs
    In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, Banff, Canada, 2007, 222-231
  74. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    Generating Vertices of Polyhedra and Related Monotone Generation Problems

  75. Leonid Khachiyan, Endre Boros, Khaled Elbassioni, and Vladimir Gurvich
    On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
    Theoretical Computer Science 382 (2): 139-150, 2007
  76. Khaled M. Elbassioni and Nabil H. Mustafa
    Conflict-Free Colorings of Rectangle Ranges
    In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, 2006, 254-263
  77. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    Enumerating Spanning and Connected Subsets in Graphs and Matroids
    In: Algorithms - ESA 2006, 14th Annual European Symposium, Zürich, Switzerland, 2006, 444-455
  78. Khaled M. Elbassioni
    Finding All Minimal Infrequent Multi-dimensional Intervals
    In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, 2006, 423-434
  79. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, and Vladimir Gurvich
    Generating All Vertices of a Polyhedron is Hard
    In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, Miami, FL, USA, 2006, 758-765
  80. Khaled M. Elbassioni
    Multiconsistency and Robustness with Global Constraints
    Constraints 11 (4): 335-352, 2006
  81. Khaled M. Elbassioni, Aleksei V. Fishkin, and Rene Sitters
    On Approximating the TSP with Intersecting Neighborhoods
    In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, 2006, 213-222
  82. Khaled M. Elbassioni
    On the Complexity of Monotone Boolean Duality Testing
    DIMACS, Piscataway, DIMACS TR: 2006-01
  83. Khaled M. Elbassioni
    On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
    In: Algorithms - ESA 2006, 14th Annual European Symposium, Zürich, Switzerland, 2006, 340-351
  84. Khaled M. Elbassioni, Zvi Lotker, and Raimund Seidel
    Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
    Information Processing Letters 100 (2): 69 - 71, 2006
  85. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, and Vladimir Gurvich
    A New Algorithm for the Hypergraph Transversal Problem
    In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, Kunming, China, 2005, 767-776
  86. Khaled M. Elbassioni, Amr Elmasry, and Ibrahim Kamel
    An Indexing Method for Answering Queries on Moving Objects
    Distributed and Parallel Databases 17 (3): 215-249, 2005
  87. Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, and Rene Sitters
    Approximation algorithms for Euclidean Group TSP
    In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, 2005, 1115-1126
  88. Khaled M. Elbassioni and Nabil H. Mustafa
    Conflict-Free Colorings of Rectangle Ranges for Wireless Networks

    [PS: Download: rectangles.ps]
  89. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, and Vladimir Gurvich
    Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
    In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, Gdansk, Poland, 2005, 556-567
  90. Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, and Vladimir Gurvich
    Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
    In: Algorithms and computation : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, 2005, 156-165
  91. Khaled M. Elbassioni and Irit Katriel
    Multiconsistency and Robustness with Global Constraints
    In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, Prague, Czech Republic, 2005, 168-182
  92. Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, and Kazuhisa Makino
    On the Complexity of Some Enumeration Problems for Matroids
    SIAM Journal on Discrete Mathematics 19 (4): 966-984, 2005
  93. Amr Elmasry and Khaled M. Elbassioni
    Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
    In: 17th Canadian Conference on Computational Geometry (CCCG'05), Windsor, Canada, 2005, 248-251
  94. Khaled M. Elbassioni, Irit Katriel, Martin Kutz, and Meena Mahajan
    Simultaneous Matchings
    In: Algorithms and computation : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, 2005, 106-115
  95. Endre Boros, Khaled M. Elbassioni, and Vladimir Gurvich
    Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
    In: Algorithms – ESA 2004: 12th Annual European Symposium, Bergen, Norway, 2004, 122-133
    [PDF: Download: ESA04.pdf]
  96. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, and Leonid Khachiyan
    An Efficient Implementation of a Joint Generation Algorithm
    In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, Angra dos Reis, Brazil, 2004, 114-128
    [PDF: Download: WAE04.pdf]
  97. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, and Leonid Khachiyan
    Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
    In: Integer programming and combinatorial optimization : 10th International IPCO Conference, New York, NY, USA, 2004, 152-162
    [PDF: Download: IPCO04.pdf]
  98. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, and Leonid Khachiyan
    Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
    In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, 2004, 488-498
    [PDF: Download: LATIN04.pdf]
  99. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, and Kazuhisa Makino
    Generating Paths and Cuts in Multi-pole (Di)graphs
    In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, Prague, Czech Republic, 2004, 298-309
    [PDF: Download: MFCS04.pdf]
  100. Mohamed F. Mokbel, Walid G. Aref, Khaled M. Elbassioni, and Ibrahim Kamel
    Scalable Multimedia Disk Scheduling
    In: 20th International Conference on Data Engineering, ICDE 2004, Boston, USA, 2004, 498-509
    [PDF: Download: ICDE04.pdf]
  101. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, and Leonid Khachiyan
    Algorithms for Enumerating Circuits in Matroids.
    In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, 2003, 485-494
    [PDF: Download: ISAAC2003.pdf]
  102. Endre Boros, Khaled M. Elbassioni, Leonid Khachiyan, and Vladimir Gurvich
    An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
    In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, 2003, 556-567
    [PDF: Download: ESA03.pdf]
  103. Khaled M. Elbassioni, Amr Elmasry, and Ibrahim Kamel
    An Efficient Indexing Scheme for Multi-dimensional Moving Objects
    In: Database Theory - ICDT 2003, 9th International Conference, Siena, Italy, 2003, 425-439
    [PDF: Download: ICDT03.pdf]
  104. Endre Boros, Khaled M. Elbassioni, Leonid Khachiyan, and Vladimir Gurvich
    An Inequality for Polymatroid Functions and its Applications
    Discrete Applied mathematics 131: 27 p., 2003

  105. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, and Kazuhisa Makino
    An Intersection Inequality for Discrete Distributions and Related Generation Problems
    In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, 2003, 543-555
    [PDF: Download: ICALP03.pdf]
  106. Endre Boros, Khaled M. Elbassioni, Leonid Khachiyan, and Vladimir Gurvich
    Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
    Mathematical Programming, Ser. B 98 (1-3): 14 p., 2003

  107. Khaled M. Elbassioni
    An Algorithm for Dualization in Products of Lattices and Its Applications
    In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, 2002, 424-435
    [PDF: Download: ESA02.pdf]
  108. Endre Boros, Khaled M. Elbassioni, Leonid Khachiyan, Vladimir Gurvich, and Kazuhisa Makino
    Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
    SIAM Journal on Computing 31: 20 p., 2002

  109. Endre Boros, Khaled M. Elbassioni, Leonid Khachiyan, and Vladimir Gurvich
    Generating Dual-Bounded Hypergraphs
    Optimization Methods and Software 17 (5): 33 p., 2002
    [PS: Download: oms.ps]
  110. Endre Boros, Khaled M. Elbassioni, Leonid Khachiyan, and Vladimir Gurvich
    Matroid Intersections, Polymatroid Inequalities, and Related Problems
    In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, 2002, 143-154
    [PDF: Download: MFCS02.pdf]
  111. Khaled M. Elbassioni
    On Dualization in Products of Forests.
    In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, 2002, 142-153
    [PDF: Download: stacs02.pdf]
  112. Endre Boros, Khaled M. Elbassioni, Leonid Khachiyan, and Vladimir Gurvich
    An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
    Parallel Processing Letters 10 (4): 14 p., 2000

  113. Endre Boros, Khaled M. Elbassioni, Leonid Khachiyan, Vladimir Gurvich, and Kazuhisa Makino
    On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
    In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Heraklion, Crete, Greece, 2001, 92-103
    [PDF: Download: icalp01.pdf]