The triply shortened binary Hamming code is optimal. - Marc R. Best; Andries E. Brouwer (Discret. Math., 1977)

Group divisible designs with block-size four. - Andries E. Brouwer; Alexander Schrijver; Haim Hanani (Discret. Math., 1977)

The Blocking Number of an Affine Space. - Andries E. Brouwer; Alexander Schrijver (J. Comb. Theory A, 1978)

Bounds for binary codes of length less than 25. - Marc R. Best; Andries E. Brouwer; F. Jessie MacWilliams; Andrew M. Odlyzko; Neil J. A. Sloane (IEEE Trans. Inf. Theory, 1978)

Optimal Packings of K4's into a Kn. - Andries E. Brouwer (J. Comb. Theory A, 1979)

A Series of Separable Designs with Application to Pairwise Orthogonal Latin Squares. - Andries E. Brouwer (Eur. J. Comb., 1980)

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

On the (23, 14, 5) Wagner code (Corresp.). - Andries E. Brouwer; Philippe Delsarte; Philippe Piret (IEEE Trans. Inf. Theory, 1980)

On the edge-colouring problem for unions of complete uniform hypergraphs. - Andries E. Brouwer; Robert Tijdeman (Discret. Math., 1981)

Subspaces of Linear Spaces of Line Size 4. - Andries E. Brouwer; Hanfried Lenz (Eur. J. Comb., 1981)

The uniqueness of the near hexagon on 729 points. - Andries E. Brouwer (Comb., 1982)

More mutually orthogonal latin squares. - Andries E. Brouwer; G. H. John van Rees (Discret. Math., 1982)

A Note on 'Master Keys for Group Sharing'. - Andries E. Brouwer; Peter van Emde Boas (Inf. Process. Lett., 1982)

Graphs whose neighborhoods have no special cycles. - Andries E. Brouwer; Pierre Duchet; Alexander Schrijver (Discret. Math., 1983)

The uniqueness of the strongly regular graph on 77 points. - Andries E. Brouwer (J. Graph Theory, 1983)

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

Distance regular graphs of diameter 3 and strongly regular graphs. - Andries E. Brouwer (Discret. Math., 1984)

A Symmetric Design with Parameters 2-(49, 16, 5). - Andries E. Brouwer; Henny A. Wilbrink (J. Comb. Theory A, 1984)

Some new two-weight codes and strongly regular graphs. - Andries E. Brouwer (Discret. Appl. Math., 1985)

The Connectivity of Strongly Regular Graphs. - Andries E. Brouwer; Dale M. Mesner (Eur. J. Comb., 1985)

An inequality in binary vector spaces. - Andries E. Brouwer (Discret. Math., 1986)

Uniqueness and nonexistence of some graphs related toM22. - Andries E. Brouwer (Graphs Comb., 1986)

An Erdös-Ko-Rado theorem for regular intersecting families of octads. - Andries E. Brouwer; A. Robert Calderbank (Graphs Comb., 1986)

Orbits on points and lines in finite linear and quasilinear spaces. - Aart Blokhuis; Andries E. Brouwer; Anne Delandtsheer; Jean Doyen (J. Comb. Theory A, 1987)

Contractibility and NP-completeness. - Andries E. Brouwer; Henk Jan Veldman (J. Graph Theory, 1987)

A remark on partial linear spaces of girth 5 with an application to strongly regular graphs. - Andries E. Brouwer; Arnold Neumaier (Comb., 1988)

Some new strongly regular graphs . - Andries E. Brouwer; A. V. Ivanov; Mikhail H. Klin (Comb., 1989)

Heden's bound on maximal partial spreads. - Aart Blokhuis; Andries E. Brouwer; Henny A. Wilbrink (Discret. Math., 1989)

A unital in the hughes plane of order nine. - Andries E. Brouwer (Discret. Math., 1989)

A Remark on Association Schemes with Two P-polynomial Structures. - Andries E. Brouwer (Eur. J. Comb., 1989)

Locally 4-by-4 grid graphs. - Aart Blokhuis; Andries E. Brouwer (J. Graph Theory, 1989)

A note on completely regular codes. - Andries E. Brouwer (Discret. Math., 1990)

Graphs with Odd Cocliques. - Andries E. Brouwer; Ernest E. Shult (Eur. J. Comb., 1990)

A new table of constant weight codes. - Andries E. Brouwer; James B. Shearer; Neil J. A. Sloane; Warren D. Smith (IEEE Trans. Inf. Theory, 1990)

Hermitian unitals are code words. - Aart Blokhuis; Andries E. Brouwer; Henny A. Wilbrink (Discret. Math., 1991)

Locally K3, 3 or Petersen graphs. - Aart Blokhuis; Andries E. Brouwer (Discret. Math., 1992)

Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph. - Andries E. Brouwer; Willem H. Haemers (Discret. Math., 1992)

Some 2-ranks. - Andries E. Brouwer; Henny A. Wilbrink; Willem H. Haemers (Discret. Math., 1992)

A new family of distance-regular graphs and the {0, 1, 2}-cliques in dual polar graphs. - Joe Hemmeter; Andries E. Brouwer (Eur. J. Comb., 1992)

A Sharpening of the Johnson Bound for Binary Linear Codes and Nonexistence of Linear Codes with Preparata Parameters. - Andries E. Brouwer; Ludo M. G. M. Tolhuizen (Des. Codes Cryptogr., 1993)

On complete regularity of extended codes. - Andries E. Brouwer (Discret. Math., 1993)

A new infinite series of regular uniformly geodetic code graphs. - Andries E. Brouwer; Jacobus H. Koolen (Discret. Math., 1993)

The Gewirtz Graph: An Exercise in the Theory of Graph Spectra. - Andries E. Brouwer; Willem H. Haemers (Eur. J. Comb., 1993)

The linear programming bound for binary linear codes. - Andries E. Brouwer (IEEE Trans. Inf. Theory, 1993)

An updated table of minimum-distance bounds for binary linear codes. - Andries E. Brouwer; Tom Verhoeff (IEEE Trans. Inf. Theory, 1993)

On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group M12). - Andries E. Brouwer (Discret. Math., 1994)

A characterization of some graphs which do not contain 3-claws. - Andries E. Brouwer; Minoru Numata (Discret. Math., 1994)

Variations on a theme by Weetman. - Andries E. Brouwer (Discret. Math., 1995)

The complete list of maximal cliques of Quad(n, q), q odd. - Andries E. Brouwer; Joe Hemmeter; Andrew J. Woldar (Eur. J. Comb., 1995)

The Number of Directions Determined by a Function f on a Finite Field. - Aart Blokhuis; Andries E. Brouwer (J. Comb. Theory A, 1995)

There Exist Caps Which Block All Spaces of Fixed Codimension in G (n, 2). - Andries E. Brouwer; Aiden A. Bruen; David L. Wehlau (J. Comb. Theory A, 1996)

The Correspondence between Projective Codes and 2-weight Codes. - Andries E. Brouwer; Marijn van Eupen (Des. Codes Cryptogr., 1997)

Determination of the distance-regular graphs without 3-claws. - Aart Blokhuis; Andries E. Brouwer (Discret. Math., 1997)

The vertex connectivity of a {0, 2}-graph equals its degree. - Andries E. Brouwer; Henry Martyn Mulder (Discret. Math., 1997)

The Spectrum of the Second Subconstituent of the Bilinear Forms Graph Hq(d, e). - Andries E. Brouwer; Remko Riebeek (Eur. J. Comb., 1998)

Bounds on Mixed Binary/Ternary Codes. - Andries E. Brouwer; Heikki O. Hämäläinen; Patric R. J. Östergård; Neil J. A. Sloane (IEEE Trans. Inf. Theory, 1998)

Doing More with Fewer Bits. - Andries E. Brouwer; Ruud Pellikaan; Eric R. Verheul (ASIACRYPT, 1999)

The Universal Embedding Dimension of the Near Polygon on the 1-Factors of a Complete Graph. - Aart Blokhuis; Andries E. Brouwer (Des. Codes Cryptogr., 1999)

On the Number of Slopes of the Graph of a Function Defined on a Finite Field. - Aart Blokhuis; Simeon Ball; Andries E. Brouwer; Leo Storme; Tamás Szonyi (J. Comb. Theory A, 1999)

An Associative Block Design ABD(8, 5). - Andries E. Brouwer (SIAM J. Comput., 1999)

Locally Paley Graphs. - Andries E. Brouwer (Des. Codes Cryptogr., 2000)

Error-Correcting Codes over an Alphabet of Four Elements. - Galina T. Bogdanova; Andries E. Brouwer; Stoyan N. Kapralov; Patric R. J. Östergård (Des. Codes Cryptogr., 2001)

The Hyperplanes of the M24 Near Polygon. - Andries E. Brouwer; Hans Cuypers; Ernst Willem Lambeck (Graphs Comb., 2002)

The Universal Embedding Dimension of the Binary Symplectic Dual Polar Space. - Aart Blokhuis; Andries E. Brouwer (Discret. Math., 2003)

A Root Graph that is Locally the Line Graph of the Peterson Graph. - Andries E. Brouwer; Jack H. Koolen; Mikhail H. Klin (Discret. Math., 2003)

Width and dual width of subsets in polynomial association schemes. - Andries E. Brouwer; Chris D. Godsil; Jack H. Koolen; William J. Martin (J. Comb. Theory A, 2003)

Small additive quaternary codes. - Aart Blokhuis; Andries E. Brouwer (Eur. J. Comb., 2004)

Self-dual, not self-polar. - Andries E. Brouwer; Peter J. Cameron; Willem H. Haemers; Donald A. Preece (Discret. Math., 2006)

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

On 3-chromatic distance-regular graphs. - Aart Blokhuis; Andries E. Brouwer; Willem H. Haemers (Des. Codes Cryptogr., 2007)

Small Integral Trees. - Andries E. Brouwer (Electron. J. Comb., 2008)

Tight bounds for break minimization in tournament scheduling. - Andries E. Brouwer; Gerhard F. Post; Gerhard J. Woeginger (J. Comb. Theory A, 2008)

Cospectral Graphs on 12 Vertices. - Andries E. Brouwer; Edward Spence (Electron. J. Comb., 2009)

Classification of the (0, 2)-graphs of valency 8. - Andries E. Brouwer; Patric R. J. Östergård (Discret. Math., 2009)

The vertex-connectivity of a distance-regular graph. - Andries E. Brouwer; Jack H. Koolen (Eur. J. Comb., 2009)

A construction of the sporadic Suzuki graph from U3(4). - Andries E. Brouwer; Naoyuki Horiguchi; Masaaki Kitazume; Hiroyuki Nakasora (J. Comb. Theory A, 2009)

A Hilton-Milner Theorem for Vector Spaces. - Aart Blokhuis; Andries E. Brouwer; Ameera Chowdhury; Peter Frankl; T. Mussche; Balázs Patkós; Tamás Szönyi (Electron. J. Comb., 2010)

The invariants of the binary nonic. - Andries E. Brouwer; Mihaela Popoviciu (J. Symb. Comput., 2010)

The invariants of the binary decimic. - Andries E. Brouwer; Mihaela Popoviciu (J. Symb. Comput., 2010)

Some new distance-4 constant weight codes. - Andries E. Brouwer; Tuvi Etzion (Adv. Math. Commun., 2011)

Equivariant Gröbner bases and the Gaussian two-factor model. - Andries E. Brouwer; Jan Draisma (Math. Comput., 2011)

Spectral characterization of a graph on the flags of the eleven point biplane. - Aart Blokhuis; Andries E. Brouwer (Des. Codes Cryptogr., 2012)

The graph with spectrum 141 240 (-4)10 (-6)9. - Aart Blokhuis; Andries E. Brouwer; Willem H. Haemers (Des. Codes Cryptogr., 2012)

On the chromatic number of q-Kneser graphs. - Aart Blokhuis; Andries E. Brouwer; Tamás Szonyi (Des. Codes Cryptogr., 2012)

The generating rank of the space of short vectors in the Leech lattice mod 2. - Andries E. Brouwer; Çiçek Güven (Des. Codes Cryptogr., 2012)

Directed strongly regular graphs from -designs. - Andries E. Brouwer; Oktay Olmez; Sung-Yell Song (Eur. J. Comb., 2012)

Counting Families of Mutually Intersecting Sets. - Andries E. Brouwer; C. F. Mills; W. H. Mills; A. Verbeek (Electron. J. Comb., 2013)

Cocliques in the Kneser graph on the point-hyperplane flags of a projective space. - Aart Blokhuis; Andries E. Brouwer; Çiçek Güven (Comb., 2014)

Counting Symmetric Nilpotent Matrices. - Andries E. Brouwer; Rod Gow; John Sheekey (Electron. J. Comb., 2014)

A 64-Dimensional Counterexample to Borsuk's Conjecture. - Thomas Jenrich; Andries E. Brouwer (Electron. J. Comb., 2014)

Note on the size of binary Armstrong codes. - Aart Blokhuis; Andries E. Brouwer; Attila Sali (Des. Codes Cryptogr., 2014)

Maximal cocliques in the Kneser graph on point-plane flags in PG(4, q). - Aart Blokhuis; Andries E. Brouwer; Tamás Szonyi (Eur. J. Comb., 2014)

Lossy Gossip and Composition of Metrics. - Andries E. Brouwer; Jan Draisma; Bart J. Frenk (Discret. Comput. Geom., 2015)

Blocking sets of the classical unital. - Aart Blokhuis; Andries E. Brouwer; Dieter Jungnickel; Vedran Krcadinac; Sara Rottey; Leo Storme; Tamás Szonyi; Peter Vandendriessche (Finite Fields Their Appl., 2015)

The nonexistence of distance-regular graphs with intersection arrays {27, 20, 10;1, 2, 18} and {36, 28, 4;1, 2, 24}. - Andries E. Brouwer; Supalak Sumalroj; Chalermpong Worawannotai (Australas. J Comb., 2016)

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

Binomial Collisions and Near Collisions. - Aart Blokhuis; Andries E. Brouwer; Benne de Weger (Integers, 2017)

The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. - Andries E. Brouwer; Sebastian M. Cioaba; Ferdinand Ihringer; Matt McGinnis (J. Comb. Theory B, 2018)

Counterexamples to Conjectures About Subset Takeaway and Counting Linear Extensions of a Boolean Lattice. - Andries E. Brouwer; J. Daniel Christensen (Order, 2018)

Uniqueness of codes using semidefinite programming. - Andries E. Brouwer; Sven C. Polak (Des. Codes Cryptogr., 2019)

Triple intersection numbers for the Paley graphs. - Andries E. Brouwer; William J. Martin (Finite Fields Their Appl., 2022)

The Equivalence of Two Inequalities for Quasisymmetric Designs. - Andries E. Brouwer (Electron. J. Comb., 2023)

Strongly Regular Graphs Satisfying the 4-Vertex Condition. - Andries E. Brouwer; Ferdinand Ihringer; William M. Kantor (Comb., 2023)

Some Locally Kneser Graphs. - Andries E. Brouwer (Electron. J. Comb., 2024)

A construction of directed strongly regular graphs with parameters (63,11,8,1,2). - Andries E. Brouwer; Dean Crnkovic; Andrea Svob (Discret. Math., 2024)