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