Follow
Ivan Bliznets
Ivan Bliznets
University of Groningen
Verified email at hse.ru
Title
Cited by
Cited by
Year
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
1342016
Subexponential Parameterized Algorithm for Interval Completion
I Bliznets, FV Fomin, M Pilipczuk, M Pilipczuk
ACM Transactions on Algorithms (TALG) 14 (3), 1-62, 2018
422018
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
272020
A subexponential parameterized algorithm for proper interval completion
I Bliznets, FV Fomin, M Pilipczuk, M Pilipczuk
European Symposium on Algorithms, 173-184, 2014
262014
A new algorithm for parameterized MAX-SAT
I Bliznets, A Golovnev
Parameterized and Exact Computation: 7th International Symposium, IPEC 2012 …, 2012
212012
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
182015
A new upper bound for (n, 3)-MAX-SAT
IA Bliznets
Journal of Mathematical Sciences 188, 1-6, 2013
112013
Largest Chordal and Interval Subgraphs Faster than
I Bliznets, FV Fomin, M Pilipczuk, Y Villanger
Algorithmica 76 (2), 569-594, 2016
102016
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
92018
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
82013
On happy colorings, cuts, and structural parameterizations
I Bliznets, D Sagunov
Graph-Theoretic Concepts in Computer Science: 45th International Workshop …, 2019
72019
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
62021
Solving Target Set Selection with Bounded Thresholds Faster than
I Bliznets, D Sagunov
Algorithmica 85 (2), 384-405, 2023
52023
Algorithms for (n, 3)-MAXSAT and parameterization above the all-true assignment
T Belova, I Bliznets
Theoretical Computer Science 803, 222-233, 2020
52020
Lower bounds for the happy coloring problems
I Bliznets, D Sagunov
International Computing and Combinatorics Conference, 490-502, 2019
52019
Kernelization lower bound for permutation pattern matching
I Bliznets, M Cygan, P Komosa, L Mach
Information Processing Letters 115 (5), 527-531, 2015
42015
Parameterized algorithms for partitioning graphs into highly connected clusters
I Bliznets, N Karpov
arXiv preprint arXiv:1706.09487, 2017
32017
42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
R Impagliazzo, V Kabanets, A Kolokolova, P McKenzie, S Romani, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017
32017
Hardness of approximation for H-free edge modification problems
I Bliznets, M Cygan, P Komosa, M Pilipczuk
arXiv preprint arXiv:1606.02688, 2016
32016
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
22023
The system can't perform the operation now. Try again later.
Articles 1–20