Ivan Bliznets
- Associate Professor:HSE Campus in St. Petersburg / St. Petersburg School of Physics, Mathematics, and Computer Science / Department of Informatics
- Ivan Bliznets has been at HSE University since 2018.
Education and Degrees
- 2016
Candidate of Sciences* (PhD)
Steklov Mathematical Institute of the Russian Academy of Sciences, St. Petersburg Branch - 2012
Master's in Applied Mathematics and Applied Physics
Nanotechnology Centre at RAS Academic University in St. Petersburg
* Candidate of Sciences
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.
Continuing education / Professional retraining / Internships / Study abroad experience
Warsaw Center of Mathematics and Computer Science (mentor Marek Cygan), Spring 2015, Warsaw. Poland
Microsoft Research (mentor Ishai Menache), Summer 2014, Redmond, WA, USA
Warsaw Center of Mathematics and Computer Science (mentor Marek Cygan), Spring 2014, Warsaw. Poland
Student Term / Thesis Papers
- Bachelor
V. Epifanov, Max-Cut Problem Parameterized above Lower Bound on Special Graph Classes. St. Petersburg School of Physics, Mathematics, and Computer Science , 2021
N. Andreev, Computational Complexity of Paired Dominating Set. St. Petersburg School of Physics, Mathematics, and Computer Science , 2021
A. Bukov, Envy-Free Allocations Respecting Social Networks through Information Witholding. St. Petersburg School of Physics, Mathematics, and Computer Science , 2021
A. Kirakosian, Application Model Usage for Context and User Scenario Restoration. St. Petersburg School of Physics, Mathematics, and Computer Science , 2020
V. Kuporosov, Implementation of Arithmetic Bytecodes and Mathematical Functions for OpenJDK Port on RISC-V Instruction Set Architecture. St. Petersburg School of Physics, Mathematics, and Computer Science , 2020
D. Kaznacheev, Coroutine-Based Distributed Data Processing System. St. Petersburg School of Physics, Mathematics, and Computer Science , 2020
V. Alferov, New Length Depended Algorithm for Maximum Satisfiability Problem. St. Petersburg School of Physics, Mathematics, and Computer Science , 2020
K. Nedikov, Development and Implementation of Java Template Interpreter ABI for OpenJDK Port on RISC-V Instruction Set Architecture. St. Petersburg School of Physics, Mathematics, and Computer Science , 2020
- Master
A. Permyakov, Context-Sensitive Paraphrasing with Deep Learning. St. Petersburg School of Physics, Mathematics, and Computer Science , 2021
Courses (2021/2022)
- Discrete Mathematics (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 1 year, 1, 2, 4 module)Rus
- Discrete Mathematics (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 2 year, 1-4 module)Rus
- Research Seminar (Postgraduate course’s programme; 2 year, 1, 2 semester)Rus
- Research Seminar (Postgraduate course’s programme; 1 year, 2 semester)Rus
- Past Courses
Courses (2020/2021)
- Algorithms and Data Structures (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 2 year, 1, 2 module)Rus
- Algorithms and Data Structures (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 1 year, 1-4 module)Rus
- Approximation Algorithms Part II (Optional course (faculty); St. Petersburg School of Physics, Mathematics, and Computer Science ; 3 module)Rus
- Discrete Mathematics (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 2 year, 2, 3 module)Rus
- Discrete Mathematics (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 1 year, 1, 4 module)Rus
- Randomized algorithms (Optional course (faculty); St. Petersburg School of Physics, Mathematics, and Computer Science ; 1, 2 module)Rus
- Research Seminar (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 4 year, 1-3 module)Rus
- Research Seminar (Postgraduate course’s programme; 1 year, 1, 2 semester)Rus
- Technological Workshop (Master’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 2 year, 2, 3 module)Rus
Courses (2019/2020)
- Algebra (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 1 year, 2 module)Rus
- Algorithms and Data Structures (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 1 year, 1-4 module)Rus
- Cryptographic Protocols (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 4 year, 3 module)Rus
- Discrete Mathematics (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 1 year, 1, 4 module)Rus
- Discrete Mathematics for Economists (Bachelor’s programme; St.Petersburg School of Economics and Management; 1 year, 3 module)Rus
- Information Theory (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 3 year, 3 module)Rus
Courses (2018/2019)
- Information Theory (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 3 year, 3 module)Rus
- Theory of Algorithms (Bachelor’s programme; St. Petersburg School of Physics, Mathematics, and Computer Science ; 2 year, 4 module)Eng
Publications19
- Chapter Alferov V., Bliznets I. New Length Dependent Algorithm for Maximum Satisfiability Problem, in: Thirty-Fifth AAAI Conference on Artificial Intelligence. Technical Tracks 5 Vol. 35. Issue 5. AAAI Press, 2021. P. 3634-3641.
- Article Belova T., Bliznets I. Algorithms for (n,3)-MAXSAT and parameterization above the all-true assignment // Theoretical Computer Science. 2020. No. 803. P. 222-233. doi
- Article Bliznets I., Cygan M., Komosa P., Pilipczuk M., Lukas M. Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems // ACM Transactions on Algorithms. 2020. Vol. 16. No. 2. P. 1-31. doi
- Article Bliznets I., Lukas M., Cygan M., Komosa P., Pilipczuk M. Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems // ACM Transactions on Algorithms. 2020. Vol. 16. P. 1-31. doi
- Article Bliznets I., Sagunov D. Lower bounds for the happy coloring problems // Theoretical Computer Science. 2020. Vol. 838. P. 94-110. doi
- Book Bliznets I. Graph-Theoretic Concepts in Computer Science 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers Vol. 11789: Lecture Notes in Computer Science. Springer, 2019. doi
- Chapter Bliznets I., Sagunov D. Lower Bounds for the Happy Coloring Problems, in: Computing and Combinatorics 25th International Conference, COCOON 2019, Xi'an, China, July 29–31, 2019, Proceedings / Ed. by D. Du. Vol. 11653: Lecture Notes in Computer Science. Springer, 2019. doi P. 490-502. doi
- Chapter Bliznets I., Sagunov D. On Happy Colorings, Cuts, and Structural Parameterizations, in: Graph-Theoretic Concepts in Computer Science 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers Vol. 11789: Lecture Notes in Computer Science. Springer, 2019. doi P. 148-161. doi
- Chapter Bliznets I., Sagunov D. Solving Target Set Selection with Bounded Thresholds Faster than 2^n, in: 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2019. Ch. 22. P. 1-14. doi
- Article Bliznets Ivan, Cygan M., Komosa P., Pilipczuk M. Hardness of Approximation for H-free Edge Modification Problems // ACM Transactions on Computation Theory. 2018. Vol. 10. No. 2. P. 1-32. doi
- Article Bliznets Ivan, Fomin F., Pilipczuk M., Pilipczuk M. Subexponential Parameterized Algorithm for Interval Completion // ACM Transactions on Algorithms. 2018. Vol. 14. No. 3. P. 1-62. doi
- Chapter Belova T., Bliznets I. Upper and Lower Bounds for Different Parameterizations of (n,3)-MAXSAT, in: Combinatorial Optimization and Applications 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings. Springer, 2018. doi P. 299-313. doi
- Chapter Bliznets Ivan, Karpov N. Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters, in: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). , 2017. P. 6:1-6:14. doi
- Article Bliznets Ivan, Fomin F., Golovach P., Karpov N., Kulikov A. S., Saurabh S. Parameterized Complexity of Superstring Problems // Algorithmica. 2017. Vol. 79. No. 3. P. 798-813. doi
- Chapter Bliznets Ivan, Jalaparti V., Kandula S., Lucier B., Menache I. Dynamic Pricing and Traffic Engineering for Timely Inter-Datacenter Transfers, in: Proceedings of the 2016 ACM SIGCOMM Conference. ACM, 2016. P. 73-86. doi
- Chapter Bliznets Ivan, Cygan M., Komosa P., Pilipczuk M. Hardness of Approximation for H-Free Edge Modification Problems, in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016) Vol. 60. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016. Ch. 3. P. 1-17. doi
- Article Bliznets Ivan, Fomin F., Pilipczuk M., Villanger Y. Largest Chordal and Interval Subgraphs Faster than 2^n // Algorithmica. 2016. Vol. 76. No. 2. P. 569-594. doi
- Chapter Bliznets Ivan, Cygan M., Komosa P., Lukas M., Pilipczuk M. Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2016. P. 1132-1151. doi
- Chapter Bliznets Ivan, Fomin F., Pilipczuk M., Pilipczuk M. Subexponential parameterized algorithm for Interval Completion, in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 2016. Ch. 78. P. 1116-1131. doi
Conferences
2017
International Symposium on Mathematical Foundations of Computer Science (Ольборг). Presentation: Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters.