The following pages link to Iliya Bluskov (Q184653):
Displaying 27 items.
- Problem dependent optimization (PDO) (Q266075) (← links)
- Pair covering designs with block size 5 (Q879393) (← links)
- General upper bounds on the minimum size of covering designs (Q1291117) (← links)
- Balanced incomplete block designs with block size 9. II. (Q1428513) (← links)
- Some \(t\)-designs are minimal \((t+1)\)-coverings (Q1584345) (← links)
- Balanced incomplete block designs with block size 9 and \(\lambda=2,4,8\) (Q1611353) (← links)
- New constant weight codes and packing numbers (Q1742694) (← links)
- Optimization algorithms and cyclic designs (Q1976886) (← links)
- Balanced incomplete block designs with block size 8 (Q2746216) (← links)
- (Q2761071) (← links)
- (Q2785723) (← links)
- New results on GDDs, covering, packing and directable designs with block size 5 (Q3057080) (← links)
- Upper bounds on the general covering number<i>C</i><sub>λ</sub>(<i>v</i>,<i>k</i>,<i>t</i>,<i>m</i>) (Q3156929) (← links)
- (Q3424012) (← links)
- New upper bounds on the minimum size of covering designs (Q4222173) (← links)
- (Q4337362) (← links)
- Infinite Classes of Covering Numbers (Q4761353) (← links)
- (Q4795846) (← links)
- (Q4820528) (← links)
- (Q4862222) (← links)
- (Q5365419) (← links)
- Pair covering and other designs with block size 6 (Q5434637) (← links)
- (Q5441047) (← links)
- A diophantine equation inspired by Brahmagupta’s identity (Q5863781) (← links)
- Super-simple designs with \(v\leq 32\) (Q5935432) (← links)
- On the number of mutually disjoint cyclic designs and large sets of designs (Q5935433) (← links)
- Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles (Q6081569) (← links)
