Peeters, Marinus Johannes Petrus (1967-)

A lagrangean relaxation based algorithm for solving set partitioning problems / by M.G.C. van Krieken, H.A. Fleuren, M.J.P. Peetersschema:ProductModel Binary codes of strongly regular graphs / W.H. Haemers, R. Peeters, J.M. van Rijckevorselschema:ProductModel

On coloring j-unit sphere graphs / René Peetersschema:ProductModel On the p-ranks of latin square graphs / René Peetersschema:ProductModel On the p-ranks of the adjacency matrices of distance-regular graphs / René Peetersschema:ProductModel On the p-ranks of the adjacency matrices of distance-regular graphs / René Peetersschema:ProductModel Orthogonal representations over finite fields and the chromatic number of graphs / René Peetersschema:ProductModel Ranks and structure of graphs / Marinus Johannes Petrus Peetersschema:ProductModel Strongly regular graphs that are locally a disjoint union of hexagons / René Peetersschema:ProductModel The maximum edge biclique problem is NP-complete / René Peetersschema:ProductModel The maximum edge biclique problem is NP-complete / René Peetersschema:ProductModel Uniqueness of strongly regular graphs having minimal p-rank / René Peetersschema:ProductModel