| 2020 | LATIN | Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-Relaxations. | Khaled M. Elbassioni |
| 2019 | ESA | Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs. | Khaled M. Elbassioni, Kazuhisa Makino |
| 2019 | RECOMB | Dynamic Pseudo-time Warping of Complex Single-Cell Trajectories. | Van Hoan Do, Mislav Blazevic, Pablo Monteagudo, Luka Borozan, Khaled M. Elbassioni, Sren Laue, Francisca Rojas Ringeling, Domagoj Matijevic, Stefan Canzar |
| 2018 | SENSYS | Smart lighting control using oblivious mobile sensors. | Areg Karapetyan, Sid Chi-Kin Chau, Khaled M. Elbassioni, Majid Khonji, Emad Dababseh |
| 2017 | SETTA | Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs. | Vahid Hashemi, Andrea Turrini, Ernst Moritz Hahn, Holger Hermanns, Khaled M. Elbassioni |
| 2016 | COCOON | Complex-Demand Scheduling Problem with Application in Smart Grid. | Majid Khonji, Areg Karapetyan, Khaled M. Elbassioni, Sid Chi-Kin Chau |
| 2016 | WAOA | A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs. | Khaled M. Elbassioni, Kazuhisa Makino, Waleed Najy |
| 2015 | STACS | Markov Decision Processes and Stochastic Games with Total Effective Payoff. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2015 | SAGT | Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design. | Khaled M. Elbassioni, Kurt Mehlhorn, Fahimeh Ramezani |
| 2014 | COCOA | A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2014 | ICCCN | Inapproximability of power allocation with inelastic demands in AC electric systems and networks. | Majid Khonji, Sid Chi-Kin Chau, Khaled M. Elbassioni |
| 2013 | COCOON | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets. | Khaled M. Elbassioni, Kazuhisa Makino, Kurt Mehlhorn, Fahimeh Ramezani |
| 2013 | ICALP | A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2012 | ICALP | A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs. | Khaled M. Elbassioni |
| 2012 | RECOMB | Charge Group Partitioning in Biomolecular Simulation. | Stefan Canzar, Mohammed El-Kebir, Ren Pool, Khaled M. Elbassioni, Alpeshkumar K. Malde, Alan E. Mark, Daan P. Geerke, Leen Stougie, Gunnar W. Klau |
| 2012 | STACS | Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. | Katarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen |
| 2011 | ICALP | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. | Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey |
| 2011 | ICALP | On Tree-Constrained Matchings and Generalizations. | Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Klau, Julin Mestre |
| 2010 | ALENEX | A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem. | Stefan Canzar, Khaled M. Elbassioni, Julin Mestre |
| 2010 | IPCO | A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2010 | ISAAC | On the Approximability of the Maximum Interval Constrained Coloring Problem. | Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman |
| 2010 | SODA | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. | T.-H. Hubert Chan, Khaled M. Elbassioni |
| 2009 | COCOON | On the Readability of Monotone Boolean Formulae. | Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf |
| 2009 | ESA | Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. | Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf |
| 2009 | ISAAC | Complexity of Approximating the Vertex Centroid of a Polyhedron. | Khaled M. Elbassioni, Hans Raj Tiwary |
| 2009 | SODA | On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, Ren Sitters |
| 2009 | STACS | Improved Approximations for Guarding 1.5-Dimensional Terrains. | Khaled M. Elbassioni, Erik Krohn, Domagoj Matijevic, Julin Mestre, Domagoj Severdija |
| 2009 | SAGT | On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, Ren Sitters |
| 2008 | CSR | A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 22 Subgames. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov |
| 2008 | ICALP | On Berge Multiplication for Monotone Boolean Dualization. | Endre Boros, Khaled M. Elbassioni, Kazuhisa Makino |
| 2007 | COCOON | Generating Minimal k-Vertex Connected Spanning Subgraphs. | Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gbor Rudolf |
| 2007 | ESA | A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. | Khaled M. Elbassioni, Ren Sitters, Yan Zhang |
| 2007 | SPAA | Conflict-free coloring for rectangle ranges using | Deepak Ajwani, Khaled M. Elbassioni, Sathish Govindarajan, Saurabh Ray |
| 2006 | ESA | On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization. | Khaled M. Elbassioni |
| 2006 | ESA | Enumerating Spanning and Connected Subsets in Graphs and Matroids. | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2006 | ISAAC | On Approximating the TSP with Intersecting Neighborhoods. | Khaled M. Elbassioni, Aleksei V. Fishkin, Ren Sitters |
| 2006 | LATIN | Finding All Minimal Infrequent Multi-dimensional Intervals. | Khaled M. Elbassioni |
| 2006 | SODA | Generating all vertices of a polyhedron is hard. | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich |
| 2006 | STACS | Conflict-Free Colorings of Rectangles Ranges. | Khaled M. Elbassioni, Nabil H. Mustafa |
| 2005 | COCOON | A New Algorithm for the Hypergraph Transversal Problem. | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
| 2005 | CPAIOR | Multiconsistency and Robustness with Global Constraints. | Khaled M. Elbassioni, Irit Katriel |
| 2005 | ICALP | Approximation Algorithms for Euclidean Group TSP. | Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H. Mustafa, Ren Sitters |
| 2005 | ISAAC | Simultaneous Matchings. | Khaled M. Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan |
| 2005 | ISAAC | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs. | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2005 | MFCS | Generating All Minimal Integral Solutions to Monotone and, or-Systems of Linear, Transversal and Polymatroid Inequalities. | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
| 2004 | ESA | Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
| 2004 | ICDE | Scalable Multimedia Disk Scheduling. | Mohamed F. Mokbel, Walid G. Aref, Khaled M. Elbassioni, Ibrahim Kamel |
| 2004 | IPCO | Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2004 | LATIN | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2004 | MFCS | Generating Paths and Cuts in Multi-pole (Di)graphs. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2003 | ESA | An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2003 | ICALP | An Intersection Inequality for Discrete Distributions and Related Generation Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 2003 | ICDT | An Efficient Indexing Scheme for Multi-dimensional Moving Objects. | Khaled M. Elbassioni, Amr Elmasry, Ibrahim Kamel |
| 2003 | ISAAC | Algorithms for Enumerating Circuits in Matroids. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2002 | ESA | An Algorithm for Dualization in Products of Lattices and Its Applications. | Khaled M. Elbassioni |
| 2002 | MFCS | Matroid Intersections, Polymatroid Inequalities, and Related Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2002 | STACS | On Dualization in Products of Forests. | Khaled M. Elbassioni |
| 2001 | ICALP | On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |