- A
- A
- A
- ABC
- ABC
- ABC
- А
- А
- А
- А
- А
Pokrovsky boulevard, 11, room S938, Moscow, Russia, 109028
Phone: +7 (495) 772-95-90*27319
The School of Data Analysis and Artificial Intelligence was created in 2014 as part of the Department of Data Analysis and Artificial Intelligence. The school consists of world-renowned researchers who actively participate in international research projects.
Acquaye F. L., Kertesz-Farkas A., Stafford Noble W.
Journal of Proteome Research. 2023. Vol. 22. No. 2. P. 577-584.
Vasilii A. Gromov, Yury N. Beschastnov, Korney K. Tomashchuk.
PeerJ Computer Science. 2023. Vol. 9. No. .
Makhalova T., Kuznetsov S., Napoli A.
Data Mining and Knowledge Discovery. 2022. P. 108-145.
Dudyrev E., Semenkov Ilia, Kuznetsov S. et al.
Plos One. 2022. Vol. 17. No. 10.
Zhirayr Hayrapetyan, Nascimento S., Trevor F. et al.
In bk.: Information Systems and Technologies: WorldCIST 2022, Volume 2. Iss. 469. Springer, 2022. P. 141-147.
Dudyrev F., Neznanov A., Anisimova K.
In bk.: Artificial Intelligence in Education. Posters and Late Breaking Results, Workshops and Tutorials, Industry and Innovation Tracks, Practitioners’ and Doctoral Consortium -23rd International Conference, AIED 2022, Durham, UK, July 27–31, 2022, Proceedings, Part II. Springer, 2022. P. 436-439.
Egurnov D., Точилкин Д. С., Ignatov D. I.
In bk.: Complex Data Analytics with Formal Concept Analysis. Springer, 2022. P. 239-258.
Egurnov D., Ignatov D. I.
Automation and Remote Control. 2022. Vol. 83. No. 6. P. 894-902.
Kudriavtseva P., Kashkinov M., Kertész-Farkas A.
Journal of Proteome Research. 2021. Vol. 20. No. 10. P. 4708-4717.
Kanovich M., Kuznetsov S., Scedrov A.
Information and Computation. 2022. Vol. 287.
Professor S.O. Kuznetsov took part in the international сommittee for the defense of a PhD dissertation at the University of Auvergne in Clermont-Ferrand, France.
On September 2, 2020 at the University of Auvergne, PhD Defense Oscar Defrain presented his dissertation "On problems of dualization in graphs, hypergraphs and lattices".
Abstract:
This thesis deals with enumeration problems and algorithms. We are interested in the complexity of the dualization of monotone Boolean functions through the different shapes it takes in graphs, hypergraphs, and lattices.
In particular in this talk, we will consider the enumeration of minimal dominating sets in graphs, and will present new output-polynomial time algorithms to solve the problem in graphs without large cliques, as well as in some other related graph classes.
In a second part, we will consider a natural generalization of this problem in lattices, and will review the recent progress on the problem.
The presentation will end with different perspectives on the dualization problem in these structures.
Advisor: Lhouari Nourine
Committee: Victor Chepoi, Nadia Creignou, Arnaud Durand, Sergei Kuznetsov, Aurélie Lagoutte, Kazuhisa Makino