Dominique Sotteau

Publication Activity (10 Years)

Years Active: 1976-2002
Publications (10 Years): 0

Publications

Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau
On the injective chromatic number of graphs. Discret. Math. 256 (1-2) (2002)
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
Edge-disjoint spanners of complete bipartite graphs. Discret. Math. 234 (1-3) (2001)
Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
All-to-All Optical Routing in Chordal Rings of Degree 4. Algorithmica 31 (2) (2001)
Jaroslav Opatrny, Dominique Sotteau
Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1. Discret. Appl. Math. 98 (3) (2000)
Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. SODA (1999)
Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
Edge-disjoint spanners of complete graphs and complete digraphs. Discret. Math. 203 (1-3) (1999)
Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Cycles in the cube-connected cycles graph. Discret. Appl. Math. 83 (1-3) (1998)
Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embedding Complete Binary Trees Into Star and Pancake Graphs. Theory Comput. Syst. 31 (3) (1998)
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) (1997)
Qiao Li, Dominique Sotteau, Junming Xu
2-diameter of de Bruijn graphs. Networks 28 (1) (1996)
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) (1996)
Jaroslav Opatrny, Dominique Sotteau, N. Srinivasan, Krishnaiyan Thulasiraman
DCC Linear Congruential Graphs: A New Class of Interconnection Networks. IEEE Trans. Computers 45 (2) (1996)
Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau
Spanners of Hypercube-Derived Networks. SIAM J. Discret. Math. 9 (1) (1996)
André Hily, Dominique Sotteau
Gossiping in d-Dimensional Mesh-Bus Networks. Parallel Process. Lett. 6 (1) (1996)
Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Emulating Networks by Bus Networks: Application to Trees and Hypermeshes. SIROCCO (1996)
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embeddings of complete binary trees into star graphs with congestion 1. HICSS (2) (1995)
Marie-Claude Heydemann, Dominique Sotteau
A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs. Inf. Process. Lett. 53 (5) (1995)
Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau, Jaroslav Opatrny
Forwarding indices of consistent routings and their complexity. Networks 24 (2) (1994)
Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embedding Complete Binary Trees into Star Networks. MFCS (1994)
André Hily, Dominique Sotteau
Communications in Bus Networks. Canada-France Conference on Parallel and Distributed Computing (1994)
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embeddings of Hypercubes and Grids into de Bruijn Graphs. J. Parallel Distributed Comput. 23 (1) (1994)
Abdelmadjid Bouabdallah, Dominique Sotteau
On the edge forwarding index problem for small graphs. Networks 23 (4) (1993)
Jean-Claude König, Dominique Sotteau
Symmetric routings of the hypercube. Discret. Math. 121 (1-3) (1993)
Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau
Open Problems. Parallel Process. Lett. 3 (1993)
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embeddings of Hypercubes and Grids into de Bruijn Graphs. ICPP (3) (1992)
Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau
-Connected Graphs. Discret. Appl. Math. (1992)
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. Discret. Appl. Math. (1992)
Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embeddings of Shuffle-Like Graphs in Hyphercubes. PARLE (1) (1991)
Odile Favaron, Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau
A parameter linked with G-factors and the binding number. Discret. Math. 91 (3) (1990)
Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau
On forwarding indices of networks. Discret. Appl. Math. 23 (2) (1989)
Mekkia Kouider, Dominique Sotteau
On the existence of a matching orthogonal to a 2-factorization. Discret. Math. 73 (3) (1989)
Dominique Sotteau, A. Pawel Wojda
Digraphs without directed path of length two or three. Discret. Math. 58 (1) (1986)
Marie-Claude Heydemann, Dominique Sotteau
About some cyclic properties in digraphs. J. Comb. Theory, Ser. B 38 (3) (1985)
Marie-Claude Heydemann, Dominique Sotteau
Number of arcs and cycles in digraphs. Discret. Math. 52 (2-3) (1984)
Gena Hahn, Dominique Sotteau, H. Sun
Short cycles in mediate graphs. Discret. Math. 44 (3) (1983)
Dominique Sotteau
) into cycles (circuits) of length 2k. J. Comb. Theory, Ser. B 30 (1) (1981)
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Longest paths in digraphs. Comb. 1 (4) (1981)
F. E. Bennett, Dominique Sotteau
. J. Comb. Theory, Ser. B 30 (2) (1981)
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Girth in digraphs. J. Graph Theory 4 (3) (1980)
Jean-Claude Bermond, Anne Germa, Dominique Sotteau
. J. Comb. Theory, Ser. A 26 (2) (1979)
Jean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau
Line graphs of hypergraphs I. Discret. Math. 18 (3) (1977)
Dominique Sotteau
into circuits of odd length. Discret. Math. 15 (2) (1976)