On Some Extremal Properties of Hypergraph Colorings. - Dmitry A. Shabanov (Electron. Notes Discret. Math., 2007)

On the Problem of Erdos and Hajnal in the Case of List Colorings. - Anastasia P. Rozovskaya; Dmitry A. Shabanov (Electron. Notes Discret. Math., 2009)

On r-colorability of random hypergraphs. - Andrei Kupavskii; Dmitry A. Shabanov (CoRR, 2011)

On colorings of non-uniform hypergraphs without short cycles. - Anastasia P. Rozovskaya; Dmitry A. Shabanov (Electron. Notes Discret. Math., 2011)

On a generalization of Rubin's theorem. - Dmitry A. Shabanov (J. Graph Theory, 2011)

On r-chromatic hypergraphs. - Dmitry A. Shabanov (Discret. Math., 2012)

Random coloring method in the combinatorial problem of Erdős and Lovász. - Dmitry A. Shabanov (Random Struct. Algorithms, 2012)

The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model. - Andrey Kupavskii; Liudmila Ostroumova; Dmitry A. Shabanov; Prasad Tetali (Internet Math., 2013)

Coloring Non-uniform Hypergraphs Without Short Cycles. - Dmitry A. Shabanov (Graphs Comb., 2014)

A special issue on the Boris V. Gnedenko Centennial. - Larisa Afanasyeva; Dmitry Korshunov; Dmitry A. Shabanov (Queueing Syst. Theory Appl., 2014)

Around Erdős-Lovász problem on colorings of non-uniform hypergraphs. - Dmitry A. Shabanov (Discret. Math., 2015)

Equitable two-colorings of uniform hypergraphs. - Dmitry A. Shabanov (Eur. J. Comb., 2015)

Colorings of hypergraphs with large number of colors. - Ilia Akolzin; Dmitry A. Shabanov (Electron. Notes Discret. Math., 2015)

Extremal problems for colorings of simple hypergraphs and applications. - Jakub Kozik; Dmitry A. Shabanov (Electron. Notes Discret. Math., 2015)

Improved algorithms for colorings of simple hypergraphs and applications. - Jakub Kozik; Dmitry A. Shabanov (J. Comb. Theory B, 2016)

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

Panchromatic 3-coloring of a random hypergraph. - Dmitry Kravtsov; Nikolay Krokhmal; Dmitry A. Shabanov (Electron. Notes Discret. Math., 2017)

Colourings of Uniform Hypergraphs with Large Girth and Applications. - Andrey Kupavskii; Dmitry A. Shabanov (Comb. Probab. Comput., 2018)

General Independence Sets in Random Strongly Sparse Hypergraphs. - A. S. Semenov; Dmitry A. Shabanov (Probl. Inf. Transm., 2018)

Panchromatic 3-colorings of random hypergraphs. - Dmitry Kravstov; Nikolay Krokhmal; Dmitry A. Shabanov (Eur. J. Comb., 2019)

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

On the weak chromatic number of random hypergraphs. - Alexander Semenov; Dmitry A. Shabanov (Discret. Appl. Math., 2020)

Estimating the r-colorability threshold for a random hypergraph. - Dmitry A. Shabanov (Discret. Appl. Math., 2020)

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

On the strong chromatic number of a random 3-uniform hypergraph. - Arseniy E. Balobanov; Dmitry A. Shabanov (Discret. Math., 2021)

Random hypergraphs and property B. - Lech Duraj; Jakub Kozik; Dmitry A. Shabanov (Eur. J. Comb., 2021)

Number of A+B≠C solutions in abelian groups and application to counting independent sets in hypergraphs. - Aliaksei Semchankau; Dmitry A. Shabanov; Ilya D. Shkredov (Eur. J. Comb., 2022)

Bounds on Threshold Probabilities for Coloring Properties of Random Hypergraphs. - A. S. Semenov; Dmitry A. Shabanov (Probl. Inf. Transm., 2022)