René Peeters

According to our database, René Peeters authored at least 5 papers between 1995 and 2003.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2003

The maximum edge biclique problem is NP-complete.

René Peeters

Discret. Appl. Math., 2003

1999

Binary Codes of Strongly Regular Graphs.

Willem H. Haemers, René Peeters, Jeroen M. van Rijckevorsel

Des. Codes Cryptogr., 1999

1997

Strongly Regular Graphs that are Locally a Disjoint Union of Hexagons.

René Peeters

Eur. J. Comb., 1997

1996

Orthogonal Representations over Finite Fields and the Chromatic Number of Graphs.

René Peeters

Comb., 1996

1995

On the p-Ranks of Net Graphs.

René Peeters

Des. Codes Cryptogr., 1995