Some t-designs are minimal (t + 1)-coverings. - Iliya Bluskov (Discret. Math., 1998)

New Simple 3-Designs on 26 and 28 Points. - Iliya Bluskov (Ars Comb., 1999)

General Upper Bounds on the Minimum Size of Covering Designs. - Iliya Bluskov; Katherine Heinrich (J. Comb. Theory A, 1999)

A Useful and Surprising Limit: 10695. - Iliya Bluskov; Albert Nijenhuis (Am. Math. Mon., 2000)

Balanced Incomplete Block Designs with Block Size 9 and lambda=2, 4, 8. - R. Julian R. Abel; Iliya Bluskov; Malcolm Greig (Des. Codes Cryptogr., 2002)

Balanced incomplete block designs with block size 9: Part III. - R. Julian R. Abel; Iliya Bluskov; Malcolm Greig (Australas. J Comb., 2004)

Balanced incomplete block designs with block size 9: part II. - R. Julian R. Abel; Iliya Bluskov; Malcolm Greig (Discret. Math., 2004)

Pair covering designs with block size 5. - R. Julian R. Abel; Ahmed M. Assaf; Frank E. Bennett; Iliya Bluskov; Malcolm Greig (Discret. Math., 2007)

Problem 11271. - Iliya Bluskov (Am. Math. Mon., 2007)

Covering the Chessboard with Sets of Non-Attacking Queens: 11271 [2007, 164]. - Iliya Bluskov (Am. Math. Mon., 2009)

Problem dependent optimization (PDO). - Iliya Bluskov (J. Comb. Optim., 2016)

On a Decomposition of a non-simple 5-design into 3-designs. - Iliya Bluskov; Alexander James (Bull. ICA, 2017)

New Constant Weight Codes and Packing Numbers. - Iliya Bluskov (Electron. Notes Discret. Math., 2018)

Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5-cycles. - Iliya Bluskov; Jan de Heer; Alexander F. Sidorenko (J. Graph Theory, 2023)