Kris Coolsaet
Impact in
-
- Finite Group Theory Research
- Limits and Structures in Graph Theory
- Geometry and Topology top 5%
- Graph theory and applications
Papers in
-
- Finite Group Theory Research 20
-
- Coding theory and cryptography 17
- Algorithms and Data Compression 3
- Co-authors
- Jan Goedgebeur (3 shared papers)Gunnar Brinkmann (2 shared papers)Hadrien Mélot (1 shared paper)Veerle Fack (9 shared papers)Edward Spence (1 shared paper)H. De Meyer (2 shared papers)Francis wyffels (2 shared papers)Hendrik Van Maldeghem (1 shared paper)
- Journals
- Journal of Combinatorial Designs (7 papers)Designs Codes and Cryptography (5 papers)Discrete Mathematics (3 papers)The Electronic Journal of Combinatorics (3 papers)Discrete Applied Mathematics (2 papers)
- Partner nations
- BelgiumUnited StatesSlovenia
In The Last Decade
Kris Coolsaet
41 papers receiving 308 citations
Peers
Comparison fields: 5 of 46
- Discrete Mathematics and Combinatorics 170
- Geometry and Topology 77
- Computational Theory and Mathematics 127
- Artificial Intelligence 117
- Computational Mathematics 2
Countries citing papers authored by Kris Coolsaet
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
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-authors
The 17 scholars most cited alongside Kris Coolsaet, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 45 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 94 | |
| 2 | 2022 | 34 | |
| 3 | 2006 | 19 | |
| 4 | 2008 | 19 | |
| 5 | 2008 | 10 | |
| 6 | 2007 | 10 | |
| 7 | 2011 | 9 | |
| 8 | 2009 | 9 | |
| 9 | 2005 | 8 | |
| 10 | 2010 | 7 | |
| 11 | 2005 | 7 | |
| 12 | 1992 | 7 | |
| 13 | 2004 | 6 | |
| 14 | 1994 | 6 | |
| 15 | 2010 | 6 | |
| 16 | 2006 | 6 | |
| 17 | Some extremal problems for edge-regular graphs | 2012 | 5 |
| 18 | 2007 | 5 | |
| 19 | 2012 | 5 | |
| 20 | 2005 | 5 |
About Kris Coolsaet
Kris Coolsaet is a scholar working on Discrete Mathematics and Combinatorics, Artificial Intelligence, Electrical and Electronic Engineering, Computational Theory and Mathematics and Geometry and Topology, having authored 45 papers that have together received 327 indexed citations. Recurring topics across this work include Finite Group Theory Research (20 papers), graph theory and CDMA systems (20 papers), Coding theory and cryptography (17 papers), Advanced Graph Theory Research (6 papers), Interconnection Networks and Systems (6 papers), Mathematics and Applications (3 papers), Graph theory and applications (3 papers) and Algorithms and Data Compression (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (170 citations), Geometry and Topology (77 citations), Computational Theory and Mathematics (127 citations), Artificial Intelligence (117 citations) and Computational Mathematics (2 citations). Kris Coolsaet has collaborated with scholars based in Belgium, United States and Slovenia. Frequent co-authors include Jan Goedgebeur, Gunnar Brinkmann, Hadrien Mélot, Veerle Fack, Edward Spence, H. De Meyer, Francis wyffels, Hendrik Van Maldeghem, Jan De Beule and Jack H. Koolen. Their work appears in journals such as Journal of Combinatorial Designs, Designs Codes and Cryptography, Discrete Mathematics, The Electronic Journal of Combinatorics and Discrete Applied Mathematics.
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.