Ivan Bliznets

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 39

Top Topics

Highly Connected

Parameterized Complexity

Top Venues

Theor. Comput. Sci.

Publications

Vasily Alferov, Ivan Bliznets, Kirill Brilliantov
Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph. AAAI (2024)
Ivan Bliznets, Jesper Nederlof
Exact and Parameterized Algorithms for Choosability. SOFSEM (2024)
Ivan Bliznets, Jesper Nedelof, Krisztina Szilágyi
Parameterized Algorithms for Covering by Arithmetic Progressions. SOFSEM (2024)
Ivan Bliznets, Markus Hecher
Tight Double Exponential Lower Bounds. TAMC (2024)
Nikita Andreev, Ivan Bliznets, Madhumita Kundu, Saket Saurabh, Vikash Tripathi, Shaily Verma
Parameterized Complexity of Paired Domination. IWOCA (2024)
Ivan Bliznets, Anton Bukov, Danil Sagunov
Fair division with minimal withheld information in social networks. Theor. Comput. Sci. 991 (2024)
Kirill Brilliantov, Vasily Alferov, Ivan Bliznets
Improved Algorithms for Maximum Satisfiability and Its Special Cases. AAAI (2023)
Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi
Parameterized Algorithms for Covering by Arithmetic Progressions. CoRR (2023)
Ivan Bliznets, Danil Sagunov
. Algorithmica 85 (2) (2023)
Ivan Bliznets, Danil Sagunov, Eugene Tagin
Enumeration of Minimal Tropical Connected Sets. CIAC (2023)
Ivan Bliznets, Vladislav Epifanov
MaxCut Above Guarantee. MFCS (2023)
Ivan Bliznets, Danil Sagunov
Two Generalizations of Proper Coloring: Hardness and Approximability. COCOON (2022)
Ivan Bliznets, Anton Bukov, Danil Sagunov
Fair Division with Minimal Withheld Information in Social Networks. COCOON (2022)
Ivan Bliznets, Danil Sagunov, Kirill Simonov
Fine-grained Complexity of Partial Minimum Satisfiability. IJCAI (2022)
Tatiana Belova, Ivan Bliznets
Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy. ISAAC (2022)
Vasily Alferov, Ivan Bliznets
New Length Dependent Algorithm for Maximum Satisfiability Problem. AAAI (2021)
Ivan Bliznets, Danil Sagunov
Lower bounds for the happy coloring problems. Theor. Comput. Sci. 838 (2020)
Ivan Bliznets, Danil Sagunov
Maximizing Happiness in Graphs of Bounded Clique-Width. LATIN (2020)
Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk, Lukás Mach
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems. ACM Trans. Algorithms 16 (2) (2020)
Ivan Bliznets, Danil Sagunov
Maximizing Happiness in Graphs of Bounded Clique-Width. CoRR (2020)
Tatiana Belova, Ivan Bliznets
Algorithms for (n, 3)-MAXSAT and parameterization above the all-true assignment. Theor. Comput. Sci. 803 (2020)
Ivan Bliznets, Danil Sagunov
On Happy Colorings, Cuts, and Structural Parameterizations. WG (2019)
Ivan Bliznets, Danil Sagunov
Lower Bounds for the Happy Coloring Problems. COCOON (2019)
Ivan Bliznets, Danil Sagunov
On Happy Colorings, Cuts, and Structural Parameterizations. CoRR (2019)
Ivan Bliznets, Danil Sagunov
Lower Bounds for the Happy Coloring Problems. CoRR (2019)
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
Subexponential Parameterized Algorithm for Interval Completion. ACM Trans. Algorithms 14 (3) (2018)
Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk
-free Edge Modification Problems. ACM Trans. Comput. Theory 10 (2) (2018)
Ivan Bliznets, Danil Sagunov
Solving Target Set Selection with Bounded Thresholds Faster than 2^n. IPEC (2018)
Ivan Bliznets, Danil Sagunov
. CoRR (2018)
Tatiana Belova, Ivan Bliznets
Upper and Lower Bounds for Different Parameterizations of (n, 3)-MAXSAT. COCOA (2018)
Ivan Bliznets, Nikolay Karpov
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. CoRR (2017)
Ivan Bliznets, Nikolay Karpov
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters. MFCS (2017)
Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
Parameterized Complexity of Superstring Problems. Algorithmica 79 (3) (2017)
Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk
Hardness of approximation for H-free edge modification problems. CoRR (2016)
Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems. SODA (2016)
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
Subexponential parameterized algorithm for Interval Completion. SODA (2016)
Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Algorithmica 76 (2) (2016)
Virajith Jalaparti, Ivan Bliznets, Srikanth Kandula, Brendan Lucier, Ishai Menache
Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers. SIGCOMM (2016)
Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk
Hardness of Approximation for H-Free Edge Modification Problems. APPROX-RANDOM (2016)
Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk
Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems. CoRR (2015)
Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
Parameterized Complexity of Superstring Problems. CoRR (2015)
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
A Subexponential Parameterized Algorithm for Proper Interval Completion. SIAM J. Discret. Math. 29 (4) (2015)
Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach
Kernelization lower bound for Permutation Pattern Matching. Inf. Process. Lett. 115 (5) (2015)
Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh
Parameterized Complexity of Superstring Problems. CPM (2015)
Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach
Kernelization lower bound for Permutation Pattern Matching. CoRR (2014)
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
A Subexponential Parameterized Algorithm for Proper Interval Completion. ESA (2014)
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
A subexponential parameterized algorithm for Proper Interval Completion. CoRR (2014)
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk
A subexponential parameterized algorithm for Interval Completion. CoRR (2014)
Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Largest chordal and interval subgraphs faster than 2^n. CoRR (2013)
Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger
Largest Chordal and Interval Subgraphs Faster Than 2 n. ESA (2013)
Ivan Bliznets, Alexander Golovnev
A New Algorithm for Parameterized MAX-SAT. IPEC (2012)