2008 |
15 | EE | Kris Coolsaet:
A 51-dimensional embedding of the Ree-Tits generalized octagon.
Des. Codes Cryptography 47(1-3): 75-97 (2008) |
14 | EE | Jan Degraer,
Kris Coolsaet:
Classification of some strongly regular subgraphs of the McLaughlin graph.
Discrete Mathematics 308(2-3): 395-400 (2008) |
13 | EE | Kris Coolsaet,
Aleksandar Jurisic,
Jack H. Koolen:
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency.
Eur. J. Comb. 29(5): 1186-1199 (2008) |
12 | EE | Kris Coolsaet,
Aleksandar Jurisic:
Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs.
J. Comb. Theory, Ser. A 115(6): 1086-1095 (2008) |
2007 |
11 | | Adriaan Peeters,
Kris Coolsaet,
Gunnar Brinkmann,
Nicolas Van Cleemput,
Veerle Fack:
GrInvIn for graph theory teaching and research.
CTW 2007: 123-126 |
2006 |
10 | EE | Kris Coolsaet,
Jan Degraer,
Edward Spence:
The Strongly Regular (45, 12, 3, 3) Graphs.
Electr. J. Comb. 13(1): (2006) |
2005 |
9 | EE | Kris Coolsaet,
Jan Degraer:
A Computer-Assisted Proof of the Uniqueness of the Perkel Graph.
Des. Codes Cryptography 34(2-3): 155-171 (2005) |
8 | EE | Jan Degraer,
Kris Coolsaet:
Classification of three-class association schemes using backtracking with dynamic variable ordering.
Discrete Mathematics 300(1-3): 71-81 (2005) |
7 | EE | Kris Coolsaet:
A distance regular graph with intersection array (21, 16, 8;1, 4, 14) does not exist.
Eur. J. Comb. 26(5): 709-716 (2005) |
1997 |
6 | | Lynn Margaret Batten,
Kris Coolsaet,
Anne Penfold Street:
Blocking Sets in (v, {2, 4}, 1)-Designs.
Des. Codes Cryptography 10(3): 309-314 (1997) |
1995 |
5 | | Kris Coolsaet:
Local Structure of Graphs with lambda = mu=2, alpha2 = 4.
Combinatorica 15(4): 481-487 (1995) |
1994 |
4 | | Kris Coolsaet,
Veerle Fack,
H. De Meyer:
A Tabular Method for Verification of Data Exchange Algorithms on Networks of Parallel Processors.
Nord. J. Comput. 1(2): 202-213 (1994) |
1993 |
3 | | Veerle Fack,
Kris Coolsaet,
H. De Meyer:
Using a Tabular Method for Verification of Total Exchange Algorithms on Networks of Parallel Processors.
PARCO 1993: 605-608 |
1992 |
2 | | Kris Coolsaet,
H. De Meyer,
Veerle Fack:
Optimal Algorithms for Total Exchange without Buffering on the Hypercube.
BIT 32(4): 559-569 (1992) |
1 | EE | Kris Coolsaet:
A quick introduction to the programming language MIKE.
SIGPLAN Notices 27(6): 37-46 (1992) |