papers
Publications (11)
cs.DS2019
Lower Bounds for the Happy Coloring Problems
Ivan Bliznets, Danil Sagunov
cs.DS2018
Solving Target Set Selection with Bounded Thresholds Faster than $2^n$
Ivan Bliznets, Danil Sagunov
cs.DS2017
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
Ivan Bliznets, Nikolai Karpov
cs.DS2015
Parameterized Complexity of Superstring Problems
Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach +3
cs.DS2014
A subexponential parameterized algorithm for Proper Interval Completion
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk +1
cs.DS2018
Hardness of approximation for H-free edge modification problems
Ivan Bliznets, Marek Cygan, Pawel Komosa +1
cs.DS2019
On Happy Colorings, Cuts, and Structural Parameterizations
Ivan Bliznets, Danil Sagunov
cs.DS2015
Kernelization lower bound for Permutation Pattern Matching
Ivan Bliznets, Marek Cygan, Pawel Komosa +1
cs.DS2014
A subexponential parameterized algorithm for Interval Completion
Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk +1
cs.DS2013
Largest chordal and interval subgraphs faster than 2^n
Ivan Bliznets, Fedor V. Fomin, MichaÅ Pilipczuk +1
cs.CC2015
Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems
Ivan Bliznets, Marek Cygan, Pawel Komosa +2