The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Willem H. Haemers: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Willem H. Haemers
    Access Control at the Netherlands Postal and Telecommunications Services. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:543-544 [Conf]
  2. B. Sanders, Willem H. Haemers, R. Wilcke
    A Contribution to the Techniques of Traffic Engineering in Communications Networks With Waiting Facilities. [Citation Graph (0, 0)][DBLP]
    ICC (1), 1984, pp:56-60 [Conf]
  3. Willem H. Haemers
    Disconnected Vertex Sets and Equidistant Code Pairs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:1, pp:- [Journal]
  4. Aart Blokhuis, Willem H. Haemers
    Preface. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2000, v:21, n:1/3, pp:5- [Journal]
  5. Aart Blokhuis, Willem H. Haemers
    Preface. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:34, n:2-3, pp:135-135 [Journal]
  6. Frans C. Bussemaker, Willem H. Haemers, Edward Spence
    The Search for Pseudo Orthogonal Latin Squares of Order Six. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2000, v:21, n:1/3, pp:77-82 [Journal]
  7. Matthijs J. Coster, Willem H. Haemers
    Quasi-Symmetric Designs Related to the Triangular Graph. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1995, v:5, n:1, pp:27-42 [Journal]
  8. 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]
  9. Willem H. Haemers, Vladimir D. Tonchev
    Spreads in Strongly Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1996, v:8, n:1-2, pp:145-157 [Journal]
  10. Nick C. Fiala, Willem H. Haemers
    5-chromatic strongly regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3083-3096 [Journal]
  11. Andries E. Brouwer, Peter J. Cameron, Willem H. Haemers, D. A. Preece
    Self-dual, not self-polar. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:23, pp:3051-3053 [Journal]
  12. Eiichi Bannai, Willem H. Haemers, Patrick Solé
    Johan Jacob Seidel 1919-2001. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:2, pp:145-146 [Journal]
  13. Andries E. Brouwer, Willem H. Haemers
    The Gewirtz Graph: An Exercise in the Theory of Graph Spectra. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:5, pp:397-407 [Journal]
  14. Willem H. Haemers, Edward Spence
    The Pseudo-geometric Graphs for Generalized Quadrangles of Order (3, t). [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:6, pp:839-845 [Journal]
  15. Willem H. Haemers, Edward Spence
    Enumeration of cospectral graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:2, pp:199-211 [Journal]
  16. Frans C. Bussemaker, Willem H. Haemers, J. J. Seidel, Edward Spence
    On (v, k, lambda) graphs and designs with trivial automorphism group. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:50, n:1, pp:33-46 [Journal]
  17. Willem H. Haemers
    Bicliques and Eigenvalues. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:82, n:1, pp:56-66 [Journal]
  18. Willem H. Haemers
    Divisible designs with r-lambda1 = 1. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:57, n:2, pp:316-319 [Journal]
  19. Willem H. Haemers, Christopher Parker, Vera Pless, Vladimir D. Tonchev
    A Design and a Code Invariant under the Simple Group Co3. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:62, n:2, pp:225-233 [Journal]
  20. Edwin R. van Dam, Willem H. Haemers, Jacobus H. Koolen, Edward Spence
    Characterizing distance-regularity of graphs by the spectrum. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:8, pp:1805-1820 [Journal]
  21. Aart Blokhuis, Andries E. Brouwer, Willem H. Haemers
    On 3-chromatic distance-regular graphs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:44, n:1-3, pp:293-305 [Journal]
  22. Willem H. Haemers
    Minimum resolvable coverings with small parallel classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:393-396 [Journal]
  23. Edwin R. van Dam, Willem H. Haemers
    Graphs with constant µ and µ_. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:182, n:1-3, pp:293-307 [Journal]
  24. Andries E. Brouwer, Henny A. Wilbrink, Willem H. Haemers
    Some 2-ranks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:83-92 [Journal]
  25. Andries E. Brouwer, Willem H. Haemers
    Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:77-82 [Journal]

  26. Developments on spectral characterizations of graphs. [Citation Graph (, )][DBLP]


  27. Geometric and algebraic combinatorics. [Citation Graph (, )][DBLP]


  28. Preface: Geometric and Algebraic Combinatorics. [Citation Graph (, )][DBLP]


  29. Strongly regular graphs with parameters (4m4, 2m4+m2, m4+m2, m4+m2) exist for all m>1. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002