prof. dr. Kris Coolsaet
- ORCID iD
- 0000-0002-7657-900X
Show
Sort by
-
Classification of minimal blocking sets in PG(2,9)
-
- Journal Article
- A1
- open access
Nonsingular hypercubes and nonintersecting hyperboloids
-
- Journal Article
- A1
- open access
House of Graphs 2.0 : a database of interesting graphs and more
-
Classification of minimal blocking sets in small Desarguesian projective planes
-
Assessment of code, which aspects do teachers consider and how are they valued?
-
- Journal Article
- A1
- open access
Comparing learning ecologies of primary graphical programming : create or fix?
-
- Journal Article
- A1
- open access
Local orientation-preserving symmetry preserving operations on polyhedra
-
- Journal Article
- A1
- open access
Generation of local symmetry-preserving operations on polyhedra
-
- Journal Article
- A1
- open access
Some new symmetric equilateral embeddings of Platonic and Archimedean polyhedra
-
Generation and properties of nut graphs
-
- Journal Article
- A1
- open access
Spherical quadrangles with three equal sides and rational angles
-
- Journal Article
- A1
- open access
Decoration of the truncated tetrahedron - an Archimedean polyhedron - to produce a new class of convex equilateral polyhedra with tetrahedral symmetry
-
The complete arcs of PG(2,31)
-
Some large partial ovoids of Q⁻(5, q), for odd q
-
- Journal Article
- A1
- open access
Arcs with large conical subsets in Desarguesian planes of even order
-
On the classification of nonsingular 2x2x2x2 hypercubes
-
Fast vector arithmetic over F-3
-
- Journal Article
- A1
- open access
The known maximal partial ovoids of size q²-1 of Q(4,q)
-
House of Graphs: a database of interesting graphs
-
Some extremal problems for edge-regular graphs
-
The Lemma of Tangents reformulated
-
- Journal Article
- A1
- open access
The complete (k, 3)-arcs of PG(2,q), q ≤ 13
-
- Journal Article
- A1
- open access
The complete k-arcs of PG(2,27) and PG(2,29)
-
- Journal Article
- A1
- open access
Arcs with large conical subsets
-
- Journal Article
- A1
- open access
The smallest split Cayley hexagon has two symplectic embeddings
-
A full classification of the complete k-arcs of PG(2,23) and PG(2,25)
-
GrInvIn in a Nutshell
-
Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
-
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
-
Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
-
A 51-dimensional embedding of the Ree-Tits generalized octagon
-
Classification of some strongly regular subgraphs of the McLaughlin graph
-
On a 25-dimensional embedding of the Ree-Tits generalized octagon
-
The strongly regular (45,12,3,3) graphs
-
The uniqueness of the strongly regular graph srg(105,32,4,12)
-
Algebraic structure of the perfect Ree-Tits generalized octagons
-
A distance regular graph with intersection array (21,16,8; 1,4,14) does not exist
-
A computer-assisted proof of the uniqueness of the Perkel graph
-
Classification of three-class association schemes using backtracking with dynamic variable ordering
-
Some combinatorial properties of finite generalized octagons.
-
Some new upper bounds for the size of partial ovoids in slim generalized polygons and generalized hexagon of order (s, s(3)).
-
A construction of the simple group of Rudvalis from the group U-3(5): 2
-
Blocking sets in (v, {2,4}, 1)-Designs
-
LOCAL-STRUCTURE OF GRAPHS WITH LAMBDA=MU=2, ALPHA(2)=4.
-
A tabular method for verification of data exchange algorithms on networks of parallel processors
-
Optimal data exchange algorithms on star graphs.
-
Using a tabular method for verification of total exchange algorithms on networks of parallel processors
-
A QUICK INTRODUCTION TO THE PROGRAMMING LANGUAGE MIKE.
-
OPTIMAL-ALGORITHMS FOR TOTAL EXCHANGE WITHOUT BUFFERING ON THE HYPERCUBE.
-
Ontwerp en implementatie van MIKE een programmeertaal voor niet-numerieke wiskunde
(1991) -
CLASSIFYING STRONGLY REGULAR GRAPHS USING LEXICAL ORDERING OF ADJACENCY MATRICES
-
TOTAL EXCHANGE ALGORITHMS ON SANDWICH GRAPHS