| 2020 | CSR | Computational Hardness of Multidimensional Subtraction Games. | Vladimir Gurvich, Mikhail N. Vyalyi |
| 2019 | WADS | Avoidable Vertices and Edges in Graphs. | Jesse Beisegel, Maria Chudnovsky, Vladimir Gurvich, Martin Milanic, Mary Servatius |
| 2018 | CSR | Complexity of Generation. | Vladimir Gurvich |
| 2015 | STACS | Markov Decision Processes and Stochastic Games with Total Effective Payoff. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 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 |
| 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 |
| 2011 | ICALP | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes. | Endre Boros, Khaled M. Elbassioni, Mahmoud Fouz, Vladimir Gurvich, Kazuhisa Makino, Bodo Manthey |
| 2010 | IPCO | A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino |
| 2009 | AAIM | On Acyclicity of Games with Cycles. | Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen |
| 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 |
| 2007 | COCOON | Generating Minimal k-Vertex Connected Spanning Subgraphs. | Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gbor Rudolf |
| 2006 | CSR | Extending Dijkstra's Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction. | Leonid Khachiyan, Vladimir Gurvich, Jihui Zhao |
| 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 | SODA | Generating all vertices of a polyhedron is hard. | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich |
| 2005 | COCOON | A New Algorithm for the Hypergraph Transversal Problem. | Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich |
| 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 | 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 | ISAAC | Algorithms for Enumerating Circuits in Matroids. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2002 | MFCS | Matroid Intersections, Polymatroid Inequalities, and Related Problems. | Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan |
| 2002 | STACS | On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets. | Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |
| 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 |
| 2000 | ICALP | Generating Partial and Multiple Transversals of a Hypergraph. | Endre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino |