Search the dblp DataBase

Publications of Author

1. Veerle Fack, Kris Coolsaet, H. De Meyer
   Using a Tabular Method for Verification of Total Exchange Algorithms on Networks of Parallel Processors. [Citation Graph (0, 0)][DBLP]
   PARCO, 1993, pp:605-608 [Conf]
   
2. Kris Coolsaet, H. De Meyer, Veerle Fack
   Optimal Algorithms for Total Exchange without Buffering on the Hypercube. [Citation Graph (0, 0)][DBLP]
   BIT, 1992, v:32, n:4, pp:559-569 [Journal]
   
3. Kris Coolsaet
   Local Structure of Graphs with lambda = mu=2, alpha₂ = 4. [Citation Graph (0, 0)][DBLP]
   Combinatorica, 1995, v:15, n:4, pp:481-487 [Journal]
   
4. Lynn Margaret Batten, Kris Coolsaet, Anne Penfold Street
   Blocking Sets in (v, {2, 4}, 1)-Designs. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 1997, v:10, n:3, pp:309-314 [Journal]
   
5. Kris Coolsaet, Jan Degraer
   A Computer-Assisted Proof of the Uniqueness of the Perkel Graph. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2005, v:34, n:2-3, pp:155-171 [Journal]
   
6. Jan Degraer, Kris Coolsaet
   Classification of three-class association schemes using backtracking with dynamic variable ordering. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:300, n:1-3, pp:71-81 [Journal]
   
7. Kris Coolsaet
   A distance regular graph with intersection array (21, 16, 8;1, 4, 14) does not exist. [Citation Graph (0, 0)][DBLP]
   Eur. J. Comb., 2005, v:26, n:5, pp:709-716 [Journal]
   
8. Kris Coolsaet, Veerle Fack, H. De Meyer
   A Tabular Method for Verification of Data Exchange Algorithms on Networks of Parallel Processors. [Citation Graph (0, 0)][DBLP]
   Nord. J. Comput., 1994, v:1, n:2, pp:202-213 [Journal]
   
9. Kris Coolsaet
   A quick introduction to the programming language MIKE. [Citation Graph (0, 0)][DBLP]
   SIGPLAN Notices, 1992, v:27, n:6, pp:37-46 [Journal]
   
10. 
    GrInvIn for graph theory teaching and research. [Citation Graph (, )][DBLP]
    
    
11. 
    The Strongly Regular (45, 12, 3, 3) Graphs. [Citation Graph (, )][DBLP]
    
    
12. 
    A 51-dimensional embedding of the Ree-Tits generalized octagon. [Citation Graph (, )][DBLP]
    
    
13. 
    Classification of some strongly regular subgraphs of the McLaughlin graph. [Citation Graph (, )][DBLP]
    
    
14. 
    On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency. [Citation Graph (, )][DBLP]