The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dominique de Caen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dominique de Caen, Edwin R. van Dam
    Association Schemes Related to Kasami Codes and Kerdock Sets. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:18, n:1/3, pp:89-102 [Journal]
  2. Dominique de Caen, Dmitry Fon-Der-Flaass
    Distance Regular Covers of Complete Graphs from Latin Squares. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:34, n:2-3, pp:149-153 [Journal]
  3. Dominique de Caen
    The Spectra of Complementary Subgraphs in a Strongly Regular Graph. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:5, pp:559-565 [Journal]
  4. Dominique de Caen, Edwin R. van Dam
    Fissioned Triangular Schemes via the Cross-ratio. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:3, pp:297-301 [Journal]
  5. Dominique de Caen
    A note on the probabilistic approach to Turán's problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:340-349 [Journal]
  6. Dominique de Caen, Edwin R. van Dam
    Fissions of Classical Self-Dual Association Schemes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:88, n:1, pp:167-175 [Journal]
  7. Dominique de Caen, Edwin R. van Dam, Edward Spence
    A Nonregular Analogue of Conference Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:88, n:1, pp:194-204 [Journal]
  8. Dominique de Caen, Zoltán Füredi
    The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:2, pp:274-276 [Journal]
  9. Dominique de Caen, David A. Gregory
    Factorizations of symmetric designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:49, n:2, pp:323-337 [Journal]
  10. Dominique de Caen, D. G. Hoffman
    Impossibility of Decomposing the Complete Graph on n Points into n-1 Isomorphic Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:1, pp:48-50 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002