| 2025 | SAGT | Linear Contracts for Supermodular Functions Based on Graphs. | Kanstantsin Pashkovich, Jacob Skitsko |
| 2025 | WAOA | Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three. | Kanstantsin Pashkovich, Thomas Snow |
| 2024 | SAGT | Matroid Bayesian Online Selection. | Ian DeHaan, Kanstantsin Pashkovich |
| 2020 | SAGT | Approximating Stable Matchings with Ties of Bounded Size. | Jochen Knemann, Kanstantsin Pashkovich, Natig Tofigzade |
| 2019 | IPCO | Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time. | Jochen Knemann, Kanstantsin Pashkovich, Justin Toth |
| 2016 | ISAAC | Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. | Andreas Emil Feldmann, Jochen Knemann, Kanstantsin Pashkovich, Laura Sanit |
| 2015 | ESA | Enumeration of 2-Level Polytopes. | Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich |
| 2011 | IPCO | Constructing Extended Formulations from Reflection Relations. | Volker Kaibel, Kanstantsin Pashkovich |
| 2010 | IPCO | Symmetry Matters for the Sizes of Extended Formulations. | Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis |