Výsledky vyhledávání - "Nikita A. Kuzmin"

The association of stress level with the central serous chorioretinopathy development

Autor: Gulshat R. Khasanova, Damir R. Agliullin, Elmira A. Abdulaeva, Nikita D. Kuzmin, Arthur U. Karimov, Saida T. Agliullina

Publikováno v: Kazan medical journal. 103:195-201

Background. The impact of stress on the central serous chorioretinopathy development has been studied in a small number of studies, and the results are conflicting. Aim. To assess the association of the level of individual stress with the central ser

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::aefe81839be36a84361d9030976ac24f
https://doi.org/10.17816/kmj2022-195

Zobrazit plný text záznamu

Development of a parallel algorithm based on an implicit scheme for the discontinuous Galerkin method for solving diffusion type equations

Autor: Nikita A. Kuzmin, Ruslan V. Zhalnin, Victor F. Masyagin

Publikováno v: Zhurnal Srednevolzhskogo Matematicheskogo Obshchestva. 22:94-106

The paper presents a numerical parallel algorithm based on an implicit scheme for the Galerkin method with discontinuous basis functions for solving diffusion-type equations on triangular grids. To apply the Galerkin method with discontinuous basis f

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7e1ea85606f65618b60fe919cc2c08db
https://doi.org/10.15507/2079-6900.22.202001.94-106

Zobrazit plný text záznamu

On connected subcubic graphs with n vertices and n+3 edges having maximum number of matchings

Autor: Nikita Alexandrovich Kuzmin, Dmitry Sergeevich Malyshev

Publikováno v: Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications".

The paper completely describes connected (n,n+3)-graphs of maximal degree 3, which have the largest number of matchings.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::30c85a556042195164c7272441e53742
https://doi.org/10.20948/dms-2022-58

Zobrazit plný text záznamu

Trees of diameter 5 having maximum number of matchings

Autor: Nikita Alexandrovich Kuzmin

Publikováno v: Proceedings of Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications".

In this paper, we consider and completely solve the problem maximizing the number of matchings in trees of diameter 5 with a given the number of peaks.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cc4ffa9d0a93916f5b6a3e4044595717
https://doi.org/10.20948/dms-2022-57

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání