Остановите войну!
for scientists:
default search action
Edwin R. van Dam
Person information
- affiliation: Tilburg University, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j44]Edwin R. van Dam, Mojtaba Jazaeri:
On Bipartite Distance-Regular Cayley Graphs with Small Diameter. Electron. J. Comb. 29(2) (2022) - [j43]Pepijn Wissing, Edwin R. van Dam:
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space. Discret. Math. 345(6): 112827 (2022) - [j42]Pepijn Wissing, Edwin R. van Dam:
Spectral fundamentals and characterizations of signed directed graphs. J. Comb. Theory, Ser. A 187: 105573 (2022) - 2020
- [j41]Pepijn Wissing, Edwin R. van Dam:
The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum. J. Comb. Theory, Ser. A 173: 105232 (2020)
2010 – 2019
- 2019
- [j40]Edwin R. van Dam, Mojtaba Jazaeri:
Distance-regular Cayley graphs with small valency. Ars Math. Contemp. 17(1): 203-222 (2019) - 2018
- [j39]Edwin R. van Dam, Jack H. Koolen, Jongyook Park:
Partially metric association schemes with a multiplicity three. J. Comb. Theory, Ser. B 130: 19-48 (2018) - 2017
- [j38]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) - [j37]Alireza Abdollahi, Edwin R. van Dam, Mojtaba Jazaeri:
Distance-regular Cayley graphs with least eigenvalue -2. Des. Codes Cryptogr. 84(1-2): 73-85 (2017) - 2016
- [j36]Aida Abiad, Edwin R. van Dam, Miguel Angel Fiol:
Some spectral and quasi-spectral characterizations of distance-regular graphs. J. Comb. Theory, Ser. A 143: 1-18 (2016) - 2015
- [j35]Edwin R. van Dam, Renata Sotirov:
On Bounding the Bandwidth of Graphs with Symmetry. INFORMS J. Comput. 27(1): 75-88 (2015) - [j34]Edwin R. van Dam, Renata Sotirov:
Semidefinite programming and eigenvalue bounds for the graph partition problem. Math. Program. 151(2): 379-404 (2015) - 2014
- [j33]Edwin R. van Dam, Willem H. Haemers, Jack H. Koolen:
Regular graphs with maximal energy per vertex. J. Comb. Theory, Ser. B 107: 123-131 (2014) - 2013
- [j32]Edwin R. van Dam, G. R. Omidi:
Strongly walk-regular graphs. J. Comb. Theory, Ser. A 120(4): 803-810 (2013) - [j31]Edwin R. van Dam, William J. Martin, Mikhail E. Muzychuk:
Uniformity in association schemes and coherent configurations: Cometric Q-antipodal schemes and linked systems. J. Comb. Theory, Ser. A 120(7): 1401-1439 (2013) - 2012
- [j30]Edwin R. van Dam, Miguel Angel Fiol:
A Short Proof of the Odd-Girth Theorem. Electron. J. Comb. 19(3): 12 (2012) - [j29]Edwin R. van Dam, Willem H. Haemers:
Preface: Geometric and algebraic combinatorics. Des. Codes Cryptogr. 65(1-2): 1-3 (2012) - [j28]Cristina Dalfó, Edwin R. van Dam, Miguel Angel Fiol, Ernest Garriga:
Dual concepts of almost distance-regularity and the spectral excess theorem. Discret. Math. 312(17): 2730-2734 (2012) - [i1]Edwin R. van Dam, Renata Sotirov:
On bounding the bandwidth of graphs with symmetry. CoRR abs/1212.0694 (2012) - 2011
- [j27]Gijs Rennen, Edwin R. van Dam, Dick den Hertog:
Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets. INFORMS J. Comput. 23(4): 493-517 (2011) - [j26]Edwin R. van Dam, Willem H. Haemers:
An odd characterization of the generalized odd graphs. J. Comb. Theory, Ser. B 101(6): 486-489 (2011) - [j25]Cristina Dalfó, Edwin R. van Dam, Miguel Angel Fiol, Ernest Garriga, Bram L. Gorissen:
On almost distance-regular graphs. J. Comb. Theory, Ser. A 118(3): 1094-1113 (2011) - 2010
- [j24]Edwin R. van Dam, Willem H. Haemers:
Preface: Geometric and Algebraic Combinatorics. Eur. J. Comb. 31(6): 1497-1498 (2010) - [j23]Sebastian M. Cioaba, Edwin R. van Dam, Jack H. Koolen, Jae-Ho Lee:
A lower bound for the spectral radius of graphs with fixed diameter. Eur. J. Comb. 31(6): 1560-1566 (2010) - [j22]Edwin R. van Dam, Mikhail E. Muzychuk:
Some implications on amorphic association schemes. J. Comb. Theory, Ser. A 117(2): 111-127 (2010) - [j21]Edwin R. van Dam, Bart Husslage, Dick den Hertog:
One-dimensional nested maximin designs. J. Glob. Optim. 46(2): 287-306 (2010)
2000 – 2009
- 2009
- [j20]Edwin R. van Dam, Willem H. Haemers:
Developments on spectral characterizations of graphs. Discret. Math. 309(3): 576-586 (2009) - [j19]Edwin R. van Dam, Gijs Rennen, Bart Husslage:
Bounds for Maximin Latin Hypercube Designs. Oper. Res. 57(3): 595-608 (2009) - 2008
- [j18]Edwin R. van Dam:
The Spectral Excess Theorem for Distance-Regular Graphs: A Global (Over)view. Electron. J. Comb. 15(1) (2008) - [j17]Edwin R. van Dam:
Two-dimensional minimax Latin hypercube designs. Discret. Appl. Math. 156(18): 3483-3493 (2008) - 2007
- [j16]Edwin R. van Dam, Willem H. Haemers:
Geometric and algebraic combinatorics. Eur. J. Comb. 28(7): 1877 (2007) - [j15]Edwin R. van Dam, Bart Husslage, Dick den Hertog, Hans Melissen:
Maximin Latin Hypercube Designs in Two Dimensions. Oper. Res. 55(1): 158-169 (2007) - 2006
- [j14]Edwin R. van Dam, Willem H. Haemers, Jacobus H. Koolen, Edward Spence:
Characterizing distance-regularity of graphs by the spectrum. J. Comb. Theory, Ser. A 113(8): 1805-1820 (2006) - 2005
- [j13]Edwin R. van Dam:
The Combinatorics of Dom de Caen. Des. Codes Cryptogr. 34(2-3): 137-148 (2005) - 2004
- [j12]Edwin R. van Dam, Edward Spence:
Combinatorial designs with two singular values--I: uniform multiplicative designs. J. Comb. Theory, Ser. A 107(1): 127-142 (2004) - 2003
- [j11]Bart Husslage, Edwin R. van Dam, Dick den Hertog, Peter Stehouwer, Erwin Stinstra:
Collaborative Metamodeling: Coordinating Simulation-based Product Design. Concurr. Eng. Res. Appl. 11(4): 267-278 (2003) - [j10]Edwin R. van Dam, Dmitry Fon-Der-Flaass:
Codes, graphs, and schemes from nonlinear functions. Eur. J. Comb. 24(1): 85-98 (2003) - 2001
- [j9]Dominique de Caen, Edwin R. van Dam:
Fissioned Triangular Schemes via the Cross-ratio. Eur. J. Comb. 22(3): 297-301 (2001) - 2000
- [j8]Edwin R. van Dam:
A Characterization of Association Schemes from Affine Spaces. Des. Codes Cryptogr. 21(1/3): 83-86 (2000)
1990 – 1999
- 1999
- [j7]Dominique de Caen, Edwin R. van Dam:
Association Schemes Related to Kasami Codes and Kerdock Sets. Des. Codes Cryptogr. 18(1/3): 89-102 (1999) - [j6]Dominique de Caen, Edwin R. van Dam:
Fissions of Classical Self-Dual Association Schemes. J. Comb. Theory, Ser. A 88(1): 167-175 (1999) - [j5]Dominique de Caen, Edwin R. van Dam, Edward Spence:
A Nonregular Analogue of Conference Graphs. J. Comb. Theory, Ser. A 88(1): 194-204 (1999) - 1998
- [j4]Edwin R. van Dam, Willem H. Haemers:
Graphs with constant µ and µ_. Discret. Math. 182(1-3): 293-307 (1998) - [j3]Edwin R. van Dam, Edward Spence:
Small regular graphs with four eigenvalues. Discret. Math. 189(1-3): 233-257 (1998) - [j2]Edwin R. van Dam:
Nonregular Graphs with Three Eigenvalues. J. Comb. Theory, Ser. B 73(2): 101-118 (1998) - 1993
- [j1]Edwin R. van Dam:
Classifications of Spreads of PG(3, 4) \ PG(3, 2). Des. Codes Cryptogr. 3(3): 193-198 (1993)
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-04-25 05:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint