| 2011 | ||
|---|---|---|
| 63 | Andries E. Brouwer, Jan Draisma: Equivariant Gröbner bases and the Gaussian two-factor model. Math. Comput. 80(274): 1123-1133 (2011) | |
| 2010 | ||
| 62 | Aart Blokhuis, Andries E. Brouwer, A. Chowdhury, P. Frankl, T. Mussche, B. Patkós, Tamás Szönyi: A Hilton-Milner Theorem for Vector Spaces. Electr. J. Comb. 17(1): (2010) | |
| 61 | Andries E. Brouwer, Mihaela Popoviciu: The invariants of the binary nonic. J. Symb. Comput. 45(6): 709-720 (2010) | |
| 60 | Andries E. Brouwer, Mihaela Popoviciu: The invariants of the binary decimic. J. Symb. Comput. 45(8): 837-843 (2010) | |
| 2009 | ||
| 59 | Andries E. Brouwer, Patric R. J. Östergård: Classification of the (0, 2)-graphs of valency 8. Discrete Mathematics 309(3): 532-547 (2009) | |
| 58 | Andries E. Brouwer, Jack H. Koolen: The vertex-connectivity of a distance-regular graph. Eur. J. Comb. 30(3): 668-673 (2009) | |
| 57 | Andries E. Brouwer, Naoyuki Horiguchi, Masaaki Kitazume, Hiroyuki Nakasora: A construction of the sporadic Suzuki graph from U3(4). J. Comb. Theory, Ser. A 116(5): 1056-1062 (2009) | |
| 2008 | ||
| 56 | Andries E. Brouwer: Small Integral Trees. Electr. J. Comb. 15(1): (2008) | |
| 55 | Andries E. Brouwer, Gerhard F. Post, Gerhard J. Woeginger: Tight bounds for break minimization in tournament scheduling. J. Comb. Theory, Ser. A 115(6): 1065-1068 (2008) | |
| 2007 | ||
| 54 | Aart Blokhuis, Andries E. Brouwer, Willem H. Haemers: On 3-chromatic distance-regular graphs. Des. Codes Cryptography 44(1-3): 293-305 (2007) | |
| 2006 | ||
| 53 | Andries E. Brouwer, Alexander Schrijver, Haim Hanani: Group divisible designs with block-size four. Discrete Mathematics 306(10-11): 939-947 (2006) | |
| 52 | Andries E. Brouwer, Peter J. Cameron, Willem H. Haemers, Donald A. Preece: Self-dual, not self-polar. Discrete Mathematics 306(23): 3051-3053 (2006) | |
| 51 | Andries E. Brouwer: Classification of small (0, 2)-graphs. J. Comb. Theory, Ser. A 113(8): 1636-1645 (2006) | |
| 2004 | ||
| 50 | Aart Blokhuis, Andries E. Brouwer: Small additive quaternary codes. Eur. J. Comb. 25(2): 161-167 (2004) | |
| 2003 | ||
| 49 | Andries E. Brouwer, Jack H. Koolen, Mikhail H. Klin: A Root Graph that is Locally the Line Graph of the Peterson Graph. Discrete Mathematics 264(1-3): 13-24 (2003) | |
| 48 | Aart Blokhuis, Andries E. Brouwer: The Universal Embedding Dimension of the Binary Symplectic Dual Polar Space. Discrete Mathematics 264(1-3): 3-12 (2003) | |
| 47 | Andries E. Brouwer, C. D. Godsil, Jack H. Koolen, William J. Martin: Width and dual width of subsets in polynomial association schemes. J. Comb. Theory, Ser. A 102(2): 255-271 (2003) | |
| 2002 | ||
| 46 | Andries E. Brouwer, Hans Cuypers, Ernst Willem Lambeck: The Hyperplanes of the M24 Near Polygon. Graphs and Combinatorics 18(3): 415-420 (2002) | |
| 2001 | ||
| 45 | Galina T. Bogdanova, Andries E. Brouwer, Stoyan N. Kapralov, Patric R. J. Östergård: Error-Correcting Codes over an Alphabet of Four Elements. Des. Codes Cryptography 23(3): 333-342 (2001) | |
| 2000 | ||
| 44 | Andries E. Brouwer: Locally Paley Graphs. Des. Codes Cryptography 21(1/3): 69-76 (2000) | |
| 1999 | ||
| 43 | Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheul: Doing More with Fewer Bits. ASIACRYPT 1999: 321-332 | |
| 42 | Aart Blokhuis, Andries E. Brouwer: The Universal Embedding Dimension of the Near Polygon on the 1-Factors of a Complete Graph. Des. Codes Cryptography 17(1-3): 299-303 (1999) | |
| 41 | Aart Blokhuis, Simeon Ball, Andries E. Brouwer, Leo Storme, Tamás Szonyi: On the Number of Slopes of the Graph of a Function Defined on a Finite Field. J. Comb. Theory, Ser. A 86(1): 187-196 (1999) | |
| 40 | Andries E. Brouwer: An Associative Block Design ABD(8, 5). SIAM J. Comput. 28(6): 1970-1971 (1999) | |
| 1998 | ||
| 39 | Andries E. Brouwer, Remko Riebeek: The Spectrum of the Second Subconstituent of the Bilinear Forms Graph Hq(d, e). Eur. J. Comb. 19(3): 299-305 (1998) | |
| 38 | Andries E. Brouwer, Heikki O. Hämäläinen, Patric R. J. Östergård, Neil J. A. Sloane: Bounds on Mixed Binary/Ternary Codes. IEEE Transactions on Information Theory 44(1): 140-161 (1998) | |
| 1997 | ||
| 37 | Andries E. Brouwer, Marijn van Eupen: The Correspondence between Projective Codes and 2-weight Codes. Des. Codes Cryptography 11(3): 261-266 (1997) | |
| 36 | Aart Blokhuis, Andries E. Brouwer: Determination of the distance-regular graphs without 3-claws. Discrete Mathematics 163(1-3): 225-227 (1997) | |
| 35 | Andries E. Brouwer, H. M. Mulder: The vertex connectivity of a {0, 2}-graph equals its degree. Discrete Mathematics 169(1-3): 153-155 (1997) | |
| 1996 | ||
| 34 | Andries E. Brouwer, Aiden A. Bruen, David L. Wehlau: There Exist Caps Which Block All Spaces of Fixed Codimension in G (n, 2). J. Comb. Theory, Ser. A 73(1): 168-169 (1996) | |
| 1995 | ||
| 33 | Andries E. Brouwer: Variations on a theme by Weetman. Discrete Mathematics 138(1-3): 137-145 (1995) | |
| 32 | Aart Blokhuis, Andries E. Brouwer: The Number of Directions Determined by a Function f on a Finite Field. J. Comb. Theory, Ser. A 70(2): 349-353 (1995) | |
| 1994 | ||
| 31 | Andries E. Brouwer, Minoru Numata: A characterization of some graphs which do not contain 3-claws. Discrete Mathematics 124(1-3): 49-54 (1994) | |
| 30 | Andries E. Brouwer: On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group M12). Discrete Mathematics 126(1-3): 13-27 (1994) | |
| 1993 | ||
| 29 | Andries E. Brouwer, Ludo M. G. M. Tolhuizen: A Sharpening of the Johnson Bound for Binary Linear Codes and Nonexistence of Linear Codes with Preparata Parameters. Des. Codes Cryptography 3(2): 95-98 (1993) | |
| 28 | Andries E. Brouwer: On complete regularity of extended codes. Discrete Mathematics 117(1-3): 271-273 (1993) | |
| 27 | Andries E. Brouwer, Jacobus H. Koolen: A new infinite series of regular uniformly geodetic code graphs. Discrete Mathematics 120(1-3): 241-247 (1993) | |
| 26 | Andries E. Brouwer, Willem H. Haemers: The Gewirtz Graph: An Exercise in the Theory of Graph Spectra. Eur. J. Comb. 14(5): 397-407 (1993) | |
| 25 | Andries E. Brouwer, Tom Verhoeff: An updated table of minimum-distance bounds for binary linear codes. IEEE Transactions on Information Theory 39(2): 662-677 (1993) | |
| 24 | Andries E. Brouwer: The linear programming bound for binary linear codes. IEEE Transactions on Information Theory 39(2): 677-680 (1993) | |
| 1992 | ||
| 23 | Aart Blokhuis, Andries E. Brouwer: Locally K3, 3 or Petersen graphs. Discrete Mathematics 106-107: 53-60 (1992) | |
| 22 | Andries E. Brouwer, Willem H. Haemers: Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph. Discrete Mathematics 106-107: 77-82 (1992) | |
| 21 | Andries E. Brouwer, Henny A. Wilbrink, Willem H. Haemers: Some 2-ranks. Discrete Mathematics 106-107: 83-92 (1992) | |
| 1991 | ||
| 20 | Aart Blokhuis, Andries E. Brouwer, Henny A. Wilbrink: Hermitian unitals are code words. Discrete Mathematics 97(1-3): 63-68 (1991) | |
| 1990 | ||
| 19 | Andries E. Brouwer: A note on completely regular codes. Discrete Mathematics 83(1): 115-117 (1990) | |
| 18 | Andries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith: A new table of constant weight codes. IEEE Transactions on Information Theory 36(6): 1334-1380 (1990) | |
| 1989 | ||
| 17 | Andries E. Brouwer, A. V. Ivanov, Mikhail H. Klin: Some new strongly regular graphs . Combinatorica 9(4): 339-344 (1989) | |
| 16 | Aart Blokhuis, Andries E. Brouwer, Henny A. Wilbrink: Heden's bound on maximal partial spreads. Discrete Mathematics 74(3): 335-339 (1989) | |
| 15 | Andries E. Brouwer: A unital in the hughes plane of order nine. Discrete Mathematics 77(1-3): 55-56 (1989) | |
| 1988 | ||
| 14 | Andries E. Brouwer, Arnold Neumaier: A remark on partial linear spaces of girth 5 with an application to strongly regular graphs. Combinatorica 8(1): 57-61 (1988) | |
| 1987 | ||
| 13 | Aart Blokhuis, Andries E. Brouwer, Anne Delandtsheer, Jean Doyen: Orbits on points and lines in finite linear and quasilinear spaces. J. Comb. Theory, Ser. A 44(1): 159-163 (1987) | |
| 1986 | ||
| 12 | Andries E. Brouwer: An inequality in binary vector spaces. Discrete Mathematics 59(3): 315-317 (1986) | |
| 1984 | ||
| 11 | Andries E. Brouwer: Distance regular graphs of diameter 3 and strongly regular graphs. Discrete Mathematics 49(1): 101-103 (1984) | |
| 10 | Andries E. Brouwer, Henny A. Wilbrink: A Symmetric Design with Parameters 2-(49, 16, 5). J. Comb. Theory, Ser. A 37(2): 193-194 (1984) | |
| 1983 | ||
| 9 | Andries E. Brouwer, Pierre Duchet, Alexander Schrijver: Graphs whose neighborhoods have no special cycles. Discrete Mathematics 47: 177-182 (1983) | |
| 8 | Andries E. Brouwer: On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code. IEEE Transactions on Information Theory 29(3): 370-371 (1983) | |
| 1982 | ||
| 7 | Andries E. Brouwer: The uniqueness of the near hexagon on 729 points. Combinatorica 2(4): 333-340 (1982) | |
| 6 | Andries E. Brouwer, G. H. John van Rees: More mutually orthogonal latin squares. Discrete Mathematics 39(3): 263-281 (1982) | |
| 5 | Andries E. Brouwer, Peter van Emde Boas: A Note on `Master Keys for Group Sharing'. Inf. Process. Lett. 14(1): 12-14 (1982) | |
| 1981 | ||
| 4 | Andries E. Brouwer, Robert Tijdeman: On the edge-colouring problem for unions of complete uniform hypergraphs. Discrete Mathematics 34(3): 241-260 (1981) | |
| 1980 | ||
| 3 | Andries E. Brouwer: A few new constant weight codes (Corresp.). IEEE Transactions on Information Theory 26(3): 366 (1980) | |
| 1979 | ||
| 2 | Andries E. Brouwer: Optimal Packings of K4's into a Kn. J. Comb. Theory, Ser. A 26(3): 278-297 (1979) | |
| 1978 | ||
| 1 | Andries E. Brouwer, Alexander Schrijver: The Blocking Number of an Affine Space. J. Comb. Theory, Ser. A 24(2): 251-253 (1978) | |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page