Colorings of b-simple hypergraphs. - Margarita Akhmejanova; Dmitry A. Shabanov (Electron. Notes Discret. Math., 2017)

Equitable colorings of hypergraphs with few edges. - Margarita Akhmejanova; Dmitry A. Shabanov (Discret. Appl. Math., 2020)

Coloring hypergraphs with bounded cardinalities of edge intersections. - Margarita Akhmejanova; Dmitry A. Shabanov (Discret. Math., 2020)

Chain method for panchromatic colorings of hypergraphs. - Margarita Akhmejanova; József Balogh; Dmitrii Shabanov (Discret. Appl. Math., 2022)

EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs. - Margarita Akhmejanova; Maksim Zhukovskii (SIAM J. Discret. Math., 2022)

Wiener index and graphs, almost half of whose vertices satisfy Šoltés property. - Margarita Akhmejanova; Konstantin Olmezov; Aleksei Volostnov; Ilya Vorobyev; Konstantin V. Vorob'ev; Yury Yarovikov (Discret. Appl. Math., 2023)

Self-Directed Learning of Convex Labelings on Graphs. - Georgy Sokolov; Maximilian Thiessen; Margarita Akhmejanova; Fabio Vitale; Francesco Orabona (CoRR, 2024)

The maximum size of an induced forest in the binomial random graph. - Margarita Akhmejanova; Vladislav Kozhevnikov (Discret. Math., 2024)

Self-Directed Node Classification on Graphs. - Georgy Sokolov; Maximilian Thiessen; Margarita Akhmejanova; Fabio Vitale; Francesco Orabona (ALT, 2025)