MPI-INF Logo
  • Home
  • MPI-INF D1 Publications, generated: 16:40, 25 September 2023

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 114 documents:

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

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

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

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

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

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

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

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

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

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

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

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