Andries E. Brouwer

Affiliations:
  • Eindhoven University of Technology, The Netherlands


According to our database1, Andries E. Brouwer authored at least 103 papers between 1977 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Strongly Regular Graphs Satisfying the 4-Vertex Condition.
Comb., April, 2023

The Equivalence of Two Inequalities for Quasisymmetric Designs.
Electron. J. Comb., 2023

2022
Triple intersection numbers for the Paley graphs.
Finite Fields Their Appl., 2022

2019
Uniqueness of codes using semidefinite programming.
Des. Codes Cryptogr., 2019

2018
Counterexamples to Conjectures About Subset Takeaway and Counting Linear Extensions of a Boolean Lattice.
Order, 2018

The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters.
J. Comb. Theory, Ser. B, 2018

2017
Binomial Collisions and Near Collisions.
Integers, 2017

Cocliques in the Kneser graph on line-plane flags in PG(4;q).
Comb., 2017

2016
The nonexistence of distance-regular graphs with intersection arrays {27, 20, 10;1, 2, 18} and {36, 28, 4;1, 2, 24}.
Australas. J Comb., 2016

2015
Blocking sets of the classical unital.
Finite Fields Their Appl., 2015

Lossy Gossip and Composition of Metrics.
Discret. Comput. Geom., 2015

2014
Maximal cocliques in the Kneser graph on point-plane flags in PG(4, q).
Eur. J. Comb., 2014

Note on the size of binary Armstrong codes.
Des. Codes Cryptogr., 2014

A 64-Dimensional Counterexample to Borsuk's Conjecture.
Electron. J. Comb., 2014

Counting Symmetric Nilpotent Matrices.
Electron. J. Comb., 2014

Cocliques in the Kneser graph on the point-hyperplane flags of a projective space.
Comb., 2014

2013
Counting Families of Mutually Intersecting Sets.
Electron. J. Comb., 2013

2012
Directed strongly regular graphs from -designs.
Eur. J. Comb., 2012

The generating rank of the space of short vectors in the Leech lattice mod 2.
Des. Codes Cryptogr., 2012

On the chromatic number of q-Kneser graphs.
Des. Codes Cryptogr., 2012

The graph with spectrum 141 240 (-4)10 (-6)9.
Des. Codes Cryptogr., 2012

Spectral characterization of a graph on the flags of the eleven point biplane.
Des. Codes Cryptogr., 2012

2011
Equivariant Gröbner bases and the Gaussian two-factor model.
Math. Comput., 2011

Some new distance-4 constant weight codes.
Adv. Math. Commun., 2011

2010
The invariants of the binary decimic.
J. Symb. Comput., 2010

The invariants of the binary nonic.
J. Symb. Comput., 2010

A Hilton-Milner Theorem for Vector Spaces.
Electron. J. Comb., 2010

2009
A construction of the sporadic Suzuki graph from U<sub>3</sub>(4).
J. Comb. Theory, Ser. A, 2009

The vertex-connectivity of a distance-regular graph.
Eur. J. Comb., 2009

Classification of the (0, 2)-graphs of valency 8.
Discret. Math., 2009

Cospectral Graphs on 12 Vertices.
Electron. J. Comb., 2009

2008
Tight bounds for break minimization in tournament scheduling.
J. Comb. Theory, Ser. A, 2008

Small Integral Trees.
Electron. J. Comb., 2008

2007
On 3-chromatic distance-regular graphs.
Des. Codes Cryptogr., 2007

2006
Classification of small (0, 2)-graphs.
J. Comb. Theory, Ser. A, 2006

Self-dual, not self-polar.
Discret. Math., 2006

2004
Small additive quaternary codes.
Eur. J. Comb., 2004

2003
Width and dual width of subsets in polynomial association schemes.
J. Comb. Theory, Ser. A, 2003

A Root Graph that is Locally the Line Graph of the Peterson Graph.
Discret. Math., 2003

The Universal Embedding Dimension of the Binary Symplectic Dual Polar Space.
Discret. Math., 2003

2002
The Hyperplanes of the M<sub>24</sub> Near Polygon.
Graphs Comb., 2002

2001
Error-Correcting Codes over an Alphabet of Four Elements.
Des. Codes Cryptogr., 2001

2000
Locally Paley Graphs.
Des. Codes Cryptogr., 2000

1999
An Associative Block Design ABD(8, 5).
SIAM J. Comput., 1999

On the Number of Slopes of the Graph of a Function Defined on a Finite Field.
J. Comb. Theory, Ser. A, 1999

The Universal Embedding Dimension of the Near Polygon on the 1-Factors of a Complete Graph.
Des. Codes Cryptogr., 1999

Doing More with Fewer Bits.
Proceedings of the Advances in Cryptology, 1999

1998
Bounds on Mixed Binary/Ternary Codes.
IEEE Trans. Inf. Theory, 1998

The Spectrum of the Second Subconstituent of the Bilinear Forms Graph H<sub>q</sub>(d, e).
Eur. J. Comb., 1998

1997
The vertex connectivity of a {0, 2}-graph equals its degree.
Discret. Math., 1997

Determination of the distance-regular graphs without 3-claws.
Discret. Math., 1997

The Correspondence between Projective Codes and 2-weight Codes.
Des. Codes Cryptogr., 1997

1996
There Exist Caps Which Block All Spaces of Fixed Codimension in G (n, 2).
J. Comb. Theory, Ser. A, 1996

1995
The Number of Directions Determined by a Function f on a Finite Field.
J. Comb. Theory, Ser. A, 1995

The complete list of maximal cliques of Quad(n, q), q odd.
Eur. J. Comb., 1995

Variations on a theme by Weetman.
Discret. Math., 1995

1994
A characterization of some graphs which do not contain 3-claws.
Discret. Math., 1994

On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group M<sub>12</sub>).
Discret. Math., 1994

1993
An updated table of minimum-distance bounds for binary linear codes.
IEEE Trans. Inf. Theory, 1993

The linear programming bound for binary linear codes.
IEEE Trans. Inf. Theory, 1993

The Gewirtz Graph: An Exercise in the Theory of Graph Spectra.
Eur. J. Comb., 1993

A new infinite series of regular uniformly geodetic code graphs.
Discret. Math., 1993

On complete regularity of extended codes.
Discret. Math., 1993

A Sharpening of the Johnson Bound for Binary Linear Codes and Nonexistence of Linear Codes with Preparata Parameters.
Des. Codes Cryptogr., 1993

1992
A new family of distance-regular graphs and the {0, 1, 2}-cliques in dual polar graphs.
Eur. J. Comb., 1992

Some 2-ranks.
Discret. Math., 1992

Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph.
Discret. Math., 1992

Locally K<sub>3, 3</sub> or Petersen graphs.
Discret. Math., 1992

1991
Hermitian unitals are code words.
Discret. Math., 1991

1990
A new table of constant weight codes.
IEEE Trans. Inf. Theory, 1990

Graphs with Odd Cocliques.
Eur. J. Comb., 1990

A note on completely regular codes.
Discret. Math., 1990

1989
Locally 4-by-4 grid graphs.
J. Graph Theory, 1989

A Remark on Association Schemes with Two P-polynomial Structures.
Eur. J. Comb., 1989

A unital in the hughes plane of order nine.
Discret. Math., 1989

Heden's bound on maximal partial spreads.
Discret. Math., 1989

Some new strongly regular graphs .
Comb., 1989

1988
A remark on partial linear spaces of girth 5 with an application to strongly regular graphs.
Comb., 1988

1987
Contractibility and NP-completeness.
J. Graph Theory, 1987

Orbits on points and lines in finite linear and quasilinear spaces.
J. Comb. Theory, Ser. A, 1987

1986
An Erdös-Ko-Rado theorem for regular intersecting families of octads.
Graphs Comb., 1986

Uniqueness and nonexistence of some graphs related to<i>M</i><sub>22</sub>.
Graphs Comb., 1986

An inequality in binary vector spaces.
Discret. Math., 1986

1985
The Connectivity of Strongly Regular Graphs.
Eur. J. Comb., 1985

Some new two-weight codes and strongly regular graphs.
Discret. Appl. Math., 1985

1984
A Symmetric Design with Parameters 2-(49, 16, 5).
J. Comb. Theory, Ser. A, 1984

Distance regular graphs of diameter 3 and strongly regular graphs.
Discret. Math., 1984

1983
On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code.
IEEE Trans. Inf. Theory, 1983

The uniqueness of the strongly regular graph on 77 points.
J. Graph Theory, 1983

Graphs whose neighborhoods have no special cycles.
Discret. Math., 1983

1982
A Note on 'Master Keys for Group Sharing'.
Inf. Process. Lett., 1982

More mutually orthogonal latin squares.
Discret. Math., 1982

The uniqueness of the near hexagon on 729 points.
Comb., 1982

1981
Subspaces of Linear Spaces of Line Size 4.
Eur. J. Comb., 1981

On the edge-colouring problem for unions of complete uniform hypergraphs.
Discret. Math., 1981

1980
On the (23, 14, 5) Wagner code (Corresp.).
IEEE Trans. Inf. Theory, 1980

A few new constant weight codes (Corresp.).
IEEE Trans. Inf. Theory, 1980

A Series of Separable Designs with Application to Pairwise Orthogonal Latin Squares.
Eur. J. Comb., 1980

1979
Optimal Packings of K<sub>4</sub>'s into a K<sub>n</sub>.
J. Comb. Theory, Ser. A, 1979

1978
Bounds for binary codes of length less than 25.
IEEE Trans. Inf. Theory, 1978

The Blocking Number of an Affine Space.
J. Comb. Theory, Ser. A, 1978

1977
Group divisible designs with block-size four.
Discret. Math., 1977

The triply shortened binary Hamming code is optimal.
Discret. Math., 1977


  Loading...