Краткая биография:

2021 СПбГУ МКН “Современная Математика”

2019 СПбГУ МКН “Математика”

Публикации:

1. T. Belova, A. Golovnev, A. S. Kulikov, I. Mihajlin, and D. Sharipov, “Polynomial formulations as a barrier for reduction-based hardness proofs”, in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, 2023, pp. 3245–3281.

2. T. Belova and I. Bliznets, “Hardness of approximation for h-free edge modification problems: Towards a dichotomy”, in 33rd International Symposium on Algorithms and Computation (ISAAC 2022), Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022.

3. T. Belova and I. Bliznets, “Algorithms for (n, 3)-maxsat and parameterization above the all-true assignment”, Theoretical Computer Science, vol. 803, pp. 222–233, 2020.

4. T. Belova and I. Bliznets, “Upper and lower bounds for different parameterizations of (n, 3)-maxsat”, in International Conference on Combinatorial Optimization and Applications, Springer, 2018, pp. 299–313.