Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 1.06.1985
E-mail: ,
Website: https://www.dainiak.com
Keywords: graph algorithms, independent sets, inverse enumeration problems, circuit complexity.
UDC: 519.15, 519.172, 519.176, 519.172.1

Subject:

Combinatorics, graph theory, algorithms, computational complexity.

Main publications:

1. Dainyak A.B., “O chisle nezavisimykh mnozhestv v grafakh s fiksirovannym chislom nezavisimosti”, Diskretnaya matematika, 19:2 (2007), 63–66
2. Selezneva S.N., Dainyak A.B., “O slozhnosti obobschennykh polinomov $k$-znachnykh funktsii”, Vestnik Moskovskogo universiteta. Ser. 15. Vychislitelnaya matematika i kibernetika., 2008, № 4, 34-39
3. Dainyak A.B., “Otsenki chisla nezavisimykh mnozhestv v grafakh s fiksirovannym chislom nezavisimosti”, Vestnik Moskovskogo universiteta. Ser. 15. Vychislitelnaya matematika i kibernetika, 2009, № 2, 45–48
4. Dainyak A.B., “O chisle nezavisimykh mnozhestv v derevyakh fiksirovannogo diametra”, Diskretnyi analiz i issledovanie operatsii, 16:2 (2009), 61–73
5. Dainyak A.B., “O chisle nezavisimykh mnozhestv v polnykh $q$-arnykh derevyakh”, Uchenye zapiski Kazanskogo gosudarstvennogo universiteta, 151:2 (2009), 59–64

Publications in Math-Net.Ru

Personal pages:

• 
• 
• 

Organisations:

• Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
• Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics