prof.dr.ir. W.H. (Willem) Haemers

Tilburg School of Economics and Management

Table of contents

• Journal articles
• Books
• Book chapters
• Working and/or discussion papers
• Conference papers
• Other publications

Journal articles

• 2011
  • Dam, E.R. van, & Haemers, W.H. (2011). An odd characterization of the generalized odd graphs. Journal of Combinatorial Theory, B, 101(6), 486-489.
    (Free access)
    (More)
  • Haemers, W.H. (2011). The beauty of discrete mathematics. Asset Magazine, 26, 16-19.
    (Free access)
    (More)
  • Haemers, W.H., Kharaghani, H., & Meulenberg, M.A. (2011). Divisible design graphs. Journal of Combinatorial Theory, A, 118(3), 978-992.
    (Free access)
    (More)
  • Haemers, W.H., & Omidi, G.R. (2011). Universal adjacency matrices with two eigenvalues. Linear Algebra and its Applications, 435(10), 2520-2529.
    (Free access)
    (More)
• 2010
  • Haemers, W.H., & Xiang, Q. (2010). Strongly regular graphs with parameters (4m. 4, 2m. 4 + m. 2, m. 4 + m. 2, m. 4 + m. 2) exist for all m>1. European Journal of Combinatorics, 31(6), 1553-1559.
    (More)
  • Haemers, W.H., Mohammadian, A., & Tayfeh-Rezaie, B. (2010). On the sum of Laplacian eigenvalues of graphs. Linear Algebra and its Applications, 432(9), 2214-2221.
    (More)
• 2009
  • Cioaba, S.M., Gregory, D.A., & Haemers, W.H. (2009). Matchings in regular graphs from eigenvalues. Journal of Combinatorial Theory, B, 99(2), 287-298.
    (More)
  • Dam, E.R. van, & Haemers, W.H. (2009). Developments on spectral characterizations of graphs. Discrete Mathematics, 309(3), 576-586.
    (Free access)
    (More)
• 2008
  • Brouwer, A.E., & Haemers, W.H. (2008). The integral trees with spectral radius 3. Linear Algebra and its Applications, 429(11-12), 2710-2718.
    (More)
  • Brouwer, A.E., & Haemers, W.H. (2008). A lower bound for the Laplacian eigenvalues of a graph - Proof of a conjecture by Guo. Linear Algebra and its Applications, 429(8-9), 2131-2135.
    (More)
  • Haemers, W.H. (2008). Zero forcing sets and minimum rank of graphs. Linear Algebra and its Applications, 428(7), 1628-1648.
    (More)
  • Haemers, W.H., Liu, X., & Zhang, Y. (2008). Spectral characterizations of lollipop graphs. Linear Algebra and its Applications, 428(11-12), 2415-2423.
    (More)
  • Haemers, W.H. (2008). Strongly regular graphs with maximal energy. Linear Algebra and its Applications, 429(11-12), 2719-2723.
    (More)
• 2007
  • Blokhuis, A., Brouwer, A.E., & Haemers, W.H. (2007). On 3-chromatic distance-regular graphs. Designs Codes and Cryptography, 44(1-3), 293-305.
    (Free access)
    (More)
  • Dam, E.R. van, Haemers, W.H., & Koolen, J.H. (2007). Cospectral graphs and the generalized adjacency matrix. Linear Algebra and its Applications, 423(1), 33-41.
    (Free access)
    (More)
• 2006
  • Brouwer, A.E., Cameron, P.J., Haemers, W.H., & Preece, D.A. (2006). Self-dual not self-polar. Discrete Mathematics, 306(23), 3051-3053.
    (More)
  • Chesnokov, A.A., & Haemers, W.H. (2006). Regularity and the generalized adjacency spectra of graphs. Linear Algebra and its Applications, 416(2/3), 1033-1037.
    (More)
  • Dam, E.R. van, Haemers, W.H., Koolen, J.H., & Spence, E. (2006). Characterizing distance regularity of graphs by the spectrum. Journal of Combinatorial Theory, A, 113(8), 1805-1820.
    (Free access)
    (More)
  • Fiala, N.C., & Haemers, W.H. (2006). 5-chromatic strongly regular graphs. Discrete Mathematics, 306(23), 3083-3096.
    (More)
• 2005
  • Brouwer, A.E., & Haemers, W.H. (2005). Eigenvalues and perfect matchings. Linear Algebra and its Applications, 395, 155-162.
    (More)
  • Haemers, W.H. (2005). Conditions for singular incidence matrices. Journal of Algebraic Combinatorics, 21(2), 179-183.
    (More)
• 2004
  • Bannai, E., Haemers, W.H., & Solé, P. (2004). Joahn Jacob Seidel 1919-2001 (Preface). European Journal of Combinatorics, 25, 145-146.
    (More)
  • Haemers, W.H., & Spence, E. (2004). Enumeration of cospectral graphs. European Journal of Combinatorics, 25, 199-211.
    (More)
• 2003
  • Dam, E.R. van, Haemers, W.H., & Peek, M.B.M. (2003). Equitable resolvable coverings. Journal of Combinatorial Designs, 11(2), 113-123.
    (Free access)
    (More)
  • Dam, E.R. van, & Haemers, W.H. (2003). Which graphs are determined by their spectrum? Linear Algebra and its Applications, 373, 241-272.
    (Free access)
    (More)
• 2002
  • Dam, E.R. van, & Haemers, W.H. (2002). Spectral characterizations of some distance-regular graphs. Journal of Algebraic Combinatorics, 15(2), 189-202.
    (Free access)
    (More)
  • Doob, M., & Haemers, W.H. (2002). The complement of the path is determined by its spectrum. Linear Algebra and its Applications, 356(1-3), 57-65.
    (More)
  • Haemers, W.H., & Kuijken, E. (2002). The Hermitian two-graph and its code. Linear Algebra and its Applications, 356(1-3), 79-93.
    (More)
• 2001
  • Haemers, W.H. (2001). Bicliques and eigenvalues. Journal of Combinatorial Theory, B, 82(1), 56-66.
    (More)
  • Haemers, W.H., & Blokhuis, A. (2001). An infinite family of quasi-symmetric designs. Journal of Statistical Planning and Inference, 95, 117-119.
    (Free access)
    (More)
  • Haemers, W.H., & Spence, E. (2001). The pseudo-geometric graphs for generalized quadrangles of order (3,t). European Journal of Combinatorics, 22(6), 839-845.
    (Free access)
    (More)
• 2000
  • Blokhuis, A., & Haemers, W.H. (2000). Preface. Designs Codes and Cryptography, 21, 5.
    (More)
  • Bussemaker, F.C., Haemers, W.H., & Spence, E. (2000). The search for pseudo orthogonal Latin squares of order six. Designs Codes and Cryptography, 21, 77-82.
    (Free access)
    (More)
• 1999
  • Haemers, W.H. (1999). Minimum resolvable coverings with small parallel classes. Discrete Mathematics, 197/198, 393-396.
    (Free access)
    (More)
  • Haemers, W.H., Erickson, M., Fernando, S., Hardy, D., & Hemmeter, J. (1999). Deza graphs: A generalization of strongly regular graphs. Journal of Combinatorial Designs, 7, 395-405.
    (More)
  • Haemers, W.H., Peeters, M.J.P., & Rijckevorsel, J.M. van (1999). Binary codes of strongly regular graphs. Designs Codes and Cryptography, 17, 187-209.
    (Free access)
    (More)
• 1998
  • Dam, E.R. van, & Haemers, W.H. (1998). Graphs with constant mu and mu-bar. Discrete Mathematics, 182(1-3), 293-307.
    (Free access)
    (More)
• 1997
  • Haemers, W.H., & Dam, E.R. van (1997). A characterization of distance-regular graphs with diameter three. Journal of Algebraic Combinatorics, 6(3), 299-303.
    (Free access)
    (More)
  • Haemers, W.H. (1997). Disconnected vertex sets and equidistant code pairs. The Electronic Journal of Combinatorics, 4,(R7).
    (Free access)
    (More)
• 1996
  • Haemers, W.H., & Touchev, V.D. (1996). Spreads in strongly regular graphs. Designs Codes and Cryptography, 8, 145-157.
    (Free access)
    (More)
  • Haemers, W.H. (1996). Distance-regularity and the spectrum of graphs. Linear Algebra and its Applications, 236, 265-278.
    (Free access)
    (More)
• 1995
  • Dam, E.R. van, & Haemers, W.H. (1995). Eigenvalues and the diameter of graphs. Linear and Multilinear Algebra, 39(1-2), 33-44.
    (Free access)
    (More)
  • Haemers, W.H., & Spence, E. (1995). Graphs cospectral with distance-regular graphs. Linear and Multilinear Algebra, 39, 91-107.
    (More)
  • Haemers, W.H. (1995). Interlacing eigenvalues and graphs. Linear Algebra and its Applications, 227/228, 593-616.
    (Free access)
    (More)
  • Haemers, W.H., & Coster, M.J. (1995). Quasi-symmetric designs related to the triangular graph. Designs Codes and Cryptography, 5, 27-42.
    (Free access)
    (More)
• 1993
  • Brouwer, A.E., & Haemers, W.H. (1993). The Gewirtz graph: An exercise in the theory of graph spectra. European Journal of Combinatorics, 14(5), 397-407.
    (Free access)
    (More)
  • Haemers, W.H., Parker, C., Pless, V., & Tonchev, V.D. (1993). A design and a code invariant under the simple group Co3. Journal of Combinatorial Theory, Series A, 62(2), 225-233.
    (Free access)
    (More)
• 1992
  • Brouwer, A.E., & Haemers, W.H. (1992). Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph. Discrete Mathematics, 106/107, 77-82.
    (Free access)
    (More)
  • Brouwer, A.E., Wilbrink, H.A., & Haemers, W.H. (1992). Some 2-ranks. Discrete Mathematics, 106/107, 83-92.
    (Free access)
    (More)
  • Haemers, W.H. (1992). A non-existence result for quasi-symmetric designs. Sankhya: The Indian Journal of Statistics, 54, 189-190.
    (Free access)
    (More)
• 1991
  • Arasu, K.T., Haemers, W.H., Jungnickel, D., & Pott, A. (1991). Matrix constructions of divisible designs. Linear Algebra and its Applications, 153, 123-133.
    (Free access)
    (More)
  • Haemers, W.H. (1991). Divisible designs with r − 1 = 1. Journal of Combinatorial Theory, Series A, 57(2), 316-319.
    (Free access)
    (More)
  • Haemers, W.H. (1991). Regular two-graphs and extensions of partial geometries. European Journal of Combinatorics, 12, 115-123.
    (Free access)
    (More)
• 1989
  • Bussemaker, F.C., Haemers, W.H., Mathon, R.A., & Wilbrink, H.A. (1989). A (49, 16, 3, 6) strongly regular graph does not exist. European Journal of Combinatorics, 10, 413-418.
    (Free access)
    (More)
  • Haemers, W.H., & Higman, D.G. (1989). Strongly regular graphs with strongly regular decomposition. Linear Algebra and Applications, 114/115, 379-398.
    (Free access)
    (More)
  • Haemers, W.H., Bussemaker, F.C., Seidel, J.J., & Spence, E. (1989). On (v, k, A) graphs and designs with trivial automorphism group. Journal of Combinatorial Theory, Series A, 50(1), 33-46.
    (Free access)
    (More)
• 1982
  • Haemers, W.H., & Lint, J.H. van (1982). A partial geometry pg(9, 8, 4). Annals of Discrete Mathematics, 15, 205-212.
    (Free access)
    (More)
• 1981
  • Haemers, W.H., & Roos, C. (1981). An inequality for generalized hexagons. Geometriae Dedicata, 10, 219-222.
    (Free access)
    (More)
• 1980
  • Haemers, W.H., & Beker, H. (1980). 2-Designs having an intersection number k − n. Journal of Combinatorial Theory, Series A, 28(1), 64-81.
    (Free access)
    (More)
• 1979
  • Haemers, W.H., & Shrikhande, M. (1979). Some remarks on subdesigns of symmetric designs. Journal of Statistical Planning and Inference, 3(4), 361-366.
    (Free access)
    (More)
  • Haemers, W.H. (1979). On some problems of Lov´asz concerning the Shannon capacity of a graph. IEEE Transactions on Information Theory, 25, 231-232.
    (Free access)
    (More)
• 1978
  • Haemers, W.H. (1978). A generalization of the Higman-Sims technique. Proceedings Koninklijke Nederlandse Academie van Wetenschappen, 81, 445-447.
    (Free access)
    (More)
  • Haemers, W.H (1978). An upper bound for the Shannon capacity of a graph. Colloquia Mathematica Societatis Janos Bolyai, 25, 267-272.
    (Free access)
    (More)

Books

• 1980
  • Haemers, W.H. (1980). Eigenvalue techniques in design and graph theory. Amsterdam: Mathematisch Centrum. (Mathematical Centre tracts, 121).
    (More)
• 1979
  • Haemers, W.H. (1979). Eigenvalue techniques in design and graph theory. [S.l.]: [s.n.].
    (Free access)
    (More)

Book chapters

• 2011
  • Haemers, W.H. (2011). Matrices for graphs designs and codes. In D. Crnkovic & V. Tonchev (Eds.), Information Security, Coding Theory and Related Combinatorics: Information coding and combinatories (pp. 253-277). Amsterdam: IOS Press. (NATO Science for Peace and Security Series - D: Information and Communication Security, 29).
    (More)
• 2010
  • Haemers, W.H., & Ramezani, F. (2010). Graphs cospectral with Kneser graphs. In R.A. Bruladi, S. Hedayat, H. Kharaghani, G.B. Khosrovshahi, & S. Shahriari (Eds.), Combinatorics and Graphs (pp. 159-164). Providence, RI: American Mathematical Society. (Contemporary Mathematics, 531).
    (More)
• 2009
  • Haemers, W.H. (2009). Regularity and the spectra of graphs. In S. Huczynska, J.D. Mitchell, & C.V. Roney-Dougal (Eds.), Surveys in Combinatorics 2009 (pp. 75-90). Cambridge: Cambridge University Press. (London Mathematical Society Lecture Notes, 365).
    (More)
• 2008
  • Brouwer, A.E., & Haemers, W.H. (2008). Topics in algebraic graph theory. In G.B. Khosrovshahi (Ed.), Lectures on Combinatorics Vol. 1 (pp. 1-66). Teheran: ISTPM. (IPM Lecture Note Series, 8).
    (More)
• 2006
  • Haemers, W.H. (2006). Matrices and graphs. In L. Hogben (Ed.), Handbook of Linear Algebra (pp. 28.01-28.13). London: Chapman Hall/CRC Press.
    (More)
• 1997
  • Haemers, W.H., Brouwer, A.E., & Tonchev, V.D. (1997). Embedding partial geometrics in Steiner designs. In J.W.P. Hirschfeld, S.S. Magliveras, & M.J. de Resmini (Eds.), Geometry, Combinatorial Designs and Related Structures (pp. 33-41). Cambridge: Cambridge University Press. (London Mathematical Society Lecture Note Series, 245).
    (Free access)
    (More)
• 1995
  • Haemers, W.H., & Brouwer, A.E. (1995). Association schemes. In R. Graham, M. Groetschel, & L. Lovasz (Eds.), Handbook of Combinatorics (pp. 747-771). Amsterdam: Elsevier Science BV.
    (More)
• 1993
  • Haemers, W.H. (1993). There exists no (76, 21, 2, 7) strongly regular graph. In F. de Clerck & A. Beutelspacher (Eds.), Finite geometry and combinatorics: The second international conference at Deinze (pp. 175-176). Cambridge: Cambridge University Press. (London Mathematical Society Lecture Notes Series).
    (Free access)
    (More)
• 1991
  • Haemers, W.H., Higman, D.G., & Hobart, S.A. (1991). Strongly regular graphs induced by polarities of symmetric designs. In J.W.P. Hirschfeld, D.R. Hughes , & J.A. Thas (Eds.), Advances in Finite Geometries and Designs (pp. 163-168). New York, Cambridge: Oxford University Press.
    (Free access)
    (More)
  • Haemers, W.H., & Spence, E. (1991). On (v, k, ) graphs and designs without involutions. In A. Barlotti (Ed.), Combinatorics '88 (pp. 437-447). Mediterranean Press.
    (Free access)
    (More)
• 1986
  • Haemers, W.H. (1986). Matrices en grafen. Matrices: Vacantiecursus (pp. 47-57). Tilburg: CWI.
    (Free access)
    (More)
• 1984
  • Haemers, W.H. (1984). Dual Seidel switching. In P.J. de Doelder, J. de Graaf, & J.H. van Lint (Eds.), Papers Dedicated to J.J. Seidel (pp. 183-191). Eindhoven: Technical University Eindhoven. (EUT Report 84-WSK-03).
    (Free access)
    (More)
• 1981
  • Haemers, W.H. (1981). A new partial geometry constructed from the Hoffman-Singleton graph. In P.J. Cameron, J.W.P Hirschfeld, & D.R. Hughes (Eds.), Finite geometries and designs (pp. 119-127). Cambridge: Cambridge University Press. (London Mathematical Society lecture note series; 49).
    (Free access)
    (More)
• 1979
  • Haemers, W.H. (1979). Eigenvalue methods. In A. Schrijver (Ed.), Packing and Covering in Combinatorics (pp. 15-38). Amsterdam: Mathematical Centre. (Mathematical Centre Tract 106).
    (Free access)
    (More)

Working and/or discussion papers

• 2012
  • Haemers, W.H. (2012). Seidel Switching and Graph Energy. (CentER Discussion Paper, 2012-023, 2012-023)
    (Free access)
    (More)
• 2011
  • Crnkovic, D., & Haemers, W.H. (2011). More about Divisible Design Graphs. (CentER Discussion Paper, 2011-140, 2011-140)
    (Free access)
    (More)
  • Haemers, W.H., & Peeters, M.J.P. (2011). The Maximum Order of Reduced Square(0, 1)-Matrices with a Given Rank. (CentER Discussion Paper, 2011-113, 2011-113)
    (Free access)
    (More)
• 2010
  • Dam, E.R. van, & Haemers, W.H. (2010). An Odd Characterization of the Generalized Odd Graphs. (CentER Discussion Paper, 2010-47, 2010-047) pp. 1-5.
    (Free access)
    (More)
  • Haemers, W.H., & Omidi, G.R. (2010). Universal Adjacency Matrices with Two Eigenvalues. (CentER Discussion Paper, 2010-119, 2010-119) pp. 1-15.
    (Free access)
    (More)
  • Haemers, W.H., Kharaghani, H., & Meulenberg, M.A. (2010). Divisible Design Graphs. (CentER Discussion Paper, 2010-19, 2010-019) pp. 1-20.
    (Free access)
    (More)
  • Haemers, W.H., & Peeters, M.J.P. (2010). The Maximum Order of Adjacency Matrices With a Given Rank. (CentER Discussion Paper, 2010-116, 2010-116) pp. 1-11.
    (Free access)
    (More)
• 2009
  • Haemers, W.H., & Ramezani, F. (2009). Graphs Cospectral with Kneser Graphs. (CentER Discussion Paper, 2009-76, 2009-076) pp. 1-8.
    (Free access)
    (More)
• 2008
  • Brouwer, A.E., & Haemers, W.H. (2008). Hamiltonian Strongly Regular Graphs. (CentER Discussion Paper, 2008-28, 2008-028) pp. 1-6.
    (Free access)
    (More)
  • Brouwer, A.E., & Haemers, W.H. (2008). A Lower Bound for the Laplacian Eigenvalues of a Graph-Proof of a Conjecture by Guo. (CentER Discussion Paper, 2008-27, 2008-027) pp. 1-6.
    (Free access)
    (More)
  • Haemers, W.H., Mohammadian, A., & Tayfeh-Rezaie, B. (2008). On the Sum of Laplacian Eigenvalues of Graphs. (CentER Discussion Paper, 2008-98, 2008-098) pp. 1-10.
    (Free access)
    (More)
  • Haemers, W.H., & Xiang, Q. (2008). Strongly Regular Graphs with Parameters (4m4, 2m4 + m2, m4 + m2, m4 + m2) Exist for All m>1. (CentER Discussion Paper, 2008-86, 2008-086) pp. 1-9.
    (Free access)
    (More)
• 2007
  • Brouwer, A.E., & Haemers, W.H. (2007). The Integral Trees with Spectral Radius 3. (CentER Discussion Paper, 2007-84, 2007-084) pp. 1-10.
    (Free access)
    (More)
  • Dam, E.R. van, & Haemers, W.H. (2007). Developments on Spectral Characterizations of Graphs. (CentER Discussion Paper, 2007-33, 2007-033) pp. 1-17.
    (Free access)
    (More)
  • Haemers, W.H. (2007). Strongly Regular Graphs with Maximal Energy. (CentER Discussion Paper, 2007-37, 2007-037) pp. 1-7.
    (Free access)
    (More)
• 2006
  • Blokhuis, A., Brouwer, A.E., & Haemers, W.H. (2006). On 3-Chromatic Distance-Regular Graphs. (CentER Discussion Paper, 2006-120, 2006-120) pp. 1-15.
    (Free access)
    (More)
  • Blokhuis, A., Brouwer, A.E., & Haemers, W.H. (2006). On 3-chromatic distance-regular graphs. (CentER Discussion Paper, 2006-120, 2006-120) Tilburg University, Center for Economic Research.
    (Free access)
    (More)
  • Dam, E.R. van, Haemers, W.H., & Koolen, J.H. (2006). Cospectral Graphs and the Generalized Adjacency Matrix. (CentER Discussion Paper, 2006-31, 2006-031) pp. 1-10.
    (Free access)
    (More)
• 2005
  • Chesnokov, A.A., & Haemers, W.H. (2005). Regularity and the Generalized Adjacency Spectra of Graphs. (CentER Discussion Paper, 2005-124, 2005-124) pp. 1.
    (Free access)
    (More)
  • Dam, E.R. van, Haemers, W.H., Koolen, J.H., & Spence, E. (2005). Characterizing Distance-Regularity of Graphs by the Spectrum. (CentER Discussion Paper, 2005-19, 2005-019) pp. 1-14.
    (Free access)
    (More)
  • Haemers, W.H. (2005). Matrices and Graphs. (CentER Discussion Paper, 2005-37, 2005-037) pp. 1-20.
    (Free access)
    (More)
• 2004
  • Brouwer, A.E., & Haemers, W.H. (2004). Eigenvalues and Perfect Matchings. (CentER Discussion Paper, 2004-58, 2004-058) pp. 1-8.
    (Free access)
    (More)
• 2003
  • Fiala, N.C., & Haemers, W.H. (2003). 5-Chromatic Strongly Regular Graphs. (CentER Discussion Paper, 2003-45, 2003-045) pp. 1-17.
    (Free access)
    (More)
  • Haemers, W.H. (2003). Conditions for Singular Incidence Matrices. (CentER Discussion Paper, 2003-66, 2003-066) pp. 1-6.
    (Free access)
    (More)
• 2002
  • Dam, E.R. van, & Haemers, W.H. (2002). Which Graphs are Determined by their Spectrum? (CentER Discussion Paper, 2002-66, 2002-066) pp. 1-31.
    (Free access)
    (More)
  • Haemers, W.H., & Spence, E. (2002). Enumeration of Cospectral Graphs. (CentER Discussion Paper, 2002-90, 2002-090) pp. 1-13.
    (Free access)
    (More)
• 2001
  • Dam, E.R. van, Haemers, W.H., & Peek, M.B.M. (2001). Equitable Resolvable Coverings. (CentER Discussion Paper, 2001-103, 2001-103) pp. 1-10.
    (Free access)
    (More)
  • Haemers, W.H., & Kuijken, E. (2001). The Hermitian Two-Graph and its Code. (CentER Discussion Paper, 2001-83, 2001-083) pp. 1-16.
    (Free access)
    (More)
• 2000
  • Dam, E.R. van, & Haemers, W.H. (2000). Spectral Characterizations of Some Distance-Regular Graphs. (FEW Research Memorandum, 793) pp. 1-12.
    (Free access)
    (More)
  • Haemers, W.H., & Spence, E. (2000). The Pseudo-Geometric Graphs for Generalised Quadrangles of Order (3,t). (FEW Research Memorandum, 794) pp. 1-8.
    (Free access)
    (More)
• 1999
  • Bussemaker, F.C., Haemers, W.H., & Spence, E. (1999). The Search for Pseudo Orthogonal Latin Squares of Order Six. (FEW Research Memorandum, 780) pp. 1-8.
    (Free access)
    (More)
  • Haemers, W.H. (1999). Bicliques and Eigenvalues. (FEW Research Memorandum, 783) pp. 1-11.
    (Free access)
    (More)
• 1998
  • Haemers, W.H., Peeters, M.J.P., & Rijckevorsel, J.M. van (1998). Binary Codes of Strongly Regular Graphs. (FEW Research Memorandum, 762) pp. 1-23.
    (Free access)
    (More)
• 1996
  • Haemers, W.H. (1996). Disconnected Vertex Sets and Equidistant Code Pairs. (FEW Research Memorandum, 728) pp. 1-10.
    (Free access)
    (More)
• 1995
  • Dam, E.R. van, & Haemers, W.H. (1995). Graphs with constant μ and μ. (Research memorandum / Tilburg University, Faculty of Economics and Business Administration, FEW 688)
    (Free access)
    (More)
  • Dam, E.R. van, & Haemers, W.H. (1995). A characterization of distance-regular graphs with diameter three. (Research memorandum / Tilburg University, Faculty of Economics and Business Administration, FEW 695)
    (Free access)
    (More)
• 1994
  • Haemers, W.H. (1994). Interlacing eigenvalues and graphs. (Research memorandum / Tilburg University, Department of Economics, FEW 675)
    (Free access)
    (More)
• 1993
  • Coster, W.J., & Haemers, W.H. (1993). Quasi-symmetric designs related to the triangular graph. (Research memorandum / Tilburg University, Department of Economics, FEW 596)
    (Free access)
    (More)
  • Dam, E.R. van, & Haemers, W.H. (1993). Eigenvalues and the diameter of graphs. (CentER Discussion Paper, 1993-43, 1993-043)
    (Free access)
    (More)
  • Haemers, W.H., & Spence, E. (1993). Graphs cospectral with distance-regular graphs. (Research memorandum / Tilburg University, Department of Economics, FEW 623)
    (Free access)
    (More)
• 1992
  • Haemers, W.H. (1992). Distance regularity and the spectrum of graphs. (Research memorandum / Tilburg University, Department of Economics, FEW 582)
    (Free access)
    (More)
• 1991
  • Brouwer, A.E., & Haemers, W.H. (1991). The Gewirtz graph: An exercise in the theory of graph spectra. (Research memorandum / Tilburg University, Department of Economics, FEW 486)
    (Free access)
    (More)
• 1990
  • Haemers, W.H., Higman, D.G., & Hobart, S.A. (1990). Strongly regular graphs induced by polarities of symmetric designs. (Research memorandum / Tilburg University, Department of Economics, FEW 452)
    (Free access)
    (More)
  • Haemers, W.H., Parker, C., Pless, V., & Tonchev, V.D. (1990). A design and a code invariant under the simple group Co3. (Research memorandum / Tilburg University, Department of Economics, FEW 458)
    (Free access)
    (More)
• 1989
  • Haemers, W.H. (1989). Regular two-graphs and extensions of partial geometries. (Research memorandum / Tilburg University, Department of Economics, FEW 401)
    (Free access)
    (More)
• 1988
  • Bussemaker, F.C., Haemers, W.H., Mathon, R., & Wilbrink, H.A. (1988). A (49,16,3,6) strongly regular graph does not exist. (Research memorandum / Tilburg University, Department of Economics, FEW 355)
    (Free access)
    (More)
• 1987
  • Bussemaker, F.C., Haemers, W.H., Seidel, J.J., & Spence, E. (1987). On (v,k,labda) graphs and designs with trivial automorphism group. (Research memorandum / Tilburg University, Department of Economics, FEW 248)
    (Free access)
    (More)
  • Haemers, W.H., & Brouwer, A.E. (1987). Association schemes. (Research memorandum / Tilburg University, Department of Economics, FEW 258)
    (Free access)
    (More)

Conference papers

• 1986
  • Haemers, W.H. (1986). Access control at the Netherlands Postal and Telecommunication Services. In Williams (Ed.), Advances in cryptology-CRYPTO '85: Proceedings of the 5th conference on the theory and applications of cryptographic techniques, held August 18-22, 1985, at the University of California, Santa Barbara (pp. 543-544). Berlin: Springer-Verlag. (Lecture notes in computer science, 5).(218)
    (Free access)
    (More)
• 1985
  • Haemers, W.H., & Klik, C. (1985). Enige toepassingen van cryptografie bij de PTT. In R. Paans & R.A.C. Thomas (Eds.), Proceedings data: Beheer en controle (pp. 257-261).
    (More)
  • Haemers, W.H., Sanders, B., & Wilcke, R. (1985). Approximation techniques for queueing systems with finite waiting room. proceedings ITC 11, Kyoto.
    (More)
  • Haemers, W.H. (1985). Een Hammingcode voor de postcode. In A.J. Vinck (Ed.), Proceedings sixth symposium on information theory in the Benelux (pp. 67-73).
    (More)
• 1984
  • Haemers, W.H., Sanders, B., & Wilcke, R. (1984). A contribution to the techniques of traffic engineering in communications networks with waiting facilities. proceedings ICC, Amsterdam.
    (More)
• 1983
  • Haemers, W.H., Sanders, B., & Wilcke, R. (1983). Simple approximation techniques for congestion functions for smooth and peaked traffic. proceedings ITC 10,
    (More)

Other publications

• 2009
  • Haemers, W.H. (2009). Book Review. (Review of the book Spectral Generalizations of Line Graphs, D. Cvetkovic & P. Rowlinson, 2004). Nieuw Archief voor Wiskunde, June, 140.
    (More)
• 2000
  • Haemers, W.H. (2000). Review of the book Combinatorial Designs and Tournaments, I. Anderson, 2000. Nieuw Archief voor Wiskunde, 1(1), 84.
    (More)
• 1997
  • Haemers, W.H. (1997). Review of the book Handbook of Incidence Geometry: Buildings and Foundations, F. Beukenhout, 1997, 044488355X. Mededelingen van het Wiskundig Genootschap, November,
    (More)