Your search returned the following 7 documents:

7. 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
   
6. 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
   
5. 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
   
4. 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
   
3. 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
   
2. 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
   
1. 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