Preprints
Turán number of books in non-bipartite graphs (with L. Miao and R. Liu),
Spectral conditions for k-factor-criticality in t-connected graphs (with T. Ma and L. Wang),
A bound on the girth of quaternion unit gain graphs in terms of the rank (with S. Khan),
Signless Laplacian Estrada index and Laplacian Estrada index of uniform hypergraphs (with C. Duan and L. Wang),
Pseudo-geometric strongly regular graphs with a regular point (with K. Guo),
Papers in refereed journals
The Hoffman program for mixed graphs (with Y. Yu),
Linear Algebra and its Applications 726 (2025), 436-457. Math arXiv:2406.18318.
Characterizations of amorphic schemes and fusions of pairs (with J.H. Koolen and Y. Xiong),
J. Combinatorial Th. A. 215 (2025), 106045. Math arXiv:2404.00567.
Rainbow Hamiltonicity and the spectral radius (with Y. Zhang),
Discrete Math. 348 (2025), 114600. Math arXiv:2401.17845.
Symmetry in complex unit gain graphs and their spectra (with P. Wissing),
Linear Algebra and its Applications 722 (2025), 164-177. Math arXiv:2305.15207.
76. Spectra of power hypergraphs and signed graphs via parity-closed walks (with L. Chen and C. Bu),
J. Combinatorial Th. A. 207 (2024), 105909. Math arXiv:2302.10496.
75. Matching extension and distance spectral radius (with Y. Zhang),
Linear Algebra and its Applications 674 (2023), 244-255. Math arXiv:2303.17284.
74. The characteristic polynomials of uniform double hyperstars and uniform hypertriangles (with C. Duan and L. Wang),
Linear Algebra and its Applications 678 (2023), 16-32.
73. All eigenvalues of the power hypergraph and signed subgraphs of a graph (with L. Chen and C. Bu),
Linear Algebra and its Applications 676 (2023), 205-210. Math arXiv:2209.03709.
72. On bipartite distance-regular Cayley graphs with small diameter (with M. Jazaeri),
Electronic Journal of Combinatorics (2022). Math arXiv:2109.13849.
71. Unit gain graphs with two distinct eigenvalues and systems of lines in complex space (with P. Wissing),
Discrete Math. 345 (2022), 112827. Math arXiv:2105.09149.
70. Spectral fundamentals and characterizations of signed directed graphs (with P. Wissing),
J. Combinatorial Th. A. 187 (2022), 105573. Math arXiv:2009.12181.
69. Spectral radius and clique partitions of graphs (with J. Zhou),
Linear Algebra and its Applications 630 (2021), 84-94. Math arXiv:2111.02734.
68. Trees with a large Laplacian eigenvalue multiplicity (with S. Akbari and M.H. Fakharan),
Linear Algebra and its Applications 586 (2020), 262-273. Math arXiv:1907.11482.
67. The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum (with P. Wissing),
J. Combinatorial Th. A 173 (2020), 105232. Math arXiv:1903.09531.
66. Distance-regular Cayley graphs with small valency (with M. Jazaeri),
Ars Mathematica Contemporanea 17 (2019), 203-222. Math arXiv:1808.01428.
65. Partially metric association schemes with a multiplicity three (with J.H. Koolen and J. Park),
J. Combinatorial Th. B 130 (2018), 19-48. Math arXiv:1701.03193.
64. Laplacian spectral characterization of roses (with C.X. He),
Linear Algebra and its Applications 536 (2018), 19-30. Math arXiv:1607.05466.
63. Directed strongly walk-regular graphs (with G.R. Omidi),
J. Alg. Combinatorics 47 (2018), 623-639. Math arXiv:1508.05281.
62. Distance-regular Cayley graphs with least eigenvalue -2 (with A. Abdollahi and M. Jazaeri),
Designs, Codes and Cryptography 84 (2017), 73-85. Math arXiv:1512.06019.
61. New bounds for the max-k-cut and chromatic number of a graph (with R. Sotirov),
Linear Algebra and its Applications 488 (2016), 216-234. Math arXiv:1503.06595.
60. Distance-regular graphs (with J.H. Koolen and H. Tanaka),
Electronic Journal of Combinatorics (2016), #DS22. Math arXiv:1410.6294.
59. Some spectral and quasi-spectral characterizations of distance-regular graphs (with A. Abiad and M.A. Fiol),
J. Combinatorial Th. A 143 (2016), 1-18. Math arXiv:1404.3973.
58. Graphs with many valencies and few eigenvalues (with J.H. Koolen and Z. Xia),
Electr. J. Linear Algebra 28 (2015), 12-24. Math arXiv:1405.3383.
57. Semidefinite programming and eigenvalue bounds for the graph partition problem (with R. Sotirov),
Math. Programming B 151 (2015), 379-404. Math arXiv:1312.0332.
56. On bounding the bandwidth of graphs with symmetry (with R. Sotirov),
INFORMS Journal on Computing 27 (2015), 75-88. Math arXiv:1212.0694.
55. The Laplacian spectral excess theorem for distance-regular graphs (with M.A. Fiol),
Linear Algebra and its Applications 458 (2014), 245-250. Math arXiv:1405.0169.
54. Regular graphs with maximal energy per vertex (with W.H. Haemers and J.H. Koolen),
J. Combinatorial Th. B 107 (2014), 123-131. Math arXiv:1210.8273.
53. Geometric aspects of 2-walk-regular graphs (with M. Cámara, J.H. Koolen, and J. Park),
Linear Algebra and its Applications 439 (2013), 2692-2710. Math arXiv:1304.2905.
52. Strongly walk-regular graphs (with G.R. Omidi),
J. Combinatorial Th. A 120 (2013), 803-810. Math arXiv:1208.3067.
51. Uniformity in association schemes and coherent configurations: cometric Q-antipodal schemes and linked systems (with W.J. Martin and M. Muzychuk),
J. Combinatorial Th. A 120 (2013), 1401-1439. Math arXiv:1001.4928.
50. A short proof of the odd-girth theorem (with M.A. Fiol),
Electronic Journal of Combinatorics 19:3 (2012), P12. Math arXiv:1205.0153.
49. Dual concepts of almost distance-regularity and the spectral excess theorem (with C. Dalfó, M.A. Fiol, and E. Garriga),
Discrete Math. 312 (2012), 2730-2734. Math arXiv:1207.3606.
48. On perturbations of almost distance-regular graphs (with C. Dalfó and M.A. Fiol),
Linear Algebra and its Applications 435 (2011), 2626-2638. Math arXiv:1202.3313.
47. Graphs whose normalized Laplacian has three eigenvalues (with G.R. Omidi),
Linear Algebra and its Applications 435 (2011), 2560-2569. Math arXiv:1202.3027.
46. An odd characterization of the generalized odd graphs (with W.H. Haemers),
J. Combinatorial Th. B 101 (2011), 486-489. Math arXiv:1202.2300.
45. On almost distance-regular graphs (with C. Dalfó, M.A. Fiol, E. Garriga, and B.L. Gorissen),
J. Combinatorial Th. A 118 (2011), 1094-1113. Math arXiv:1202.3265.
44. Enhancement of sandwich algorithms for approximating higher dimensional convex Pareto sets (with G. Rennen and D. den Hertog),
INFORMS Journal on Computing 23 (2011), 493-517. CentER discussion paper 2009-52.
43. Space-filling Latin hypercube designs for computer experiments (with B.G.M. Husslage, G. Rennen, and D. den Hertog),
Optimization and Engineering 12 (2011), 611-630.
42. Enriching the tactical network design of express service carriers with fleet scheduling characteristics (with W.J.M. Meuffels, H.A. Fleuren, and F.C.A.M. Cruijssen),
Flexible Services and Manufacturing 22 (2010), 3-35.
41. A lower bound for the spectral radius of graphs with fixed diameter (with S.M. Cioabă, J.H. Koolen, and J.-H. Lee),
European J. Combinatorics 31 (2010), 1560-1566.
40. Asymptotic results on the spectral radius and the diameter of graphs (with S.M. Cioabă, J.H. Koolen, and J.-H. Lee),
Linear Algebra and its Applications 432 (2010), 722-737.
39. Some implications on amorphic association schemes (with M. Muzychuk),
J. Combinatorial Th. A 117 (2010), 111-127.
38. Nested maximin Latin hypercube designs (with G. Rennen, B.G.M. Husslage, and D. den Hertog),
Structural and Multidisciplinary Optimization 41 (2010), 371-395.
37. One-dimensional nested maximin designs (with B.G.M. Husslage and D. den Hertog),
Journal of Global Optimization 46 (2010), 287-306.
36. Bounds for maximin Latin hypercube designs (with B.G.M. Husslage and G. Rennen),
Operations Research 57 (2009), 595-608. Postprint. CentER discussion paper 2007-16.
35. Developments on spectral characterizations of graphs (with W.H. Haemers),
Discrete Math. 309 (2009), 576-586.
34. The spectral excess theorem for distance-regular graphs: a global (over)view,
Electronic Journal of Combinatorics 15 (2008), R129.
33. Spectral characterization of the Hamming graphs, (with S. Bang and J.H. Koolen)
Linear Algebra and its Applications 429 (2008), 2678-2686.
32. Two-dimensional minimax Latin hypercube designs,
Discrete Applied Math. 156 (2008), 3483-3493.
31. Graphs with given diameter maximizing the spectral radius,
Linear Algebra and its Applications 426 (2007), 454-457.
30. The minimal spectral radius of graphs with a given diameter (with R.E. Kooij),
Linear Algebra and its Applications 423 (2007), 408-419.
29. Cospectral graphs and the generalized adjacency matrix (with W.H. Haemers and J.H. Koolen),
Linear Algebra and its Applications 423 (2007), 33-41.
28. Maximin Latin hypercube designs in two dimensions (with B.G.M. Husslage, D. den Hertog, and J.B.M. Melissen),
Operations Research 55 (2007), 158-169. Postprint. CentER discussion paper 2005-8.
27. Characterizing distance-regularity of graphs by the spectrum (with W.H. Haemers, J.H. Koolen, and E. Spence),
J. Combinatorial Th. A 113 (2006), 1805-1820.
26. A new family of distance-regular graphs with unbounded diameter (with J.H. Koolen),
Inventiones Mathematicae 162 (2005), 189-193. Postprint. CentER discussion paper 2004-116.
25. Combinatorial designs with two singular values II. Partial geometric designs (with E. Spence),
Linear Algebra and its Applications 396 (2005), 303-316.
24. The combinatorics of Dom de Caen,
Designs, Codes and Cryptography 34 (2005), 137-148. Postprint.
23. Combinatorial designs with two singular values I. Uniform multiplicative designs (with E. Spence),
J. Combinatorial Th. A 107 (2004), 127-142.
22. Collaborative metamodeling: coordinating simulation-based product design (with B.G.M. Husslage, D. den Hertog, H.P. Stehouwer, and E.D. Stinstra),
Concurrent Engineering 11 (2003), 267-278. Postprint. Preprint.
21. Which graphs are determined by their spectrum? (with W.H. Haemers),
Linear Algebra and its Applications 373 (2003), 241-272.
20. Equitable resolvable coverings (with W.H. Haemers and M.B.M. Peek),
J. Combinatorial Designs 11 (2003), 113-123. Postprint.
19. Strongly regular decompositions of the complete graph,
J. Alg. Combinatorics 17 (2003), 181-201. Postprint.
18. Codes, graphs, and schemes from nonlinear functions (with D. Fon-Der-Flaass),
European J. Combinatorics 24 (2003), 85-98. (Most downloaded article of EuJC 2003.)
17. Spectral characterizations of some distance-regular graphs (with W.H. Haemers),
J. Alg. Combinatorics 15 (2002), 189-202. Postprint.
16. Fissioned triangular schemes via the cross-ratio (with D. de Caen),
European J. Combinatorics 22 (2001), 297-301.
15. Uniformly packed codes and more distance regular graphs from crooked functions (with D. Fon-Der-Flaass),
J. Alg. Combinatorics 12 (2000), 115-121. Postprint.
14. A characterization of association schemes from affine spaces,
Designs, Codes and Cryptography 21 (2000), 83-86. Postprint.
13. Fissions of classical self-dual association schemes (with D. de Caen),
J. Combinatorial Th. A 88 (1999), 167-175.
12. Association schemes related to Kasami codes and Kerdock sets (with D. de Caen),
Designs, Codes and Cryptography 18 (1999), 89-102. Postprint.
11. A nonregular analogue of conference graphs (with D. de Caen and E. Spence),
J. Combinatorial Th. A 88 (1999), 194-204.
10. Three-class association schemes,
J. Alg. Combinatorics 10 (1999), 69-107. Postprint.
9. A Cauchy-Khinchin matrix inequality,
Linear Algebra and its Applications 280 (1998), 163-172.
8. Nonregular graphs with three eigenvalues,
J. Combinatorial Th. B 73 (1998), 101-118.
7. Small regular graphs with four eigenvalues (with E. Spence),
Discrete Math. 189 (1998), 233-257.
6. Bounds on special subsets in graphs, eigenvalues and association schemes,
J. Alg. Combinatorics 7 (1998), 321-332. Postprint.
5. Graphs with constant μ and μ-bar (with W.H. Haemers),
Discrete Math. 182 (1998), 293-307. (Selected for Discrete Mathematics-Editors' Choice, 1998.)
4. A characterization of distance-regular graphs with diameter three (with W.H. Haemers),
J. Alg. Combinatorics 6 (1997), 299-303. Postprint.
3. Regular graphs with four eigenvalues,
Linear Algebra and its Applications 226-228 (1995), 139-162.
2. Eigenvalues and the diameter of graphs (with W.H. Haemers),
Linear Multilin. Alg. 39 (1995), 33-44. Postprint.
1. Classification of spreads of PG(3,4)\ PG(3,2),
Designs, Codes and Cryptography 3 (1993), 193-198. Postprint.
Papers in books/proceedings
Pancakes and crooked graphs,
Dima Fon-Der-Flaass, Novosibirsk, 2012, pp. 176-179.
Dual concepts of almost distance-regularity and the spectral excess theorem (with C. Dalfó, M.A. Fiol, and E. Garriga),
Proceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010, Barcelona, 2011, pp. 209-226.
Robustness of networks against viruses: the role of the spectral radius (with A. Jamakovic, R.E. Kooij, and P. Van Mieghem),
Proceedings of the 13th Annual Symposium of the IEEE/CVT Benelux, Liege, 2006, pp. 35-38. Postprint.
Graphs, distances and eigenvalues,
Ten Years LNMB (W.K. Klein Haneveld et al., eds.) CWI Tract 122, Mathematical Centre, Amsterdam, 1997, pp. 19-22.
Books
Linear and Dynamical Systems, Optimization and Games (with P. Borm, H. Hamers, and H. Norde), Pearson, UK, 2006, 2nd ed. 2010.
Editorial
Preface to the special issue dedicated to Andries E. Brouwer,
Designs, Codes and Cryptography 84 (2017), 1-2.
Preface: Geometric and algebraic combinatorics,
Designs, Codes and Cryptography 65 (2012), 1-3.
Linear Algebra and its Applications 435 (2011), 2321-2333.
Preface: Geometric and algebraic combinatorics,
European J. Combinatorics 31 (2010), 1497-1498.
Geometric and algebraic combinatorics,
European J. Combinatorics 28 (2007), 1877.
Book reviews
Review of "Topics in Algebraic Graph Theory" (in Dutch),
[Review of: L.W. Beineke et al., Topics in Algebraic Graph Theory, Cambridge University Press, 2004],
Nieuw Archief voor Wiskunde 5/10 (2009), 141.
Review of "Association Schemes" (in Dutch),
[Review of: Bailey, R.A., Association Schemes. Designed experiments, Algebra and Combinatorics, Cambridge University Press, 2004],
Nieuw Archief voor Wiskunde 5/8 (2007), 227-228.
Review of "Handbook of Coding Theory",
[Review of: Pless, V.S., Huffman, W.C., Handbook of Coding Theory I, II, Elsevier, Amsterdam, 1998],
Nieuw Archief voor Wiskunde 5/2 (2001), 85-86.
Review of "Eigenspaces of Graphs",
[Review of: Cvetković, D., Rowlinson, P., Simić, S., Eigenspaces of Graphs, Cambridge University Press, Cambridge, 1997],
Mededelingen van het Wiskundig Genootschap 41 (1998), 169-170.
Theses
Ph.D. thesis (supervised by W.H. Haemers, promoted by S.H. Tijs)
Graphs with Few Eigenvalues - an Interplay between Combinatorics and Algebra,
CentER dissertation series 20, Tilburg University, 1996. (Stellingen.)
Master's thesis (supervised by A.E. Brouwer)
Sets of Mutually Disjoint Blocks in Steiner Systems,
Eindhoven University of Technology, 1992