General Information:

I am a Ph.D. student at Indiana University, Bloomington. Before I come here, I graduated from St. Petersburg Academic University with an MSc degree under the supervision of Fedor V. Fomin and Alexander S. Kulikov.


NK, M. Pilipczuk, A. Zych-Pawlewicz
An exponential lower bound for cut sparsifiers in planar graphs
IPEC 2017
I. Bliznets, NK
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
MFCS 2017
F. Fomin, P. Golovach, NK, A. Kulikov
Parameterized Complexity of Secluded Connectivity Problems
I. Bliznets, F. Fomin, P. Golovach, NK, A. Kulikov, S. Saurabh
Parameterized Complexity of Superstring Problems
CPM 2015