| 2020 | GECCO | Just-in-time batch scheduling subject to batch size. | Sergey Polyakovskiy, Dhananjay R. Thiruvady, Rym M'Hallah |
| 2018 | GECCO | Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem. | Junhua Wu, Sergey Polyakovskiy, Markus Wagner, Frank Neumann |
| 2017 | GECCO | Just-in-time batch scheduling problem with two-dimensional bin packing constraints. | Sergey Polyakovskiy, Alexander Makarowsky, Rym M'Hallah |
| 2016 | GECCO | On the Impact of the Renting Rate for the Unconstrained Nonlinear Knapsack Problem. | Junhua Wu, Sergey Polyakovskiy, Frank Neumann |
| 2015 | CPAIOR | Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems. | Sergey Polyakovskiy, Frank Neumann |
| 2015 | GECCO | Approximate Approaches to the Traveling Thief Problem. | Hayden Faulkner, Sergey Polyakovskiy, Tom Schultz, Markus Wagner |
| 2014 | GECCO | A comprehensive benchmark set and heuristics for the traveling thief problem. | Sergey Polyakovskiy, Mohammad Reza Bonyadi, Markus Wagner, Zbigniew Michalewicz, Frank Neumann |
| 2010 | SODA | The Focus of Attention Problem. | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
| 2009 | WAOA | Between a Rock and a Hard Place: The Two-to-One Assignment Problem. | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |