Dynamic pricing and traffic engineering for timely inter-datacenter transfers V Jalaparti, I Bliznets, S Kandula, B Lucier, I Menache
Proceedings of the 2016 ACM SIGCOMM Conference, 73-86, 2016
153 2016 Subexponential Parameterized Algorithm for Interval Completion I Bliznets, FV Fomin, M Pilipczuk, M Pilipczuk
ACM Transactions on Algorithms (TALG) 14 (3), 1-62, 2018
44 2018 Lower bounds for the parameterized complexity of minimum fill-in and other completion problems I Bliznets, M Cygan, P Komosa, M Pilipczuk, L Mach
ACM Transactions on Algorithms (TALG) 16 (2), 1-31, 2020
29 2020 A subexponential parameterized algorithm for proper interval completion I Bliznets, FV Fomin, M Pilipczuk, M Pilipczuk
European Symposium on Algorithms, 173-184, 2014
26 2014 A new algorithm for parameterized MAX-SAT I Bliznets, A Golovnev
International Symposium on Parameterized and Exact Computation, 37-48, 2012
23 2012 A subexponential parameterized algorithm for proper interval completion I Bliznets, FV Fomin, M Pilipczuk, M Pilipczuk
SIAM Journal on Discrete Mathematics 29 (4), 1961-1987, 2015
20 2015 A new upper bound for (n , 3)-MAX-SAT IA Bliznets
Journal of Mathematical Sciences 188, 1-6, 2013
13 2013 Largest Chordal and Interval Subgraphs Faster than I Bliznets, FV Fomin, M Pilipczuk, Y Villanger
Algorithmica 76 (2), 569-594, 2016
10 2016 Hardness of Approximation for H -free Edge Modification Problems I Bliznets, M Cygan, P Komosa, M Pilipczuk
ACM Transactions on Computation Theory (TOCT) 10 (2), 1-32, 2018
9 2018 Algorithms for (n, 3)-MAXSAT and parameterization above the all-true assignment T Belova, I Bliznets
Theoretical Computer Science 803, 222-233, 2020
8 2020 Largest Chordal and Interval Subgraphs Faster Than 2 n I Bliznets, FV Fomin, M Pilipczuk, Y Villanger
Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013
8 2013 Improved algorithms for maximum satisfiability and its special cases K Brilliantov, V Alferov, I Bliznets
Proceedings of the AAAI Conference on Artificial Intelligence 37 (4), 3898-3905, 2023
7 2023 New length dependent algorithm for maximum satisfiability problem V Alferov, I Bliznets
Proceedings of the AAAI Conference on Artificial Intelligence 35 (5), 3634-3641, 2021
7 2021 On happy colorings, cuts, and structural parameterizations I Bliznets, D Sagunov
Graph-Theoretic Concepts in Computer Science: 45th International Workshop …, 2019
7 2019 Solving Target Set Selection with Bounded Thresholds Faster than I Bliznets, D Sagunov
Algorithmica 85 (2), 384-405, 2023
5 2023 Lower bounds for the happy coloring problems I Bliznets, D Sagunov
International Computing and Combinatorics Conference, 490-502, 2019
5 2019 MaxCut Above Guarantee I Bliznets, V Epifanov
48th International Symposium on Mathematical Foundations of Computer Science …, 2023
4 2023 Parameterized algorithms for partitioning graphs into highly connected clusters I Bliznets, N Karpov
arXiv preprint arXiv:1706.09487, 2017
4 2017 Kernelization lower bound for permutation pattern matching I Bliznets, M Cygan, P Komosa, L Mach
Information Processing Letters 115 (5), 527-531, 2015
4 2015 Tight double exponential lower bounds I Bliznets, M Hecher
Annual Conference on Theory and Applications of Models of Computation, 124-136, 2024
3 2024 
Danil SagunovSteklov Institute of Mathematics at St. PetersburgEmail verificata su pdmi.ras.ru
