| Publication | Date of Publication | Type |
|---|
Classification of minimal blocking sets in \(\mathrm{PG}(2,11)\) with a nontrivial automorphism group
Journal of Combinatorial Designs | 2025-08-22 | Paper |
Classification of minimal blocking sets in small Desarguesian projective planes
Journal of Combinatorial Designs | 2024-04-30 | Paper |
Classification of minimal blocking sets in PG(2,9)
Journal of Geometry | 2024-01-22 | Paper |
Nonsingular hypercubes and nonintersecting hyperboloids
Designs, Codes and Cryptography | 2024-01-15 | Paper |
House of graphs 2.0: a database of interesting graphs and more
Discrete Applied Mathematics | 2022-12-08 | Paper |
House of Graphs 2.0: a database of interesting graphs and more
(available as arXiv preprint) | 2022-10-31 | Paper |
Generation and properties of nut graphs
(available as arXiv preprint) | 2021-09-02 | Paper |
Generation of local symmetry-preserving operations on polyhedra
Ars Mathematica Contemporanea | 2021-05-19 | Paper |
Local orientation-preserving symmetry preserving operations on polyhedra
Discrete Mathematics | 2021-01-21 | Paper |
Local orientation-preserving symmetry preserving operations on polyhedra
Discrete Mathematics | 2021-01-21 | Paper |
Some new symmetric equilateral embeddings of Platonic and Archimedean polyhedra
Symmetry | 2019-11-13 | Paper |
Spherical quadrangles with three equal sides and rational angles
Ars Mathematica Contemporanea | 2017-09-14 | Paper |
The complete arcs of \(\mathrm{PG}(2,31)\)
Journal of Combinatorial Designs | 2016-02-17 | Paper |
Arcs with large conical subsets in Desarguesian planes of even order
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Some large partial ovoids of \(Q^-(5,q)\), for odd \(q\)
Designs, Codes and Cryptography | 2014-07-03 | Paper |
Fast vector arithmetic over \(\mathbb{F}_3\)
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2013-06-24 | Paper |
| scientific article; zbMATH DE number 6172670 (Why is no real title available?) | 2013-06-10 | Paper |
On the classification of nonsingular \(2\times 2\times 2\times 2\) hypercubes
Designs, Codes and Cryptography | 2013-05-30 | Paper |
The known maximal partial ovoids of size \(q^{2}-1\) of \(Q(4,q)\)
Journal of Combinatorial Designs | 2013-05-10 | Paper |
House of Graphs: a database of interesting graphs
Discrete Applied Mathematics | 2012-11-22 | Paper |
The complete \((k, 3)\)-arcs of \(\mathrm{PG}(2,q), q\leq 13\)
Journal of Combinatorial Designs | 2012-10-29 | Paper |
The lemma of tangents reformulated
Discrete Mathematics | 2012-01-11 | Paper |
The complete k-arcs of PG(2, 27) and PG(2, 29)
Journal of Combinatorial Designs | 2011-03-25 | Paper |
The smallest split Cayley hexagon has two symplectic embeddings
Finite Fields and their Applications | 2010-10-11 | Paper |
Arcs with large conical subsets
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
Arcs with large conical subsets
The Electronic Journal of Combinatorics | 2010-08-12 | Paper |
A full classification of the complete \(k\)-arcs of \(\mathrm{PG}(2,23)\) and \(\mathrm{PG}(2,25)\).
Journal of Combinatorial Designs | 2010-07-13 | Paper |
GrInvIn in a nutshell
Journal of Mathematical Chemistry | 2009-07-13 | Paper |
Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
A 51-dimensional embedding of the Ree-Tits generalized octagon
Designs, Codes and Cryptography | 2009-03-31 | Paper |
Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
Journal of Combinatorial Theory. Series A | 2008-09-04 | Paper |
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
European Journal of Combinatorics | 2008-05-29 | Paper |
The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\)
Bulletin of the Belgian Mathematical Society - Simon Stevin | 2008-02-22 | Paper |
Classification of some strongly regular subgraphs of the McLaughlin graph
Discrete Mathematics | 2008-01-30 | Paper |
On a 25-dimensional embedding of the Ree–Tits generalized octagon
advg | 2007-10-24 | Paper |
The strongly regular (45,\,12,\,3,\,3) graphs
The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
The strongly regular (45,\,12,\,3,\,3) graphs
The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
Algebraic structure of the perfect Ree-Tits generalized octagon
Innovations in Incidence Geometry | 2006-06-14 | Paper |
Classification of three-class association schemes using backtracking with dynamic variable ordering
Discrete Mathematics | 2005-10-26 | Paper |
A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
European Journal of Combinatorics | 2005-05-04 | Paper |
A computer-assisted proof of the uniqueness of the Perkel graph
Designs, Codes and Cryptography | 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)\)
Journal of Algebraic Combinatorics | 2001-10-28 | Paper |
A construction of the simple group of Rudvalis from the group <i>U<sub>3</sub>(5):2</i>
jgth | 1999-02-02 | Paper |
Blocking sets in \((v,\{ 2,4 \} ,1)\)-designs
Designs, Codes and Cryptography | 1997-07-01 | Paper |
Local structure of graphs with \(\lambda= \mu= 2\), \(a_ 2=4\)
Combinatorica | 1996-01-24 | Paper |
Optimal data exchange algorithms on star graphs
Computers & Mathematics with Applications | 1995-01-23 | Paper |
Optimal algorithms for total exchange without buffering on the hypercube
BIT | 1993-01-26 | Paper |
An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices
International Journal of Computer Mathematics | 1992-09-27 | Paper |
Total exchange algorithms on 'sandwich graphs'
Computers & Mathematics with Applications | 1992-09-27 | Paper |
Classifying strongly regular graphs using lexical ordering of adjacency matrices
Computers & Mathematics with Applications | 1991-01-01 | Paper |
