| 2024 | AAAI | Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph. | Vasily Alferov, Ivan Bliznets, Kirill Brilliantov |
| 2024 | IWOCA | Parameterized Complexity of Paired Domination. | Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma |
| 2024 | SAGT | Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations. | Samuel Bismuth, Ivan Bliznets, Erel Segal-Halevi |
| 2024 | SOFSEM | Exact and Parameterized Algorithms for Choosability. | Ivan Bliznets, Jesper Nederlof |
| 2024 | SOFSEM | Parameterized Algorithms for Covering by Arithmetic Progressions. | Ivan Bliznets, Jesper Nederlof, Krisztina Szilgyi |
| 2024 | TAMC | Tight Double Exponential Lower Bounds. | Ivan Bliznets, Markus Hecher |
| 2023 | AAAI | Improved Algorithms for Maximum Satisfiability and Its Special Cases. | Kirill Brilliantov, Vasily Alferov, Ivan Bliznets |
| 2023 | CIAC | Enumeration of Minimal Tropical Connected Sets. | Ivan Bliznets, Danil Sagunov, Eugene Tagin |
| 2023 | MFCS | MaxCut Above Guarantee. | Ivan Bliznets, Vladislav Epifanov |
| 2022 | COCOON | Fair Division with Minimal Withheld Information in Social Networks. | Ivan Bliznets, Anton Bukov, Danil Sagunov |
| 2022 | COCOON | Two Generalizations of Proper Coloring: Hardness and Approximability. | Ivan Bliznets, Danil Sagunov |
| 2022 | IJCAI | Fine-grained Complexity of Partial Minimum Satisfiability. | Ivan Bliznets, Danil Sagunov, Kirill Simonov |
| 2022 | ISAAC | Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. | Tatiana Belova, Ivan Bliznets |
| 2021 | AAAI | New Length Dependent Algorithm for Maximum Satisfiability Problem. | Vasily Alferov, Ivan Bliznets |
| 2020 | LATIN | Maximizing Happiness in Graphs of Bounded Clique-Width. | Ivan Bliznets, Danil Sagunov |
| 2019 | COCOON | Lower Bounds for the Happy Coloring Problems. | Ivan Bliznets, Danil Sagunov |
| 2019 | WG | On Happy Colorings, Cuts, and Structural Parameterizations. | Ivan Bliznets, Danil Sagunov |
| 2018 | COCOA | Upper and Lower Bounds for Different Parameterizations of (n, 3)-MAXSAT. | Tatiana Belova, Ivan Bliznets |
| 2017 | MFCS | Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. | Ivan Bliznets, Nikolay Karpov |
| 2016 | SODA | Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. | Ivan Bliznets, Marek Cygan, Pawel Komosa, Luks Mach, Michal Pilipczuk |
| 2016 | SODA | Subexponential parameterized algorithm for Interval Completion. | Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk |
| 2016 | SIGCOMM | Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers. | Virajith Jalaparti, Ivan Bliznets, Srikanth Kandula, Brendan Lucier, Ishai Menache |
| 2015 | CPM | Parameterized Complexity of Superstring Problems. | Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh |
| 2014 | ESA | A Subexponential Parameterized Algorithm for Proper Interval Completion. | Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk |
| 2013 | ESA | Largest Chordal and Interval Subgraphs Faster Than 2 n. | Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger |