Edwin R. van Dam

According to our database1, Edwin R. van Dam authored at least 39 papers between 1993 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum.
J. Comb. Theory, Ser. A, 2020

2018
Partially metric association schemes with a multiplicity three.
J. Comb. Theory, Ser. B, 2018

2017
Preface to the special issue dedicated to Andries E. Brouwer.
Des. Codes Cryptogr., 2017

Distance-regular Cayley graphs with least eigenvalue -2.
Des. Codes Cryptogr., 2017

2016
Some spectral and quasi-spectral characterizations of distance-regular graphs.
J. Comb. Theory, Ser. A, 2016

2015
Semidefinite programming and eigenvalue bounds for the graph partition problem.
Math. Program., 2015

On Bounding the Bandwidth of Graphs with Symmetry.
INFORMS J. Comput., 2015

2014
Regular graphs with maximal energy per vertex.
J. Comb. Theory, Ser. B, 2014

2013
Strongly walk-regular graphs.
J. Comb. Theory, Ser. A, 2013

Uniformity in association schemes and coherent configurations: Cometric Q-antipodal schemes and linked systems.
J. Comb. Theory, Ser. A, 2013

2012
Dual concepts of almost distance-regularity and the spectral excess theorem.
Discret. Math., 2012

A Short Proof of the Odd-Girth Theorem.
Electron. J. Comb., 2012

2011
An odd characterization of the generalized odd graphs.
J. Comb. Theory, Ser. B, 2011

On almost distance-regular graphs.
J. Comb. Theory, Ser. A, 2011

Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets.
INFORMS J. Comput., 2011

2010
One-dimensional nested maximin designs.
J. Glob. Optim., 2010

Some implications on amorphic association schemes.
J. Comb. Theory, Ser. A, 2010

Preface: Geometric and Algebraic Combinatorics.
Eur. J. Comb., 2010

A lower bound for the spectral radius of graphs with fixed diameter.
Eur. J. Comb., 2010

2009
Bounds for Maximin Latin Hypercube Designs.
Oper. Res., 2009

Developments on spectral characterizations of graphs.
Discret. Math., 2009

2008
Two-dimensional minimax Latin hypercube designs.
Discret. Appl. Math., 2008

The Spectral Excess Theorem for Distance-Regular Graphs: A Global (Over)view.
Electron. J. Comb., 2008

2007
Maximin Latin Hypercube Designs in Two Dimensions.
Oper. Res., 2007

Geometric and algebraic combinatorics.
Eur. J. Comb., 2007

2006
Characterizing distance-regularity of graphs by the spectrum.
J. Comb. Theory, Ser. A, 2006

2005
The Combinatorics of Dom de Caen.
Des. Codes Cryptogr., 2005

2004
Combinatorial designs with two singular values--I: uniform multiplicative designs.
J. Comb. Theory, Ser. A, 2004

2003
Codes, graphs, and schemes from nonlinear functions.
Eur. J. Comb., 2003

Collaborative Metamodeling: Coordinating Simulation-based Product Design.
Concurr. Eng. Res. Appl., 2003

2001
Fissioned Triangular Schemes via the Cross-ratio.
Eur. J. Comb., 2001

2000
A Characterization of Association Schemes from Affine Spaces.
Des. Codes Cryptogr., 2000

1999
A Nonregular Analogue of Conference Graphs.
J. Comb. Theory, Ser. A, 1999

Fissions of Classical Self-Dual Association Schemes.
J. Comb. Theory, Ser. A, 1999

Association Schemes Related to Kasami Codes and Kerdock Sets.
Des. Codes Cryptogr., 1999

1998
Nonregular Graphs with Three Eigenvalues.
J. Comb. Theory, Ser. B, 1998

Small regular graphs with four eigenvalues.
Discret. Math., 1998

Graphs with constant µ and µ_.
Discret. Math., 1998

1993
Classifications of Spreads of PG(3, 4) \ PG(3, 2).
Des. Codes Cryptogr., 1993


  Loading...