Publications of Edwin van Dam

• Work in progress

  Distance-regular graphs, unfinished manuscript (with J.H. Koolen and H. Tanaka).
  
  

• Preprints

  A short proof of the odd-girth theorem (submitted) (with M.A. Fiol).
  
  Pancakes and crooked graphs, in memory of Dima Fon-Der-Flaass.
  
  Uniformity in association schemes and coherent configurations: cometric Q-antipodal schemes and linked systems (submitted) (with W.J. Martin and M. Muzychuk).
  CentER discussion paper 2010-10.
  
  

• Papers in refereed journals

  For most papers there is free access here.
  
  Dual concepts of almost distance-regularity and the spectral excess theorem, Discrete Math. (to appear) (with C. Dalfó, M.A. Fiol, and E. Garriga). Postprint.
  
  48. On perturbations of almost distance-regular graphs
  Linear Algebra and its Applications 435 (2011), 2626-2638 (with C. Dalfó and M.A. Fiol). Postprint.
  
  47. Graphs whose normalized Laplacian has three eigenvalues,
  Linear Algebra and its Applications 435 (2011), 2560-2569 (with G.R. Omidi). Postprint.
  
  46. An odd characterization of the generalized odd graphs
  J. Combinatorial Th. B 101 (2011), 486-489 (with W.H. Haemers). Postprint. CentER discussion paper 2010-47.
  
  45. On almost distance-regular graphs,
  J. Combinatorial Th. A 118 (2011), 1094-1113 (with C. Dalfó, M.A. Fiol, E. Garriga, and B.L. Gorissen). Postprint. CentER discussion paper 2010-28.
  
  44. Enhancement of sandwich algorithms for approximating higher dimensional convex Pareto sets,
  INFORMS Journal on Computing 23 (2011), 493-517 (with G. Rennen and D. den Hertog). CentER discussion paper 2009-52.
  
  43. Space-filling Latin hypercube designs for computer experiments,
  Optimization and Engineering 12 (2011), 611-630 (with B.G.M. Husslage, G. Rennen, and D. den Hertog). CentER discussion paper 2008-104 (revision of 2006-18).
  
  42. Enriching the tactical network design of express service carriers with fleet scheduling characteristics,
  Flexible Services and Manufacturing 22 (2010), 3-35 (with W.J.M. Meuffels, H.A. Fleuren, and F.C.A.M. Cruijssen). CentER discussion paper 2009-79.
  
  41. A lower bound for the spectral radius of graphs with fixed diameter,
  European J. Combinatorics 31 (2010), 1560-1566 (with S.M. Cioabă, J.H. Koolen, and J.-H. Lee). CentER discussion paper 2008-75.
  
  40. Asymptotic results on the spectral radius and the diameter of graphs,
  Linear Algebra and its Applications 432 (2010), 722-737 (with S.M. Cioabă, J.H. Koolen, and J.-H. Lee). CentER discussion paper 2008-71.
  
  39. Some implications on amorphic association schemes,
  J. Combinatorial Th. A 117 (2010), 111-127 (with M. Muzychuk). CentER discussion paper 2008-56.
  
  38. Nested maximin Latin hypercube designs,
  Structural and Multidisciplinary Optimization 41 (2010), 371-395 (with G. Rennen, B.G.M. Husslage, and D. den Hertog). CentER discussion paper 2009-6 (revision of 2005-79).
  
  37. One-dimensional nested maximin designs,
  Journal of Global Optimization 46 (2010), 287-306 (with B.G.M. Husslage and D. den Hertog). CentER discussion paper 2004-66.
  
  36. Bounds for maximin Latin hypercube designs,
  Operations Research 57 (2009), 595-608 (with B.G.M. Husslage and G. Rennen). CentER discussion paper 2007-16.
  
  35. Developments on spectral characterizations of graphs,
  Discrete Math. 309 (2009), 576-586 (with W.H. Haemers). CentER discussion paper 2007-33.
  
  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,
  Linear Algebra and its Applications 429 (2008), 2678-2686 (with S. Bang and J.H. Koolen). CentER discussion paper 2007-81.
  
  32. Two-dimensional minimax Latin hypercube designs,
  Discrete Applied Math. 156 (2008), 3483-3493. CentER discussion paper 2005-105.
  
  31. Graphs with given diameter maximizing the spectral radius,
  Linear Algebra and its Applications 426 (2007), 454-457. CentER discussion paper 2007-36.
  
  30. The minimal spectral radius of graphs with a given diameter,
  Linear Algebra and its Applications 423 (2007), 408-419 (with R.E. Kooij). CentER discussion paper 2006-102.
  
  29. Cospectral graphs and the generalized adjacency matrix,
  Linear Algebra and its Applications 423 (2007), 33-41 (with W.H. Haemers and J.H. Koolen). CentER discussion paper 2006-31.
  
  28. Maximin Latin hypercube designs in two dimensions,
  Operations Research 55 (2007), 158-169 (with B.G.M. Husslage, D. den Hertog, and J.B.M. Melissen). CentER discussion paper 2005-8.
  
  27. Characterizing distance-regularity of graphs by the spectrum,
  J. Combinatorial Th. A 113 (2006), 1805-1820 (with W.H. Haemers, J.H. Koolen, and E. Spence). CentER discussion paper 2005-19.
  
  26. A new family of distance-regular graphs with unbounded diameter,
  Inventiones Mathematicae 162 (2005), 189-193 (with J.H. Koolen). CentER discussion paper 2004-116.
  
  25. Combinatorial designs with two singular values II. Partial geometric designs,
  Linear Algebra and its Applications 396 (2005), 303-316 (with E. Spence). CentER discussion paper 2003-94.
  
  24. The combinatorics of Dom de Caen,
  Designs, Codes and Cryptography 34 (2005), 137-148. Preprint.
  
  23. Combinatorial designs with two singular values I. Uniform multiplicative designs,
  J. Combinatorial Th. A 107 (2004), 127-142 (with E. Spence). CentER discussion paper 2003-67.
  
  22. Collaborative metamodeling: coordinating simulation-based product design,
  Concurrent Engineering 11 (2003), 267-278 (with B.G.M. Husslage, D. den Hertog, H.P. Stehouwer, and E.D. Stinstra). Preprint.
  
  21. Which graphs are determined by their spectrum?,
  Linear Algebra and its Applications 373 (2003), 241-272 (with W.H. Haemers).
  
  20. Equitable resolvable coverings,
  J. Combinatorial Designs 11 (2003), 113-123 (with W.H. Haemers and M.B.M. Peek).
  
  19. Strongly regular decompositions of the complete graph,
  J. Alg. Combinatorics 17 (2003), 181-201.
  
  18. Codes, graphs, and schemes from nonlinear functions,
  European J. Combinatorics 24 (2003), 85-98 (with D. Fon-Der-Flaass). (Most downloaded article of EuJC 2003)
  
  17. Spectral characterizations of some distance-regular graphs,
  J. Alg. Combinatorics 15 (2002), 189-202 (with W.H. Haemers).
  
  16. Fissioned triangular schemes via the cross-ratio,
  European J. Combinatorics 22 (2001), 297-301 (with D. de Caen).
  
  15. Uniformly packed codes and more distance regular graphs from crooked functions,
  J. Alg. Combinatorics 12 (2000), 115-121 (with D. Fon-Der-Flaass).
  
  14. A characterization of association schemes from affine spaces,
  Designs, Codes and Cryptography 21 (2000), 83-86.
  
  13. Fissions of classical self-dual association schemes,
  J. Combinatorial Th. A 88 (1999), 167-175 (with D. de Caen).
  
  12. Association schemes related to Kasami codes and Kerdock sets,
  Designs, Codes and Cryptography 18 (1999), 89-102 (with D. de Caen).
  
  11. A nonregular analogue of conference graphs,
  J. Combinatorial Th. A 88 (1999), 194-204 (with D. de Caen and E. Spence).
  
  10. Three-class association schemes,
  J. Alg. Combinatorics 10 (1999), 69-107.
  
  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,
  Discrete Math. 189 (1998), 233-257 (with E. Spence).
  
  6. Bounds on special subsets in graphs, eigenvalues and association schemes,
  J. Alg. Combinatorics 7 (1998), 321-332.
  
  5. Graphs with constant μ and μ-bar,
  Discrete Math. 182 (1998), 293-307 (with W.H. Haemers). (Selected for Discrete Mathematics-Editors' Choice,1998)
  
  4. A characterization of distance-regular graphs with diameter three,
  J. Alg. Combinatorics 6 (1997), 299-303 (with W.H. Haemers).
  
  3. Regular graphs with four eigenvalues,
  Linear Algebra and its Applications 226-228 (1995), 139-162.
  
  2. Eigenvalues and the diameter of graphs,
  Linear Multilin. Alg. 39 (1995), 33-44 (with W.H. Haemers).
  
  1. Classification of spreads of PG(3,4)\ PG(3,2),
  Designs, Codes and Cryptography 3 (1993), 193-198.
  
  

• Papers in books/proceedings

  Dual concepts of almost distance-regularity and the spectral excess theorem,
  Proceedings of the 3rd International Workshop on Optimal Networks Topologies IWONT 2010, Barcelona, 2011, pp. 209-226 (with C. Dalfó, M.A. Fiol, and E. Garriga).
  
  Robustness of networks against viruses: the role of the spectral radius,
  Proceedings of the 13th Annual Symposium of the IEEE/CVT Benelux, Liege, 2006, pp. 35-38 (with A. Jamakovic, R.E. Kooij, and P. Van Mieghem).
  
  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, Pearson, UK, 2006 (with P. Borm, H. Hamers, and H. Norde).
  
  

• Editorial

  Dragoš Cvetković, 70,
  Linear Algebra and its Applications 435 (2011), 2321-2333.
  
  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.