| |
| 2003 | ||
|---|---|---|
| 5 | EE | René Peeters: The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics 131(3): 651-654 (2003) |
| 1999 | ||
| 4 | Willem H. Haemers, René Peeters, Jeroen M. van Rijckevorsel: Binary Codes of Strongly Regular Graphs. Des. Codes Cryptography 17(1-3): 187-209 (1999) | |
| 1997 | ||
| 3 | EE | René Peeters: Strongly Regular Graphs that are Locally a Disjoint Union of Hexagons. Eur. J. Comb. 18(5): 579-588 (1997) |
| 1996 | ||
| 2 | René Peeters: Orthogonal Representations over Finite Fields and the Chromatic Number of Graphs. Combinatorica 16(3): 417-431 (1996) | |
| 1995 | ||
| 1 | René Peeters: On the p-Ranks of Net Graphs Des. Codes Cryptography 5(2): 139-153 (1995) | |
| 1 | Willem H. Haemers | [4] |
| 2 | Jeroen M. van Rijckevorsel | [4] |