The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

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

Publications of Author

  1. André Hily, Dominique Sotteau
    Communications in Bus Networks. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:197-206 [Conf]
  2. Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embeddings of complete binary trees into star graphs with congestion 1. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:546-554 [Conf]
  3. Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
    Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1997, pp:191-199 [Conf]
  4. Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embeddings of Hypercubes and Grids into de Bruijn Graphs. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1992, pp:28-37 [Conf]
  5. A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embedding Complete Binary Trees into Star Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:266-275 [Conf]
  6. Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embeddings of Shuffle-Like Graphs in Hyphercubes. [Citation Graph (0, 0)][DBLP]
    PARLE (1), 1991, pp:179-190 [Conf]
  7. Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
    Emulating Networks by Bus Networks: Application to Trees and Hypermeshes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:241-254 [Conf]
  8. Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
    All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:695-703 [Conf]
  9. Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
    All-to-All Optical Routing in Chordal Rings of Degree 4. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:2, pp:155-178 [Journal]
  10. Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
    Longest paths in digraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:4, pp:337-341 [Journal]
  11. Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
    Cycles in the cube-connected cycles graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:135-155 [Journal]
  12. Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau
    Forwarding Indices of k-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:287-296 [Journal]
  13. Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:297-317 [Journal]
  14. Jaroslav Opatrny, Dominique Sotteau
    Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:98, n:3, pp:237-254 [Journal]
  15. Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau
    On the injective chromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:179-192 [Journal]
  16. Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
    Edge-disjoint spanners of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:65-76 [Journal]
  17. Marie-Claude Heydemann, Dominique Sotteau
    A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:5, pp:255-259 [Journal]
  18. Jean-Claude Bermond, Anne Germa, Dominique Sotteau
    Resolvable Decomposition of Kn. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:26, n:2, pp:179-185 [Journal]
  19. Marie-Claude Heydemann, Dominique Sotteau
    About some cyclic properties in digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:261-278 [Journal]
  20. Dominique Sotteau
    Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:75-81 [Journal]
  21. F. E. Bennett, Dominique Sotteau
    Almost resolvable decomposition of Kn*. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:30, n:2, pp:228-232 [Journal]
  22. Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embeddings of Hypercubes and Grids into de Bruijn Graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:23, n:1, pp:104-111 [Journal]
  23. A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
    Embedding Complete Binary Trees Into Star and Pancake Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:3, pp:279-305 [Journal]
  24. Qiao Li, Dominique Sotteau, Junming Xu
    2-diameter of de Bruijn graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1996, v:28, n:1, pp:7-14 [Journal]
  25. Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau
    Open Problems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:507-524 [Journal]
  26. Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau
    Spanners of Hypercube-Derived Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:1, pp:37-54 [Journal]
  27. Jaroslav Opatrny, Dominique Sotteau, N. Srinivasan, Krishnaiyan Thulasiraman
    DCC Linear Congruential Graphs: A New Class of Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:2, pp:156-164 [Journal]
  28. Gena Hahn, Dominique Sotteau, H. Sun
    Short cycles in mediate graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:281-284 [Journal]
  29. Marie-Claude Heydemann, Dominique Sotteau
    Number of arcs and cycles in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:199-207 [Journal]
  30. Dominique Sotteau, A. Pawel Wojda
    Digraphs without directed path of length two or three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:105-108 [Journal]
  31. Mekkia Kouider, Dominique Sotteau
    On the existence of a matching orthogonal to a 2-factorization. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:3, pp:301-304 [Journal]
  32. Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
    Edge-disjoint spanners of complete graphs and complete digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:133-159 [Journal]
  33. Odile Favaron, Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau
    A parameter linked with G-factors and the binding number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:91, n:3, pp:311-316 [Journal]
  34. Jean-Claude König, Dominique Sotteau
    Symmetric routings of the hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:123-134 [Journal]

  35. On forwarding indices of networks. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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