| Publication | Date of Publication | Type |
|---|
| Classification of minimal blocking sets in small Desarguesian projective planes | 2024-04-30 | Paper |
| Classification of minimal blocking sets in PG(2,9) | 2024-01-22 | Paper |
| Nonsingular hypercubes and nonintersecting hyperboloids | 2024-01-15 | Paper |
| House of graphs 2.0: a database of interesting graphs and more | 2022-12-08 | Paper |
| House of Graphs 2.0: a database of interesting graphs and more | 2022-10-31 | Paper |
| Generation and properties of nut graphs | 2021-09-02 | Paper |
| Generation of local symmetry-preserving operations on polyhedra | 2021-05-19 | Paper |
| Local orientation-preserving symmetry preserving operations on polyhedra | 2021-01-21 | Paper |
| Some new symmetric equilateral embeddings of Platonic and Archimedean polyhedra | 2019-11-13 | Paper |
| Spherical quadrangles with three equal sides and rational angles | 2017-09-14 | Paper |
| The Complete Arcs of PG(2,31) | 2016-02-17 | Paper |
| Arcs with large conical subsets in Desarguesian planes of even order | 2014-09-04 | Paper |
| Some large partial ovoids of \(Q^-(5,q)\), for odd \(q\) | 2014-07-03 | Paper |
| Fast vector arithmetic over \(\mathbb{F}_3\) | 2013-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4924914 | 2013-06-10 | Paper |
| On the classification of nonsingular \(2\times 2\times 2\times 2\) hypercubes | 2013-05-30 | Paper |
| The Known Maximal Partial Ovoids of Size of | 2013-05-10 | Paper |
| House of Graphs: a database of interesting graphs | 2012-11-22 | Paper |
| The complete (k, 3)-arcs of PG(2,q), q≤13 | 2012-10-29 | Paper |
| The lemma of tangents reformulated | 2012-01-11 | Paper |
| The complete \(k\)-arcs of \(PG(2, 27)\) and \(PG(2, 29)\) | 2011-03-25 | Paper |
| The smallest split Cayley hexagon has two symplectic embeddings | 2010-10-11 | Paper |
| Arcs with large conical subsets | 2010-08-12 | Paper |
| A full classification of the complete \(k\)-arcs of \(\mathrm{PG}(2,23)\) and \(\mathrm{PG}(2,25)\). | 2010-07-13 | Paper |
| GrInvIn in a nutshell | 2009-07-13 | Paper |
| Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes | 2009-04-07 | Paper |
| A 51-dimensional embedding of the Ree-Tits generalized octagon | 2009-03-31 | Paper |
| Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs | 2008-09-04 | Paper |
| On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency | 2008-05-29 | Paper |
| The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\) | 2008-02-22 | Paper |
| Classification of some strongly regular subgraphs of the McLaughlin graph | 2008-01-30 | Paper |
| On a 25-dimensional embedding of the Ree–Tits generalized octagon | 2007-10-24 | Paper |
| The strongly regular (45,\,12,\,3,\,3) graphs | 2006-08-30 | Paper |
| Algebraic structure of the perfect Ree-Tits generalized octagon | 2006-06-14 | Paper |
| Classification of three-class association schemes using backtracking with dynamic variable ordering | 2005-10-26 | Paper |
| A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist | 2005-05-04 | Paper |
| A computer-assisted proof of the uniqueness of the Perkel graph | 2005-02-28 | Paper |
| Some new upper bounds for the size of partial ovoids in slim generalized polygons and generalized hexagons of order \((s,s^3)\) | 2001-10-28 | Paper |
| A construction of the simple group of Rudvalis from the group U3(5):2 | 1999-02-02 | Paper |
| Blocking sets in \((v,\{ 2,4 \} ,1)\)-designs | 1997-07-01 | Paper |
| Local structure of graphs with \(\lambda= \mu= 2\), \(a_ 2=4\) | 1996-01-24 | Paper |
| Optimal data exchange algorithms on star graphs | 1995-01-23 | Paper |
| Optimal algorithms for total exchange without buffering on the hypercube | 1993-01-26 | Paper |
| An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices | 1992-09-27 | Paper |
| Total exchange algorithms on 'sandwich graphs' | 1992-09-27 | Paper |
| Classifying strongly regular graphs using lexical ordering of adjacency matrices | 1991-01-01 | Paper |
