• Warandelaan 2, Prisma Building, room P 2.221

    5037 AB Tilburg

    Netherlands

1978 …2020
If you made any changes in Pure these will be visible here soon.

Personal profile

Research interests

Willem Haemers is a mathematician, specialised in discrete mathematics, in particular in algebraic graph theory and combinatorial designs.

 

He is full professor in mathematics (emeritus since December 2013).

Career

2014 - today: Emeritus

2009 - 2013:  Full professor in discrete Mathematics, Tilburg University 

1990 - 2009: Associate professor in mathematics, Tilburg University

1986 - 1989: Assistent professor in mathematics, Tilburg University

1981-1986: Researcher, Department of Applied Mathematics, Dr. Neher Laboratories (PTT Research), Leidschendam

1975-1980: Research assistent, Department of Mathematics, Technical University Eindhoven

PhD supervision

M.J.P. Peeters, 1991-1995.

E.R. van Dam, 1992-1996.

A. Abiad, 2011-2015.

Fingerprint Dive into the research topics where Willem H Haemers is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 2 Similar Profiles
Graph in graph theory Mathematics
Adjacency Matrix Mathematics
Strongly Regular Graph Mathematics
Graph Design Mathematics
Cospectral Graphs Mathematics
Eigenvalue Mathematics
Distance-regular Graph Mathematics
Regular Graph Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1978 2020

Cospectral pairs of regular graphs with different connectivity

Haemers, W. H., Feb 2020, In : Discussiones Mathematicae Graph Theory. 40, 2, p. 577-584

Research output: Contribution to journalArticleScientificpeer-review

Open Access

Cospectral pairs of regular graphs with different connectivity

Haemers, W. H., 11 Apr 2019, Ithaca: Cornell University Library, (arXiv; vol. 1904.05936).

Research output: Working paperOther research output

Open Access
Vertex Connectivity
Edge-connectivity
Regular Graph
Connectivity

Deza graphs with parameters $(n,k,k-1,a)$ and $β=1$

Goryainov, S., Haemers, W. H., Kabanov, V. V. & Shalaginov, L., Mar 2019, In : Journal of Combinatorial Designs. 27, 3, p. 188-202

Research output: Contribution to journalArticleScientificpeer-review

Open Access
Graph Design
Graph in graph theory
Divisible
Strongly Regular Graph
Strictly

Graph switching, 2-ranks, and graphical Hadamard matrices

Abiad, A., Butler, S. & Haemers, W. H., Oct 2019, In : Discrete Mathematics. 342, 10, p. 2850-2855

Research output: Contribution to journalArticleScientificpeer-review

Hadamard matrices
Hadamard Matrix
Graph in graph theory
Strongly Regular Graph
Graph Products

On NP-Hard Graph Properties Characterized by the Spectrum

Etesami, O. & Haemers, W. H., 15 Dec 2019, Ithaca: Cornell University Library, 6 p. (arXiv; vol. 1912.07061).

Research output: Working paperOther research output

Open Access
NP-complete problem
Graph in graph theory
Cospectral Graphs
Complexity Classes
Adjacency Matrix

Projects 2011 2014

Spectral characterizations of graphs

Abiad Monge, A. & Haemers, W. H.

1/12/111/12/14

Project: Research project

Spectral characterizations of graphs

Haemers, W. H. & Camara Vallejo, M.

1/12/111/12/14

Project: Research project