On the maximum number of disjoint Steiner triple systems. - Luc Teirlinck (Discret. Math., 1973)

The existence of reverse Steiner triple systems. - Luc Teirlinck (Discret. Math., 1973)

A simplification of the proof of the existence of reverse steiner triple systems of order congruent to 1 modulo 24. - Luc Teirlinck (Discret. Math., 1975)

On Making Two Steiner Triple Systems Disjoint. - Luc Teirlinck (J. Comb. Theory A, 1977)

On Steiner Spaces. - Luc Teirlinck (J. Comb. Theory A, 1979)

On Projective and Affine Hyperplanes. - Luc Teirlinck (J. Comb. Theory A, 1980)

Factorization Properties for Isometries of Matroids into Projective Spaces. - Luc Teirlinck (Eur. J. Comb., 1982)

Combinatorial properties of planar spaces and embeddability. - Luc Teirlinck (J. Comb. Theory A, 1986)

Non-trivial t-designs without repeated blocks exist for all t. - Luc Teirlinck (Discret. Math., 1987)

The Construction of Large Sets of Idempotent Quasigroups. - Luc Teirlinck; Charles C. Lindner (Eur. J. Comb., 1988)

Locally trivial t-designs and t-designs without repeated blocks. - Luc Teirlinck (Discret. Math., 1989)

A Construction for Authentication/secrecy Codes from 3-homogeneous Permutation Groups. - Douglas R. Stinson; Luc Teirlinck (Eur. J. Comb., 1990)

A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems. - Luc Teirlinck (J. Comb. Theory A, 1991)

A Parallelization of Miller's n^log n Isomorphism Technique. - Charles J. Colbourn; Douglas R. Stinson; Luc Teirlinck (Inf. Process. Lett., 1992)

Some New 2-Resolvable Steiner Quadruple Systems. - Luc Teirlinck (Des. Codes Cryptogr., 1994)

Non-trivial t-designs without repeated blocks exist for all t. - Luc Teirlinck (Discret. Math., 2006)