A New Algorithm for Parameterized MAX-SAT. - Ivan Bliznets; Alexander Golovnev (IPEC, 2012)

Largest Chordal and Interval Subgraphs Faster Than 2 n. - Ivan Bliznets; Fedor V. Fomin; Michal Pilipczuk; Yngve Villanger (ESA, 2013)

Kernelization lower bound for Permutation Pattern Matching. - Ivan Bliznets; Marek Cygan; Pawel Komosa; Lukás Mach (Inf. Process. Lett., 2015)

A Subexponential Parameterized Algorithm for Proper Interval Completion. - Ivan Bliznets; Fedor V. Fomin; Marcin Pilipczuk; Michal Pilipczuk (SIAM J. Discret. Math., 2015)

Hardness of Approximation for H-Free Edge Modification Problems. - Ivan Bliznets; Marek Cygan; Pawel Komosa; Michal Pilipczuk (APPROX-RANDOM, 2016)

Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers. - Virajith Jalaparti; Ivan Bliznets; Srikanth Kandula; Brendan Lucier; Ishai Menache (SIGCOMM, 2016)

Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. - Ivan Bliznets; Fedor V. Fomin; Michal Pilipczuk; Yngve Villanger (Algorithmica, 2016)

Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. - Ivan Bliznets; Nikolay Karpov (MFCS, 2017)

Parameterized Complexity of Superstring Problems. - Ivan Bliznets; Fedor V. Fomin; Petr A. Golovach; Nikolay Karpov; Alexander S. Kulikov; Saket Saurabh 001 (Algorithmica, 2017)

Upper and Lower Bounds for Different Parameterizations of (n, 3)-MAXSAT. - Tatiana Belova; Ivan Bliznets (COCOA, 2018)

Solving Target Set Selection with Bounded Thresholds Faster than 2^n. - Ivan Bliznets; Danil Sagunov (IPEC, 2018)

Subexponential Parameterized Algorithm for Interval Completion. - Ivan Bliznets; Fedor V. Fomin; Marcin Pilipczuk; Michal Pilipczuk (ACM Trans. Algorithms, 2018)

Hardness of Approximation for H-free Edge Modification Problems. - Ivan Bliznets; Marek Cygan; Pawel Komosa; Michal Pilipczuk (ACM Trans. Comput. Theory, 2018)

On Happy Colorings, Cuts, and Structural Parameterizations. - Ivan Bliznets; Danil Sagunov (WG, 2019)

Maximizing Happiness in Graphs of Bounded Clique-Width. - Ivan Bliznets; Danil Sagunov (LATIN, 2020)

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems. - Ivan Bliznets; Marek Cygan; Pawel Komosa; Michal Pilipczuk; Lukás Mach (ACM Trans. Algorithms, 2020)

Algorithms for (n, 3)-MAXSAT and parameterization above the all-true assignment. - Tatiana Belova; Ivan Bliznets (Theor. Comput. Sci., 2020)

Lower bounds for the happy coloring problems. - Ivan Bliznets; Danil Sagunov (Theor. Comput. Sci., 2020)

New Length Dependent Algorithm for Maximum Satisfiability Problem. - Vasily Alferov; Ivan Bliznets (AAAI, 2021)

Two Generalizations of Proper Coloring: Hardness and Approximability. - Ivan Bliznets; Danil Sagunov (COCOON, 2022)

Fine-grained Complexity of Partial Minimum Satisfiability. - Ivan Bliznets; Danil Sagunov; Kirill Simonov (IJCAI, 2022)

Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. - Tatiana Belova; Ivan Bliznets (ISAAC, 2022)

Improved Algorithms for Maximum Satisfiability and Its Special Cases. - Kirill Brilliantov; Vasily Alferov; Ivan Bliznets (AAAI, 2023)

Enumeration of Minimal Tropical Connected Sets. - Ivan Bliznets; Danil Sagunov; Eugene Tagin (CIAC, 2023)

MaxCut Above Guarantee. - Ivan Bliznets; Vladislav Epifanov (MFCS, 2023)

Solving Target Set Selection with Bounded Thresholds Faster than 2n. - Ivan Bliznets; Danil Sagunov (Algorithmica, 2023)

Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph. - Vasily Alferov; Ivan Bliznets; Kirill Brilliantov (AAAI, 2024)

Parameterized Complexity of Paired Domination. - Nikita Andreev; Ivan Bliznets; Madhumita Kundu; Saket Saurabh 001; Vikash Tripathi; Shaily Verma (IWOCA, 2024)

Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations. - Samuel Bismuth; Ivan Bliznets; Erel Segal-Halevi (SAGT, 2024)

Parameterized Algorithms for Covering by Arithmetic Progressions. - Ivan Bliznets; Jesper Nederlof; Krisztina Szilágyi (SOFSEM, 2024)

Tight Double Exponential Lower Bounds. - Ivan Bliznets; Markus Hecher (TAMC, 2024)

Fair division with minimal withheld information in social networks. - Ivan Bliznets; Anton Bukov; Danil Sagunov (Theor. Comput. Sci., 2024)

Exact and parameterized algorithms for choosability. - Ivan Bliznets; Jesper Nederlof (Acta Informatica, 2025)