Ivan Bliznets

According to our database, Ivan Bliznets authored at least 30 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Parameterized Algorithms for Covering by Arithmetic Progressions.

Ivan Bliznets, Jesper Nederlof, Krisztina Szilágyi

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Exact and Parameterized Algorithms for Choosability.

Ivan Bliznets, Jesper Nederlof

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph.

Vasily Alferov, Ivan Bliznets, Kirill Brilliantov

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Solving Target Set Selection with Bounded Thresholds Faster than 2ⁿ.

Ivan Bliznets, Danil Sagunov

Algorithmica, February, 2023

MaxCut Above Guarantee.

Ivan Bliznets, Vladislav Epifanov

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Enumeration of Minimal Tropical Connected Sets.

Ivan Bliznets, Danil Sagunov, Eugene Tagin

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

Improved Algorithms for Maximum Satisfiability and Its Special Cases.

Kirill Brilliantov, Vasily Alferov, Ivan Bliznets

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Hardness of Approximation for H-Free Edge Modification Problems: Towards a Dichotomy.

Tatiana Belova, Ivan Bliznets

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

Fine-grained Complexity of Partial Minimum Satisfiability.

Ivan Bliznets, Danil Sagunov, Kirill Simonov

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Two Generalizations of Proper Coloring: Hardness and Approximability.

Ivan Bliznets, Danil Sagunov

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Fair Division with Minimal Withheld Information in Social Networks.

Ivan Bliznets, Anton Bukov, Danil Sagunov

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

New Length Dependent Algorithm for Maximum Satisfiability Problem.

Vasily Alferov, Ivan Bliznets

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Lower bounds for the happy coloring problems.

Ivan Bliznets, Danil Sagunov

Theor. Comput. Sci., 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 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

Maximizing Happiness in Graphs of Bounded Clique-Width.

Ivan Bliznets, Danil Sagunov

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019

On Happy Colorings, Cuts, and Structural Parameterizations.

Ivan Bliznets, Danil Sagunov

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

2018

Hardness of Approximation for <i>H</i>-free Edge Modification Problems.

Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk

ACM Trans. Comput. Theory, 2018

Subexponential Parameterized Algorithm for Interval Completion.

Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk

ACM Trans. Algorithms, 2018

Solving Target Set Selection with Bounded Thresholds Faster than 2^n.

Ivan Bliznets, Danil Sagunov

Proceedings of the 13th International Symposium on Parameterized and Exact Computation, 2018

Upper and Lower Bounds for Different Parameterizations of (n, 3)-MAXSAT.

Tatiana Belova, Ivan Bliznets

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Parameterized Complexity of Superstring Problems.

Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh

Algorithmica, 2017

Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters.

Ivan Bliznets, Nikolay Karpov

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n.

Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger

Algorithmica, 2016

Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers.

Virajith Jalaparti, Ivan Bliznets, Srikanth Kandula, Brendan Lucier, Ishai Menache

Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

Hardness of Approximation for H-Free Edge Modification Problems.

Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk

Proceedings of the Approximation, 2016

2015

A Subexponential Parameterized Algorithm for Proper Interval Completion.

Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk

SIAM J. Discret. Math., 2015

Kernelization lower bound for Permutation Pattern Matching.

Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach

Inf. Process. Lett., 2015

2013

Largest Chordal and Interval Subgraphs Faster Than 2 n.

Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger

Proceedings of the Algorithms - ESA 2013, 2013

2012

A New Algorithm for Parameterized MAX-SAT.

Ivan Bliznets, Alexander Golovnev

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012