Kris Coolsaet

556 total citations
43 papers, 288 citations indexed

About

Kris Coolsaet is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, Kris Coolsaet has authored 43 papers receiving a total of 288 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Electrical and Electronic Engineering, 19 papers in Discrete Mathematics and Combinatorics and 18 papers in Artificial Intelligence. Recurrent topics in Kris Coolsaet's work include graph theory and CDMA systems (20 papers), Finite Group Theory Research (19 papers) and Coding theory and cryptography (15 papers). Kris Coolsaet is often cited by papers focused on graph theory and CDMA systems (20 papers), Finite Group Theory Research (19 papers) and Coding theory and cryptography (15 papers). Kris Coolsaet collaborates with scholars based in Belgium, United States and Slovenia. Kris Coolsaet's co-authors include Jan Goedgebeur, Gunnar Brinkmann, Hadrien Mélot, Veerle Fack, Edward Spence, H. De Meyer, Hendrik Van Maldeghem, Jack H. Koolen, Anne Street and Lynn Batten and has published in prestigious journals such as Computers & Mathematics with Applications, Journal of Computer Assisted Learning and Discrete Applied Mathematics.

In The Last Decade

Kris Coolsaet

40 papers receiving 270 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Kris Coolsaet Belgium 8 153 108 108 101 71 43 288
Luis Goddyn Canada 11 171 1.1× 30 0.3× 286 2.6× 113 1.1× 62 0.9× 30 372
Uroš Milutinović Slovenia 9 76 0.5× 66 0.6× 224 2.1× 49 0.5× 116 1.6× 22 343
R. E. L. Aldred New Zealand 13 184 1.2× 56 0.5× 465 4.3× 158 1.6× 131 1.8× 76 543
Klavdija Kutnar Slovenia 13 404 2.6× 203 1.9× 189 1.8× 248 2.5× 191 2.7× 70 546
Emanuele Munarini Italy 9 147 1.0× 37 0.3× 117 1.1× 24 0.2× 133 1.9× 45 301
Ilia Ponomarenko Russia 14 299 2.0× 189 1.8× 141 1.3× 151 1.5× 162 2.3× 75 509
B. Tayfeh‐Rezaie Iran 13 193 1.3× 170 1.6× 179 1.7× 237 2.3× 278 3.9× 52 520
Jean‐Sébastien Sereni France 14 155 1.0× 23 0.2× 351 3.3× 142 1.4× 73 1.0× 57 478
Herbert Fleischner Austria 14 183 1.2× 56 0.5× 498 4.6× 153 1.5× 183 2.6× 64 616
Anton Betten United States 11 238 1.6× 242 2.2× 158 1.5× 259 2.6× 223 3.1× 49 552

Countries citing papers authored by Kris Coolsaet

Since Specialization
Citations

This map shows the geographic impact of Kris Coolsaet's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Kris Coolsaet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kris Coolsaet more than expected).

Fields of papers citing papers by Kris Coolsaet

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kris Coolsaet. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Kris Coolsaet. The network helps show where Kris Coolsaet may publish in the future.

Co-authorship network of co-authors of Kris Coolsaet

This figure shows the co-authorship network connecting the top 25 collaborators of Kris Coolsaet. A scholar is included among the top collaborators of Kris Coolsaet based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Kris Coolsaet. Kris Coolsaet is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Coolsaet, Kris, et al.. (2023). Classification of minimal blocking sets in PG(2,9). Journal of Geometry. 115(1). 1 indexed citations
2.
Coolsaet, Kris, et al.. (2022). Assessment of Code, Which Aspects Do Teachers Consider and How Are They Valued?. ACM Transactions on Computing Education. 22(4). 1–27. 1 indexed citations
3.
Coolsaet, Kris, et al.. (2022). Classification of minimal blocking sets in small Desarguesian projective planes. Journal of Combinatorial Designs. 30(8). 561–580. 2 indexed citations
4.
Coolsaet, Kris, et al.. (2022). House of Graphs 2.0: A database of interesting graphs and more. Discrete Applied Mathematics. 325. 97–107. 23 indexed citations
5.
Coolsaet, Kris, et al.. (2021). Comparing learning ecologies of primary graphical programming: create or fix?. Journal of Computer Assisted Learning. 37(5). 1296–1311. 2 indexed citations
6.
Coolsaet, Kris, et al.. (2020). Generation of local symmetry-preserving operations on polyhedra. Ars Mathematica Contemporanea. 18(2). 223–239. 1 indexed citations
7.
Coolsaet, Kris & Stan Schein. (2018). Some New Symmetric Equilateral Embeddings of Platonic and Archimedean Polyhedra. Symmetry. 10(9). 382–382.
8.
Coolsaet, Kris, Patrick W. Fowler, & Jan Goedgebeur. (2018). Generation and properties of nut graphs. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 80(2). 423–444. 1 indexed citations
9.
Coolsaet, Kris, et al.. (2012). Some extremal problems for edge-regular graphs. Ghent University Academic Bibliography (Ghent University). 5 indexed citations
10.
Brinkmann, Gunnar, Kris Coolsaet, Jan Goedgebeur, & Hadrien Mélot. (2012). House of Graphs: A database of interesting graphs. Discrete Applied Mathematics. 161(1-2). 311–314. 81 indexed citations
11.
Coolsaet, Kris. (2012). On the classification of nonsingular 2×2×2×2 hypercubes. Designs Codes and Cryptography. 68(1-3). 179–194. 2 indexed citations
12.
Coolsaet, Kris. (2011). The Lemma of Tangents reformulated. Discrete Mathematics. 312(3). 705–714. 1 indexed citations
13.
Coolsaet, Kris, et al.. (2008). Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs. Journal of Combinatorial Theory Series A. 115(6). 1086–1095. 19 indexed citations
14.
Coolsaet, Kris. (2007). On a 25-dimensional embedding of the Ree–Tits generalized octagon. Advances in Geometry. 7(3). 423–452. 3 indexed citations
15.
Coolsaet, Kris, et al.. (2007). On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency. European Journal of Combinatorics. 29(5). 1186–1199. 5 indexed citations
16.
Coolsaet, Kris, et al.. (2007). Classification of some strongly regular subgraphs of the McLaughlin graph. Discrete Mathematics. 308(2-3). 395–400. 10 indexed citations
17.
Coolsaet, Kris, et al.. (2005). Classification of three-class association schemes using backtracking with dynamic variable ordering. Discrete Mathematics. 300(1-3). 71–81. 5 indexed citations
18.
Coolsaet, Kris, Veerle Fack, & H. De Meyer. (1994). A tabular method for verification of data exchange algorithms on networks of parallel processors. Ghent University Academic Bibliography (Ghent University). 1(2). 202–213. 1 indexed citations
19.
Coolsaet, Kris & Veerle Fack. (1994). Optimal data exchange algorithms on star graphs. Computers & Mathematics with Applications. 27(3). 21–25. 6 indexed citations
20.
Coolsaet, Kris & Veerle Fack. (1991). Total exchange algorithms on ‘sandwich graphs’. Computers & Mathematics with Applications. 22(10). 45–48. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026