On the p-Ranks of Net Graphs. - René Peeters (Des. Codes Cryptogr., 1995)

Orthogonal Representations over Finite Fields and the Chromatic Number of Graphs. - René Peeters (Comb., 1996)

Strongly Regular Graphs that are Locally a Disjoint Union of Hexagons. - René Peeters (Eur. J. Comb., 1997)

Binary Codes of Strongly Regular Graphs. - Willem H. Haemers; René Peeters; Jeroen M. van Rijckevorsel (Des. Codes Cryptogr., 1999)

The maximum edge biclique problem is NP-complete. - René Peeters (Discret. Appl. Math., 2003)