default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndries E. Brouwer
Person information
- affiliation: Eindhoven University of Technology, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j104]Andries E. Brouwer, Dean Crnkovic, Andrea Svob
:
A construction of directed strongly regular graphs with parameters (63,11,8,1,2). Discret. Math. 347(1): 114146 (2024)- 2023
- [j103]Andries E. Brouwer, Ferdinand Ihringer, William M. Kantor:
Strongly Regular Graphs Satisfying the 4-Vertex Condition. Comb. 43(2): 257-276 (2023) - [j102]Andries E. Brouwer:
The Equivalence of Two Inequalities for Quasisymmetric Designs. Electron. J. Comb. 30(1) (2023) - 2022
- [j101]Andries E. Brouwer, William J. Martin:
Triple intersection numbers for the Paley graphs. Finite Fields Their Appl. 80: 102010 (2022)
2010 – 2019
- 2019
- [j100]Andries E. Brouwer, Sven C. Polak:
Uniqueness of codes using semidefinite programming. Des. Codes Cryptogr. 87(8): 1881-1895 (2019) - 2018
- [j99]Andries E. Brouwer, Sebastian M. Cioaba, Ferdinand Ihringer, Matt McGinnis:
The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. J. Comb. Theory B 133: 88-121 (2018) - [j98]Andries E. Brouwer, J. Daniel Christensen:
Counterexamples to Conjectures About Subset Takeaway and Counting Linear Extensions of a Boolean Lattice. Order 35(2): 275-281 (2018) - 2017
- [j97]Aart Blokhuis, Andries E. Brouwer:
Cocliques in the Kneser graph on line-plane flags in PG(4;q). Comb. 37(5): 795-804 (2017) - [j96]Aart Blokhuis, Andries E. Brouwer, Benne de Weger:
Binomial Collisions and Near Collisions. Integers 17: A64 (2017) - [i2]Andries E. Brouwer, J. Daniel Christensen:
Counterexamples to conjectures about Subset Takeaway and counting linear extensions of a Boolean lattice. CoRR abs/1702.03018 (2017) - [i1]Andries E. Brouwer, Sebastian M. Cioaba, Ferdinand Ihringer, Matt McGinnis:
The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters. CoRR abs/1709.09011 (2017) - 2016
- [j95]Andries E. Brouwer, Supalak Sumalroj, Chalermpong Worawannotai:
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. 66: 330-332 (2016) - 2015
- [j94]Andries E. Brouwer, Jan Draisma, Bart J. Frenk:
Lossy Gossip and Composition of Metrics. Discret. Comput. Geom. 53(4): 890-913 (2015) - [j93]Aart Blokhuis, Andries E. Brouwer, Dieter Jungnickel, Vedran Krcadinac, Sara Rottey, Leo Storme, Tamás Szonyi, Peter Vandendriessche:
Blocking sets of the classical unital. Finite Fields Their Appl. 35: 1-15 (2015) - 2014
- [j92]Aart Blokhuis, Andries E. Brouwer, Çiçek Güven:
Cocliques in the Kneser graph on the point-hyperplane flags of a projective space. Comb. 34(1): 1-10 (2014) - [j91]Andries E. Brouwer, Rod Gow, John Sheekey:
Counting Symmetric Nilpotent Matrices. Electron. J. Comb. 21(2): 2 (2014) - [j90]Thomas Jenrich, Andries E. Brouwer:
A 64-Dimensional Counterexample to Borsuk's Conjecture. Electron. J. Comb. 21(4): 4 (2014) - [j89]Aart Blokhuis, Andries E. Brouwer, Attila Sali:
Note on the size of binary Armstrong codes. Des. Codes Cryptogr. 71(1): 1-4 (2014) - [j88]Aart Blokhuis, Andries E. Brouwer, Tamás Szonyi:
Maximal cocliques in the Kneser graph on point-plane flags in PG(4, q). Eur. J. Comb. 35: 95-104 (2014) - 2013
- [j87]Andries E. Brouwer, C. F. Mills, W. H. Mills, A. Verbeek:
Counting Families of Mutually Intersecting Sets. Electron. J. Comb. 20(2): 8 (2013) - 2012
- [j86]Aart Blokhuis, Andries E. Brouwer:
Spectral characterization of a graph on the flags of the eleven point biplane. Des. Codes Cryptogr. 65(1-2): 65-69 (2012) - [j85]Aart Blokhuis, Andries E. Brouwer, Willem H. Haemers:
The graph with spectrum 141 240 (-4)10 (-6)9. Des. Codes Cryptogr. 65(1-2): 71-75 (2012) - [j84]Andries E. Brouwer, Çiçek Güven:
The generating rank of the space of short vectors in the Leech lattice mod 2. Des. Codes Cryptogr. 65(1-2): 107-113 (2012) - [j83]Aart Blokhuis, Andries E. Brouwer, Tamás Szonyi:
On the chromatic number of q-Kneser graphs. Des. Codes Cryptogr. 65(3): 187-197 (2012) - [j82]Andries E. Brouwer, Oktay Olmez, Sung-Yell Song:
Directed strongly regular graphs from -designs. Eur. J. Comb. 33(6): 1174-1177 (2012) - 2011
- [j81]Andries E. Brouwer, Tuvi Etzion:
Some new distance-4 constant weight codes. Adv. Math. Commun. 5(3): 417-424 (2011) - [j80]Andries E. Brouwer, Jan Draisma:
Equivariant Gröbner bases and the Gaussian two-factor model. Math. Comput. 80(274): 1123-1133 (2011) - 2010
- [j79]Aart Blokhuis, Andries E. Brouwer, Ameera Chowdhury, Peter Frankl, T. Mussche, Balázs Patkós, Tamás Szönyi:
A Hilton-Milner Theorem for Vector Spaces. Electron. J. Comb. 17(1) (2010) - [j78]Andries E. Brouwer, Mihaela Popoviciu:
The invariants of the binary nonic. J. Symb. Comput. 45(6): 709-720 (2010) - [j77]Andries E. Brouwer, Mihaela Popoviciu:
The invariants of the binary decimic. J. Symb. Comput. 45(8): 837-843 (2010)
2000 – 2009
- 2009
- [j76]Andries E. Brouwer, Edward Spence:
Cospectral Graphs on 12 Vertices. Electron. J. Comb. 16(1) (2009) - [j75]Andries E. Brouwer, Patric R. J. Östergård:
Classification of the (0, 2)-graphs of valency 8. Discret. Math. 309(3): 532-547 (2009) - [j74]Andries E. Brouwer, Jack H. Koolen:
The vertex-connectivity of a distance-regular graph. Eur. J. Comb. 30(3): 668-673 (2009) - [j73]Andries E. Brouwer, Naoyuki Horiguchi, Masaaki Kitazume, Hiroyuki Nakasora:
A construction of the sporadic Suzuki graph from U3(4). J. Comb. Theory A 116(5): 1056-1062 (2009) - 2008
- [j72]Andries E. Brouwer:
Small Integral Trees. Electron. J. Comb. 15(1) (2008) - [j71]Andries E. Brouwer, Gerhard F. Post, Gerhard J. Woeginger:
Tight bounds for break minimization in tournament scheduling. J. Comb. Theory A 115(6): 1065-1068 (2008) - 2007
- [j70]Aart Blokhuis, Andries E. Brouwer, Willem H. Haemers:
On 3-chromatic distance-regular graphs. Des. Codes Cryptogr. 44(1-3): 293-305 (2007) - 2006
- [j69]Andries E. Brouwer, Alexander Schrijver, Haim Hanani:
Group divisible designs with block-size four. Discret. Math. 306(10-11): 939-947 (2006) - [j68]Andries E. Brouwer, Peter J. Cameron, Willem H. Haemers, Donald A. Preece:
Self-dual, not self-polar. Discret. Math. 306(23): 3051-3053 (2006) - [j67]Andries E. Brouwer:
Classification of small (0, 2)-graphs. J. Comb. Theory A 113(8): 1636-1645 (2006) - 2004
- [j66]Aart Blokhuis, Andries E. Brouwer:
Small additive quaternary codes. Eur. J. Comb. 25(2): 161-167 (2004) - 2003
- [j65]Aart Blokhuis, Andries E. Brouwer:
The Universal Embedding Dimension of the Binary Symplectic Dual Polar Space. Discret. Math. 264(1-3): 3-12 (2003) - [j64]Andries E. Brouwer, Jack H. Koolen, Mikhail H. Klin:
A Root Graph that is Locally the Line Graph of the Peterson Graph. Discret. Math. 264(1-3): 13-24 (2003) - [j63]Andries E. Brouwer, Chris D. Godsil, Jack H. Koolen, William J. Martin:
Width and dual width of subsets in polynomial association schemes. J. Comb. Theory A 102(2): 255-271 (2003) - 2002
- [j62]Andries E. Brouwer, Hans Cuypers, Ernst Willem Lambeck:
The Hyperplanes of the M24 Near Polygon. Graphs Comb. 18(3): 415-420 (2002) - 2001
- [j61]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 Cryptogr. 23(3): 333-342 (2001) - 2000
- [j60]Andries E. Brouwer:
Locally Paley Graphs. Des. Codes Cryptogr. 21(1/3): 69-76 (2000)
1990 – 1999
- 1999
- [j59]Aart Blokhuis, Andries E. Brouwer:
The Universal Embedding Dimension of the Near Polygon on the 1-Factors of a Complete Graph. Des. Codes Cryptogr. 17(1-3): 299-303 (1999) - [j58]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 A 86(1): 187-196 (1999) - [j57]Andries E. Brouwer:
An Associative Block Design ABD(8, 5). SIAM J. Comput. 28(6): 1970-1971 (1999) - [c1]Andries E. Brouwer, Ruud Pellikaan, Eric R. Verheul:
Doing More with Fewer Bits. ASIACRYPT 1999: 321-332 - 1998
- [j56]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) - [j55]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 Trans. Inf. Theory 44(1): 140-161 (1998) - 1997
- [j54]Andries E. Brouwer, Marijn van Eupen:
The Correspondence between Projective Codes and 2-weight Codes. Des. Codes Cryptogr. 11(3): 261-266 (1997) - [j53]Aart Blokhuis, Andries E. Brouwer:
Determination of the distance-regular graphs without 3-claws. Discret. Math. 163(1-3): 225-227 (1997) - [j52]Andries E. Brouwer, Henry Martyn Mulder:
The vertex connectivity of a {0, 2}-graph equals its degree. Discret. Math. 169(1-3): 153-155 (1997) - 1996
- [j51]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 A 73(1): 168-169 (1996) - 1995
- [j50]Andries E. Brouwer:
Variations on a theme by Weetman. Discret. Math. 138(1-3): 137-145 (1995) - [j49]Andries E. Brouwer, Joe Hemmeter, Andrew J. Woldar:
The complete list of maximal cliques of Quad(n, q), q odd. Eur. J. Comb. 16(2): 107-110 (1995) - [j48]Aart Blokhuis, Andries E. Brouwer:
The Number of Directions Determined by a Function f on a Finite Field. J. Comb. Theory A 70(2): 349-353 (1995) - 1994
- [j47]Andries E. Brouwer, Minoru Numata:
A characterization of some graphs which do not contain 3-claws. Discret. Math. 124(1-3): 49-54 (1994) - [j46]Andries E. Brouwer:
On the uniqueness of a regular thin near octagon on 288 vertices (or the semibiplane belonging to the Mathieu group M12). Discret. Math. 126(1-3): 13-27 (1994) - 1993
- [j45]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 Cryptogr. 3(2): 95-98 (1993) - [j44]Andries E. Brouwer:
On complete regularity of extended codes. Discret. Math. 117(1-3): 271-273 (1993) - [j43]Andries E. Brouwer, Jacobus H. Koolen:
A new infinite series of regular uniformly geodetic code graphs. Discret. Math. 120(1-3): 241-247 (1993) - [j42]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) - [j41]Andries E. Brouwer, Tom Verhoeff:
An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inf. Theory 39(2): 662-677 (1993) - [j40]Andries E. Brouwer:
The linear programming bound for binary linear codes. IEEE Trans. Inf. Theory 39(2): 677-680 (1993) - 1992
- [j39]Aart Blokhuis, Andries E. Brouwer:
Locally K3, 3 or Petersen graphs. Discret. Math. 106-107: 53-60 (1992) - [j38]Andries E. Brouwer, Willem H. Haemers:
Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph. Discret. Math. 106-107: 77-82 (1992) - [j37]Andries E. Brouwer, Henny A. Wilbrink, Willem H. Haemers:
Some 2-ranks. Discret. Math. 106-107: 83-92 (1992) - [j36]Joe Hemmeter, Andries E. Brouwer:
A new family of distance-regular graphs and the {0, 1, 2}-cliques in dual polar graphs. Eur. J. Comb. 13(2): 71-79 (1992) - 1991
- [j35]Aart Blokhuis, Andries E. Brouwer, Henny A. Wilbrink:
Hermitian unitals are code words. Discret. Math. 97(1-3): 63-68 (1991) - 1990
- [j34]Andries E. Brouwer:
A note on completely regular codes. Discret. Math. 83(1): 115-117 (1990) - [j33]Andries E. Brouwer, Ernest E. Shult:
Graphs with Odd Cocliques. Eur. J. Comb. 11(2): 99-104 (1990) - [j32]Andries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith:
A new table of constant weight codes. IEEE Trans. Inf. Theory 36(6): 1334-1380 (1990)
1980 – 1989
- 1989
- [j31]Andries E. Brouwer, A. V. Ivanov, Mikhail H. Klin:
Some new strongly regular graphs . Comb. 9(4): 339-344 (1989) - [j30]Aart Blokhuis, Andries E. Brouwer, Henny A. Wilbrink:
Heden's bound on maximal partial spreads. Discret. Math. 74(3): 335-339 (1989) - [j29]Andries E. Brouwer:
A unital in the hughes plane of order nine. Discret. Math. 77(1-3): 55-56 (1989) - [j28]Andries E. Brouwer:
A Remark on Association Schemes with Two P-polynomial Structures. Eur. J. Comb. 10(6): 523-526 (1989) - [j27]Aart Blokhuis, Andries E. Brouwer:
Locally 4-by-4 grid graphs. J. Graph Theory 13(2): 229-244 (1989) - 1988
- [j26]Andries E. Brouwer, Arnold Neumaier:
A remark on partial linear spaces of girth 5 with an application to strongly regular graphs. Comb. 8(1): 57-61 (1988) - 1987
- [j25]Aart Blokhuis, Andries E. Brouwer, Anne Delandtsheer, Jean Doyen:
Orbits on points and lines in finite linear and quasilinear spaces. J. Comb. Theory A 44(1): 159-163 (1987) - [j24]Andries E. Brouwer, Henk Jan Veldman:
Contractibility and NP-completeness. J. Graph Theory 11(1): 71-79 (1987) - 1986
- [j23]Andries E. Brouwer:
An inequality in binary vector spaces. Discret. Math. 59(3): 315-317 (1986) - [j22]Andries E. Brouwer:
Uniqueness and nonexistence of some graphs related toM22. Graphs Comb. 2(1): 21-29 (1986) - [j21]Andries E. Brouwer, A. Robert Calderbank:
An Erdös-Ko-Rado theorem for regular intersecting families of octads. Graphs Comb. 2(1): 309-316 (1986) - 1985
- [j20]Andries E. Brouwer:
Some new two-weight codes and strongly regular graphs. Discret. Appl. Math. 10(1): 111-114 (1985) - [j19]Andries E. Brouwer, Dale M. Mesner:
The Connectivity of Strongly Regular Graphs. Eur. J. Comb. 6(3): 215-216 (1985) - 1984
- [j18]Andries E. Brouwer:
Distance regular graphs of diameter 3 and strongly regular graphs. Discret. Math. 49(1): 101-103 (1984) - [j17]Andries E. Brouwer, Henny A. Wilbrink:
A Symmetric Design with Parameters 2-(49, 16, 5). J. Comb. Theory A 37(2): 193-194 (1984) - 1983
- [j16]Andries E. Brouwer, Pierre Duchet, Alexander Schrijver:
Graphs whose neighborhoods have no special cycles. Discret. Math. 47: 177-182 (1983) - [j15]Andries E. Brouwer:
The uniqueness of the strongly regular graph on 77 points. J. Graph Theory 7(4): 455-461 (1983) - [j14]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 Trans. Inf. Theory 29(3): 370-371 (1983) - 1982
- [j13]Andries E. Brouwer:
The uniqueness of the near hexagon on 729 points. Comb. 2(4): 333-340 (1982) - [j12]Andries E. Brouwer, G. H. John van Rees:
More mutually orthogonal latin squares. Discret. Math. 39(3): 263-281 (1982) - [j11]Andries E. Brouwer, Peter van Emde Boas:
A Note on 'Master Keys for Group Sharing'. Inf. Process. Lett. 14(1): 12-14 (1982) - 1981
- [j10]Andries E. Brouwer, Robert Tijdeman:
On the edge-colouring problem for unions of complete uniform hypergraphs. Discret. Math. 34(3): 241-260 (1981) - [j9]Andries E. Brouwer, Hanfried Lenz:
Subspaces of Linear Spaces of Line Size 4. Eur. J. Comb. 2(4): 323-330 (1981) - 1980
- [j8]Andries E. Brouwer:
A Series of Separable Designs with Application to Pairwise Orthogonal Latin Squares. Eur. J. Comb. 1(1): 39-41 (1980) - [j7]Andries E. Brouwer:
A few new constant weight codes (Corresp.). IEEE Trans. Inf. Theory 26(3): 366 (1980) - [j6]Andries E. Brouwer, Philippe Delsarte, Philippe Piret:
On the (23, 14, 5) Wagner code (Corresp.). IEEE Trans. Inf. Theory 26(6): 742-743 (1980)
1970 – 1979
- 1979
- [j5]Andries E. Brouwer:
Optimal Packings of K4's into a Kn. J. Comb. Theory A 26(3): 278-297 (1979) - 1978
- [j4]Andries E. Brouwer, Alexander Schrijver:
The Blocking Number of an Affine Space. J. Comb. Theory A 24(2): 251-253 (1978) - [j3]Marc R. Best, Andries E. Brouwer, F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane:
Bounds for binary codes of length less than 25. IEEE Trans. Inf. Theory 24(1): 81-93 (1978) - 1977
- [j2]Marc R. Best, Andries E. Brouwer:
The triply shortened binary Hamming code is optimal. Discret. Math. 17(3): 235-245 (1977) - [j1]Andries E. Brouwer, Alexander Schrijver, Haim Hanani:
Group divisible designs with block-size four. Discret. Math. 20: 1-10 (1977)
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-07-20 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
