default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWillem H. Haemers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j55]Willem H. Haemers
, Hatice Topcu:
The signed graphs with two eigenvalues unequal to ±1. Appl. Math. Comput. 463: 128348 (2024)- 2022
- [j54]Willem H. Haemers, Leila Parsaei Majd:
Spectral symmetry in conference matrices. Des. Codes Cryptogr. 90(9): 1983-1990 (2022) - 2021
- [j53]Sebastian M. Cioaba, Krystal Guo, Willem H. Haemers:
The chromatic index of strongly regular graphs. Ars Math. Contemp. 20(1): 187-194 (2021) - [j52]Saieed Akbari, Willem H. Haemers, Mohammad Ali Hosseinzadeh, Vladislav V. Kabanov, Elena V. Konstantinova, Leonid Shalaginov:
Spectra of strongly Deza graphs. Discret. Math. 344(12): 112622 (2021) - 2020
- [j51]Ebrahim Ghorbani, Willem H. Haemers, Hamid Reza Maimani, Leila Parsaei Majd:
On sign-symmetric signed graphs. Ars Math. Contemp. 19(1): 83-93 (2020) - [j50]Omid Etesami, Willem H. Haemers:
On NP-hard graph properties characterized by the spectrum. Discret. Appl. Math. 285: 526-529 (2020) - [j49]Willem H. Haemers:
Cospectral pairs of regular graphs with different connectivity. Discuss. Math. Graph Theory 40(2): 577-584 (2020)
2010 – 2019
- 2019
- [j48]Willem H. Haemers, Sezer Sorgun, Hatice Topcu:
On the Spectral Characterization of Mixed Extensions of P3. Electron. J. Comb. 26(3): 3 (2019) - [j47]Hatice Topcu, Sezer Sorgun, Willem H. Haemers:
The graphs cospectral with the pineapple graph. Discret. Appl. Math. 269: 52-59 (2019) - [j46]Willem H. Haemers:
Spectral characterization of mixed extensions of small graphs. Discret. Math. 342(10): 2760-2764 (2019) - [j45]Aida Abiad, Steve Butler, Willem H. Haemers:
Graph switching, 2-ranks, and graphical Hadamard matrices. Discret. Math. 342(10): 2850-2855 (2019) - 2017
- [j44]Aart Blokhuis, Edwin R. van Dam, Willem H. Haemers, Jack H. Koolen:
Preface to the special issue dedicated to Andries E. Brouwer. Des. Codes Cryptogr. 84(1-2): 1-2 (2017) - [j43]Sebastian M. Cioaba, Willem H. Haemers, Jason R. Vermette:
The graphs with all but two eigenvalues equal to -2 or 0. Des. Codes Cryptogr. 84(1-2): 153-163 (2017) - 2016
- [j42]Aida Abiad, Willem H. Haemers:
Switched symplectic graphs and their 2-ranks. Des. Codes Cryptogr. 81(1): 35-41 (2016) - 2015
- [j41]Zoltán Blázsik, Jay Cummings, Willem H. Haemers:
Cospectral regular graphs with and without a perfect matching. Discret. Math. 338(3): 199-201 (2015) - 2014
- [j40]Marc Cámara, Willem H. Haemers:
Spectral characterizations of almost complete graphs. Discret. Appl. Math. 176: 19-23 (2014) - [j39]Dean Crnkovic, Willem H. Haemers:
Walk-regular divisible design graphs. Des. Codes Cryptogr. 72(1): 165-175 (2014) - [j38]Edwin R. van Dam, Willem H. Haemers, Jack H. Koolen:
Regular graphs with maximal energy per vertex. J. Comb. Theory B 107: 123-131 (2014) - 2012
- [j37]Aida Abiad, Willem H. Haemers:
Cospectral Graphs and Regular Orthogonal Matrices of Level 2. Electron. J. Comb. 19(3): 13 (2012) - [j36]Edwin R. van Dam, Willem H. Haemers:
Preface: Geometric and algebraic combinatorics. Des. Codes Cryptogr. 65(1-2): 1-3 (2012) - [j35]Aart Blokhuis, Andries E. Brouwer, Willem H. Haemers:
The graph with spectrum 141 240 (-4)10 (-6)9. Des. Codes Cryptogr. 65(1-2): 71-75 (2012) - [j34]Willem H. Haemers, M. J. P. Peeters:
The maximum order of adjacency matrices of graphs with a given rank. Des. Codes Cryptogr. 65(3): 223-232 (2012) - 2011
- [j33]Edwin R. van Dam, Willem H. Haemers:
An odd characterization of the generalized odd graphs. J. Comb. Theory B 101(6): 486-489 (2011) - [j32]Willem H. Haemers, Hadi Kharaghani, Maaike A. Meulenberg:
Divisible design graphs. J. Comb. Theory A 118(3): 978-992 (2011) - [p1]Willem H. Haemers:
Matrices for graphs, designs and codes. Information Security, Coding Theory and Related Combinatorics 2011: 253-277 - 2010
- [j31]Edwin R. van Dam, Willem H. Haemers:
Preface: Geometric and Algebraic Combinatorics. Eur. J. Comb. 31(6): 1497-1498 (2010) - [j30]Willem H. Haemers, Qing Xiang:
Strongly regular graphs with parameters (4m4, 2m4+m2, m4+m2, m4+m2) exist for all m>1. Eur. J. Comb. 31(6): 1553-1559 (2010)
2000 – 2009
- 2009
- [j29]Edwin R. van Dam, Willem H. Haemers:
Developments on spectral characterizations of graphs. Discret. Math. 309(3): 576-586 (2009) - [j28]Sebastian M. Cioaba, David A. Gregory, Willem H. Haemers:
Matchings in regular graphs from eigenvalues. J. Comb. Theory B 99(2): 287-297 (2009) - 2007
- [j27]Aart Blokhuis, Andries E. Brouwer, Willem H. Haemers:
On 3-chromatic distance-regular graphs. Des. Codes Cryptogr. 44(1-3): 293-305 (2007) - [j26]Edwin R. van Dam, Willem H. Haemers:
Geometric and algebraic combinatorics. Eur. J. Comb. 28(7): 1877 (2007) - 2006
- [j25]Andries E. Brouwer, Peter J. Cameron, Willem H. Haemers, Donald A. Preece:
Self-dual, not self-polar. Discret. Math. 306(23): 3051-3053 (2006) - [j24]Nick C. Fiala, Willem H. Haemers:
5-chromatic strongly regular graphs. Discret. Math. 306(23): 3083-3096 (2006) - [j23]Edwin R. van Dam, Willem H. Haemers, Jacobus H. Koolen, Edward Spence:
Characterizing distance-regularity of graphs by the spectrum. J. Comb. Theory A 113(8): 1805-1820 (2006) - 2005
- [j22]Aart Blokhuis, Willem H. Haemers:
Preface. Des. Codes Cryptogr. 34(2-3): 135-135 (2005) - 2004
- [j21]Eiichi Bannai, Willem H. Haemers, Patrick Solé:
Johan Jacob Seidel 1919-2001. Eur. J. Comb. 25(2): 145-146 (2004) - [j20]Willem H. Haemers, Edward Spence:
Enumeration of cospectral graphs. Eur. J. Comb. 25(2): 199-211 (2004) - 2001
- [j19]Willem H. Haemers, Edward Spence:
The Pseudo-geometric Graphs for Generalized Quadrangles of Order (3, t). Eur. J. Comb. 22(6): 839-845 (2001) - [j18]Willem H. Haemers:
Bicliques and Eigenvalues. J. Comb. Theory B 82(1): 56-66 (2001) - 2000
- [j17]Aart Blokhuis, Willem H. Haemers:
Preface. Des. Codes Cryptogr. 21(1/3): 5 (2000) - [j16]Frans C. Bussemaker, Willem H. Haemers, Edward Spence:
The Search for Pseudo Orthogonal Latin Squares of Order Six. Des. Codes Cryptogr. 21(1/3): 77-82 (2000)
1990 – 1999
- 1999
- [j15]Willem H. Haemers, René Peeters, Jeroen M. van Rijckevorsel:
Binary Codes of Strongly Regular Graphs. Des. Codes Cryptogr. 17(1-3): 187-209 (1999) - [j14]Willem H. Haemers:
Minimum resolvable coverings with small parallel classes. Discret. Math. 197-198: 393-396 (1999) - 1998
- [j13]Edwin R. van Dam, Willem H. Haemers:
Graphs with constant µ and µ_. Discret. Math. 182(1-3): 293-307 (1998) - 1997
- [j12]Willem H. Haemers:
Disconnected Vertex Sets and Equidistant Code Pairs. Electron. J. Comb. 4(1) (1997) - 1996
- [j11]Willem H. Haemers, Vladimir D. Tonchev:
Spreads in Strongly Regular Graphs. Des. Codes Cryptogr. 8(1-2): 145-157 (1996) - 1995
- [j10]Matthijs J. Coster, Willem H. Haemers:
Quasi-Symmetric Designs Related to the Triangular Graph. Des. Codes Cryptogr. 5(1): 27-42 (1995) - 1993
- [j9]Andries E. Brouwer, Willem H. Haemers:
The Gewirtz Graph: An Exercise in the Theory of Graph Spectra. Eur. J. Comb. 14(5): 397-407 (1993) - [j8]Willem H. Haemers, Christopher Parker, Vera Pless, Vladimir D. Tonchev:
A Design and a Code Invariant under the Simple Group Co3. J. Comb. Theory A 62(2): 225-233 (1993) - 1992
- [j7]Andries E. Brouwer, Willem H. Haemers:
Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph. Discret. Math. 106-107: 77-82 (1992) - [j6]Andries E. Brouwer, Henny A. Wilbrink, Willem H. Haemers:
Some 2-ranks. Discret. Math. 106-107: 83-92 (1992) - 1991
- [j5]Willem H. Haemers:
Regular 2-Graphs and Extensions of Partial Geometries. Eur. J. Comb. 12(2): 115-123 (1991) - [j4]Willem H. Haemers:
Divisible designs with r-lambda1 = 1. J. Comb. Theory A 57(2): 316-319 (1991)
1980 – 1989
- 1989
- [j3]Frans C. Bussemaker, Willem H. Haemers, R. Matron, Henny A. Wilbrink:
A (49, 16, 3, 6) Strongly Regular Graph Does Not Exist. Eur. J. Comb. 10(5): 413-418 (1989) - [j2]Frans C. Bussemaker, Willem H. Haemers, J. J. Seidel, Edward Spence:
On (v, k, lambda) graphs and designs with trivial automorphism group. J. Comb. Theory A 50(1): 33-46 (1989) - 1985
- [c2]Willem H. Haemers:
Access Control at the Netherlands Postal and Telecommunications Services. CRYPTO 1985: 543-544 - 1984
- [c1]B. Sanders, Willem H. Haemers, R. Wilcke:
A Contribution to the Techniques of Traffic Engineering in Communications Networks With Waiting Facilities. ICC (1) 1984: 56-60
1970 – 1979
- 1979
- [j1]Willem H. Haemers:
On Some Problems of Lovász Concerning the Shannon Capacity of a Graph. IEEE Trans. Inf. Theory 25(2): 231-232 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
