Generating all vertices of a polyhedron is hard L Khachiyan, E Boros, K Borys, V Gurvich, K Elbassioni Discrete & Computational Geometry 39, 174–190, 2009 | 208 | 2009 |

Quality of service management in network gateways C Akinlar, K Elbassioni, I Kamel US Patent 7,802,008, 2010 | 177 | 2010 |

Charge group partitioning in biomolecular simulation S Canzar, M El-Kebir, R Pool, K Elbassioni, AK Malde, AE Mark, ... Journal of Computational Biology 20 (3), 188-198, 2013 | 139 | 2013 |

On short paths interdiction problems: Total and node-wise limited interdiction L Khachiyan, E Boros, K Borys, K Elbassioni, V Gurvich, G Rudolf, J Zhao Theory of Computing Systems 43 (2), 204-233, 2008 | 112 | 2008 |

On the complexity of some enumeration problems for matroids L Khachiyan, E Boros, K Elbassioni, V Gurvich, K Makino SIAM Journal on Discrete Mathematics 19 (4), 966-984, 2005 | 85 | 2005 |

Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities E Boros, K Elbassioni, V Gurvich, L Khachiyan, K Makino SIAM Journal on Computing 31 (5), 1624-1643, 2002 | 80 | 2002 |

An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension E Boros, V Gurvich, K Elbassioni, L Khachiyan Parallel Processing Letters 10 (04), 253-266, 2000 | 72 | 2000 |

Approximation algorithms for Euclidean group TSP K Elbassioni, AV Fishkin, NH Mustafa, R Sitters International Colloquium on Automata, Languages, and Programming, 1115-1126, 2005 | 71 | 2005 |

An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation L Khachiyan, E Boros, K Elbassioni, V Gurvich Discrete Applied Mathematics 154 (16), 2350-2372, 2006 | 63 | 2006 |

Generating maximal independent sets for hypergraphs with bounded edge-intersections E Boros, K Elbassioni, V Gurvich, L Khachiyan Latin American Symposium on Theoretical Informatics, 488-498, 2004 | 63 | 2004 |

Improved approximations for guarding 1.5-dimensional terrains K Elbassioni, E Krohn, D Matijević, J Mestre, D Ševerdija Algorithmica 60 (2), 451-463, 2011 | 56 | 2011 |

Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods K Elbassioni, AV Fishkin, R Sitters International Journal of Computational Geometry & Applications 19 (02), 173-193, 2009 | 51 | 2009 |

A quasi-PTAS for profit-maximizing pricing on line graphs K Elbassioni, R Sitters, Y Zhang European Symposium on Algorithms, 451-462, 2007 | 45 | 2007 |

Autonomous recharging and flight mission planning for battery-operated autonomous drones CM Tseng, CK Chau, K Elbassioni, M Khonji arXiv preprint arXiv:1703.10049, 2017 | 40 | 2017 |

Conflict-free coloring for rectangle ranges using *O*(*n*^{.382}) colorsD Ajwani, K Elbassioni, S Govindarajan, S Ray Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007 | 39 | 2007 |

Drive mode optimization and path planning for plug-in hybrid electric vehicles CK Chau, K Elbassioni, CM Tseng IEEE Transactions on Intelligent Transportation Systems 18 (12), 3421-3432, 2017 | 38 | 2017 |

On profit-maximizing pricing for the highway and tollbooth problems K Elbassioni, R Raman, S Ray, R Sitters International Symposium on Algorithmic Game Theory, 275-286, 2009 | 36 | 2009 |

A global parallel algorithm for the hypergraph transversal problem L Khachiyan, E Boros, K Elbassioni, V Gurvich Information Processing Letters 101 (4), 148-155, 2007 | 34 | 2007 |

Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems E Boros, K Elbassioni, V Gurvich, L Khachiyan International Conference on Integer Programming and Combinatorial …, 2004 | 34* | 2004 |

Conflict-free colorings of rectangles ranges K Elbassioni, NH Mustafa Annual Symposium on Theoretical Aspects of Computer Science, 254-263, 2006 | 32 | 2006 |