VLDB 2026 Research / reviewers in the wild / expert
Bart De Bruyn
dblp:19/375
· DBLP profile ↗
22ranked-venue papers
18as first author
10since 2021 · last 2026
0000-0003-4941-7934ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 20 · 16 first-author · 10 since 2021Theory of computation · 2 · 2 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Polygonal triples
Bart De Bruyn |
Des. Codes Cryptogr. | 1 |
| 2026 | Divisible design graphs obtained by plugging a difference set into a construction for antipodal distance-regular graphs of diameter 3
Bart De Bruyn, Sergey Goryainov, Ruilin Ma, Ruihan Xie |
Des. Codes Cryptogr. | 1 |
| 2026 | Binary code generated by the hyperbolic quadrics of W(2n-1,q),q even
Devjyoti Das, Bart De Bruyn, Binod Kumar Sahoo, N. S. Narasimha Sastry |
Des. Codes Cryptogr. | 2 |
| 2025 | Families of quadratic sets on the Klein quadric
Bart De Bruyn |
Des. Codes Cryptogr. | 1 |
| 2025 | Divisible design graphs from the symplectic graph
Bart De Bruyn, Sergey Goryainov, Willem H. Haemers, Leonid Shalaginov |
Des. Codes Cryptogr. | 1 |
| 2025 | The homogeneous pseudo-embeddings of rmPG(2,8)
Bart De Bruyn, Mou Gao, Dibyayoti Jena |
Des. Codes Cryptogr. | 1 |
| 2025 | Blocking sets of secant and tangent lines with respect to a quadric of PG (n,q)
Bart De Bruyn, Puspendu Pradhan, Binod Kumar Sahoo |
Des. Codes Cryptogr. | 1 |
| 2022 | Neumaier graphs with few eigenvaluesabstractAbstract A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this paper we give some sufficient and necessary conditions for a Neumaier graph to be strongly regular. Further we show that there does not exist Neumaier graphs with exactly four distinct eigenvalues. We also determine the Neumaier graphs with smallest eigenvalue $$-2$$ - 2 . Aida Abiad, Bart De Bruyn, Jozefien D'haeseleer, Jack H. Koolen |
Des. Codes Cryptogr. | 2 |
| 2022 | Pseudo-embeddings and quadratic sets of quadrics
Bart De Bruyn, Mou Gao |
Des. Codes Cryptogr. | 1 |
| 2022 | A characterization of the Coxeter cap
Bart De Bruyn, Mou Gao |
Des. Codes Cryptogr. | 1 |
| 2020 | On four codes with automorphism group PΣ L(3, 4) and pseudo-embeddings of the large Witt designs
Bart De Bruyn, Mou Gao |
Des. Codes Cryptogr. | 1 |
| 2019 | A generalization of the Haemers-Mathon bound for near hexagons
Bart De Bruyn |
Discret. Appl. Math. | 1 |
| 2019 | Blocking sets of tangent lines to a hyperbolic quadric in PG(3, 3)
Bart De Bruyn, Binod Kumar Sahoo, Bikramaditya Sahu |
Discret. Appl. Math. | 1 |
| 2019 | Three homogeneous embeddings of DW (2n-1, 2)
Bart De Bruyn |
Des. Codes Cryptogr. | 1 |
| 2017 | Characterizations of the Suzuki tower near polygons
Anurag Bishnoi, Bart De Bruyn |
Des. Codes Cryptogr. | 2 |
| 2016 | Hyperplanes of Hermitian dual polar spaces of rank 3 containing a quad
Bart De Bruyn |
Des. Codes Cryptogr. | 1 |
| 2013 | The pseudo-hyperplanes and homogeneous pseudo-embeddings of the generalized quadrangles of order (3, t)
Bart De Bruyn |
Des. Codes Cryptogr. | 1 |
| 2012 | A decomposition of the universal embedding space for the near polygon $${{\mathbb H}_n}$$
Bart De Bruyn |
Des. Codes Cryptogr. | 1 |
| 2012 | The pseudo-hyperplanes and homogeneous pseudo-embeddings of AG(n, 4) and PG(n, 4)
Bart De Bruyn |
Des. Codes Cryptogr. | 1 |
| 2010 | On hyperovals of polar spaces
Bart De Bruyn |
Des. Codes Cryptogr. | 1 |
| 2008 | The combinatorial properties of the hyperplanes of DW (5, q) arising from embedding
Bruce N. Cooperstein, Bart De Bruyn |
Des. Codes Cryptogr. | 2 |
| 2005 | Slim Near Polygons
Bart De Bruyn |
Des. Codes Cryptogr. | 1 |