Kris Coolsaet
Orcid: 0000-0002-7657-900X
According to our database1,
Kris Coolsaet
authored at least 35 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Des. Codes Cryptogr., January, 2024
2023
Discret. Appl. Math., 2023
2022
ACM Trans. Comput. Educ., 2022
2021
J. Comput. Assist. Learn., 2021
Discret. Math., 2021
2020
Ars Math. Contemp., 2020
2018
Symmetry, 2018
2017
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
Des. Codes Cryptogr., 2014
Electron. J. Comb., 2014
2013
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
Finite Fields Their Appl., 2010
2008
Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs.
J. Comb. Theory A, 2008
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency.
Eur. J. Comb., 2008
Discret. Math., 2008
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
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
Des. Codes Cryptogr., 2005
1997
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