Kris Coolsaet

Orcid: 0000-0002-7657-900X

According to our database1, Kris Coolsaet authored at least 35 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Nonsingular hypercubes and nonintersecting hyperboloids.
Des. Codes Cryptogr., January, 2024

2023
House of Graphs 2.0: A database of interesting graphs and more.
Discret. Appl. Math., 2023

2022
Assessment of Code, Which Aspects Do Teachers Consider and How Are They Valued?
ACM Trans. Comput. Educ., 2022

2021
Comparing learning ecologies of primary graphical programming: create or fix?
J. Comput. Assist. Learn., 2021

Local orientation-preserving symmetry preserving operations on polyhedra.
Discret. Math., 2021

2020
Generation of local symmetry-preserving operations on polyhedra.
Ars Math. Contemp., 2020

2018
Some New Symmetric Equilateral Embeddings of Platonic and Archimedean Polyhedra.
Symmetry, 2018

2017
Generation and properties of nut graphs.
CoRR, 2017

Spherical quadrangles with three equal sides and rational angles.
Ars Math. Contemp., 2017

2016
Decoration of the Truncated Tetrahedron - An Archimedean Polyhedron - To Produce a New Class of Convex Equilateral Polyhedra with Tetrahedral Symmetry.
Symmetry, 2016

2014
Some large partial ovoids of Q<sup>-</sup>(5, q), for odd q.
Des. Codes Cryptogr., 2014

Arcs with Large Conical Subsets in Desarguesian Planes of Even Order.
Electron. J. Comb., 2014

2013
On the classification of nonsingular 2×2×2×2 hypercubes.
Des. Codes Cryptogr., 2013

House of Graphs: A database of interesting graphs.
Discret. Appl. Math., 2013

2012
The Lemma of Tangents reformulated.
Discret. Math., 2012

Some Extremal Problems for Edge-Regular Graphs.
Ars Comb., 2012

A Database of Interesting Graphs: The House of Graphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2010
The smallest split Cayley hexagon has two symplectic embeddings.
Finite Fields Their Appl., 2010

Arcs with Large Conical Subsets.
Electron. J. Comb., 2010

2008
Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs.
J. Comb. Theory, Ser. A, 2008

On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency.
Eur. J. Comb., 2008

Classification of some strongly regular subgraphs of the McLaughlin graph.
Discret. Math., 2008

A 51-dimensional embedding of the Ree-Tits generalized octagon.
Des. Codes Cryptogr., 2008

Using Algebraic Properties of Minimal Idempotents for Exhaustive Computer Generation of Association Schemes.
Electron. J. Comb., 2008

2007
GrInvIn for graph theory teaching and research.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
The Strongly Regular (45, 12, 3, 3) Graphs.
Electron. J. Comb., 2006

2005
A distance regular graph with intersection array (21, 16, 8;1, 4, 14) does not exist.
Eur. J. Comb., 2005

Classification of three-class association schemes using backtracking with dynamic variable ordering.
Discret. Math., 2005

A Computer-Assisted Proof of the Uniqueness of the Perkel Graph.
Des. Codes Cryptogr., 2005

1997
Blocking Sets in (v, {2, 4}, 1)-Designs.
Des. Codes Cryptogr., 1997

1995
Local Structure of Graphs with lambda = mu=2, alpha<sub>2</sub> = 4.
Comb., 1995

1994
A Tabular Method for Verification of Data Exchange Algorithms on Networks of Parallel Processors.
Nord. J. Comput., 1994

1993
Using a Tabular Method for Verification of Total Exchange Algorithms on Networks of Parallel Processors.
Proceedings of the Parallel Computing: Trends and Applications, 1993

1992
A quick introduction to the programming language MIKE.
ACM SIGPLAN Notices, 1992

Optimal Algorithms for Total Exchange without Buffering on the Hypercube.
BIT, 1992


  Loading...