The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
René Peeters: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002