Iliya Bluskov, Ph.D.
Affiliation: Department
of
Mathematics, University of
Northern British Columbia, Prince George, Canada
Phone: (250) 960-6626
FAX: (250) 960-5544
Office: 10-2030
Teaching.
Curriculum Vitae.
Research Interests: Discrete mathematics:
Designs, Coverings, Combinatorics, Optimization algorithms (see
some other home
pages
of combinatorial people).
Related sites: The
World Combinatorics Exchange; Journals.
Some Publications:
- New Constant Weight Codes and Packing Numbers, accepted in
Theoritical Computer Science, 2017.
- On a decomposition of a non-simple 5-design into 3-designs,
accepted in the Bulletin of the Institute for Combinatorics and
its Applications, 2017 (joint with A. James).
- Problem Dependent Optimization (PDO),
Journal of Combinatorial Optimization, 2016, 31(3), 1335-1344.
(2015, DOI 10.1007/s10878-014-9826-x.) The final publication is
available at link.springer.com;
more precisely, here.
- Powers Ending in 00...01, Mathematical Gazette, July (2011),
94-98.
- New Results on GDDs, Covering, Packing and Directable Designs
with Block Size 5, Journal of Combinatorial Design, 18(2010),
337-368 (joint with A. Assaf, J. Abel, M. Greig and N. Shalaby).
- Pair Covering and Other Designs with Block Size 6, Journal of
Combinatorial Design, 15(2007), 511-533 (joint with J. Abel, J.
de Heer and M. Greig).
- On the Covering Numbers C_2(v,k,t), Journal of Combinatorial
Mathematics and Combinatorial Computing, 63(2007), 17-32.
- Pair Covering Designs with Block Size 5 with Higher Index -
The Case of v Even, Journal of Combinatorial Mathematics and
Combinatorial Computing, 58(2006), 211-222 (joint with M.
Greig).
- Pair Covering Designs with Block Size 5, Discrete
Mathematics, 307(2006), 1776-1791 (joint with J. Abel, A. Assaf,
F. Bennett and M. Greig).
- Balanced Incomplete Block Designs with Block Size 9: Part
III, Australasian Journal of Combinatorics, 30(2004),
57-73 (joint with J. Abel and M. Greig).
- Upper Bounds on the General Covering Number C(v,k,t,m),
Journal of Combinatorial Designs, vol. 12, 5(2004),
362-380 (joint with R. Bertolo and H. Hamalainen).
- Balanced Incomplete Block Designs with Block Size 9: Part
II, Discrete Mathematics, 279(2004), 5-32 (joint with J.
Abel and M. Greig).
- Level-Dependent Experimental Optimization, Journal of
Combinatorial Mathematics and Combinatorial Computing, 42(2002),
139-145.
- Balanced Incomplete Block Designs with Block Size 9 and
$\lambda$=2,4 and 8, Codes, Designs and Cryptography, 26(2002),
33-59 (joint with J. Abel and M. Greig).
- Balanced Incomplete Block Designs with Block Size 8, Journal
of Combinatorial Designs, 9(2001), 233-268 (joint with J.
Abel and M. Greig).
- Super-simple designs with v<32, Journal of Statistical
Planning and Inference, 95(2001), 121-131 (joint with K.
Heinrich).
- On the Number of Mutually Disjoint Cyclic Designs and Large
Sets of Designs, Journal of Statistical Planning and
Inference, 95(2001), 133-142 (joint with S. Magliveras).
- Infinite Classes of Covering Numbers, Canadian Mathematical
Bulletin, 43(2000), 385-396 (joint with M. Greig and K.
Heinrich).
- Optimization Algorithms and Cyclic Designs, Journal of
Geometry, 67(2000), 42-49.
- General Upper Bounds on The Minimum Size of Covering Designs,
Journal of Combinatorial Theory A, 86(1999), 205-213 (joint with
K. Heinrich).
- New Simple 3-Designs on 26 and 28 Points, Ars Combinatoria,
51(1999), 313-318.
- New Upper Bounds on the Minimum Size of Covering Designs,
Journal of Combinatorial Designs, vol.6, No.1 (1998), 21-41
(joint with H. Hamalainen).
- Some t-Designs are Minimal (t+1)-Coverings, Discrete
Mathematics 188(1998), 245-251.
- New Designs, Journal of Combinatorial Mathematics and
Combinatorial Computing, 23(1997), 212-220.
- Designs with Maximally Different Blocks and v=15,16, Utilitas
Mathematica, 50(1996), 203-213.
- Designs with Maximally Different Blocks, Utilitas
Mathematica, 48(1995), 193-201.
- The Preparata Codes and a Class of 4-Designs, Journal of
Combinatorial Designs, 2(1994), 167-170 (joint with A. Baartmans
and V. Tonchev).
Something wrong? Well, you can always complain
about me...
Last updated: April 2017..