Dominique Sotteau

43 papers A* 1B 2Journal 34Unranked 5
YearRankTypeTitle / Venue / Authors
2002 J jnl
On the injective chromatic number of graphs.
Discret. Math.
Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau
2001 J jnl
All-to-All Optical Routing in Chordal Rings of Degree 4.
Algorithmica
Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
2001 J jnl
Edge-disjoint spanners of complete bipartite graphs.
Discret. Math.
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
2000 J jnl
Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1.
Discret. Appl. Math.
Jaroslav Opatrny, Dominique Sotteau
1999 A* conf
All-to-All Optical Routing in Optimal Chordal Rings of Degree Four.
SODA
Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau
1999 J jnl
Edge-disjoint spanners of complete graphs and complete digraphs.
Discret. Math.
Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau
1998 J jnl
Cycles in the cube-connected cycles graph.
Discret. Appl. Math.
Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
1998 J jnl
Embedding Complete Binary Trees Into Star and Pancake Graphs.
Theory Comput. Syst.
Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
1997 — conf
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs.
HICSS (1)
Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau
1996 J jnl
2-diameter of de Bruijn graphs.
Networks
Qiao Li, Dominique Sotteau, Junming Xu
1996 J jnl
DCC Linear Congruential Graphs: A New Class of Interconnection Networks.
IEEE Trans. Computers
Jaroslav Opatrny, Dominique Sotteau, N. Srinivasan, Krishnaiyan Thulasiraman
1996 J jnl
Embeddings of Complete Binary Trees into Extended Grids with Edge-congestion 1*.
Parallel Algorithms Appl.
Marie-Claude Heydemann, Dominique Sotteau, Jaroslav Opatrny
1996 B conf
Emulating Networks by Bus Networks: Application to Trees and Hypermeshes.
SIROCCO
Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
1996 J jnl
Gossiping in d-Dimensional Mesh-Bus Networks.
Parallel Process. Lett.
André Hily, Dominique Sotteau
1996 J jnl
Spanners of Hypercube-Derived Networks.
SIAM J. Discret. Math.
Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau
1995 J jnl
A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs.
Inf. Process. Lett.
Marie-Claude Heydemann, Dominique Sotteau
1995 — conf
Embeddings of complete binary trees into star graphs with congestion 1.
HICSS (2)
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
1995 — ed.
Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, February 7-9, 1994
Interconnection Networks and Mapping and Scheduling Parallel Computations
D. Frank Hsu, Arnold L. Rosenberg, Dominique Sotteau
1994 — conf
Communications in Bus Networks.
Canada-France Conference on Parallel and Distributed Computing
André Hily, Dominique Sotteau
1994 B conf
Embedding Complete Binary Trees into Star Networks.
MFCS
Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
1994 J jnl
Embeddings of Hypercubes and Grids into de Bruijn Graphs.
J. Parallel Distributed Comput.
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
1994 J jnl
Forwarding indices of consistent routings and their complexity.
Networks
Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau, Jaroslav Opatrny
1993 J jnl
On the edge forwarding index problem for small graphs.
Networks
Abdelmadjid Bouabdallah, Dominique Sotteau
1993 J jnl
Open Problems.
Parallel Process. Lett.
Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau
1993 J jnl
Symmetric routings of the hypercube.
Discret. Math.
Jean-Claude König, Dominique Sotteau
1992 J jnl
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks.
Discret. Appl. Math.
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
1992 — conf
Embeddings of Hypercubes and Grids into de Bruijn Graphs.
ICPP (3)
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
1992 J jnl
Forwarding Indices of
Discret. Appl. Math.
Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau
1991 — conf
Embeddings of Shuffle-Like Graphs in Hyphercubes.
PARLE (1)
Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
1990 J jnl
A parameter linked with G-factors and the binding number.
Discret. Math.
Odile Favaron, Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau
1989 J jnl
On forwarding indices of networks.
Discret. Appl. Math.
Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau
1989 J jnl
On the existence of a matching orthogonal to a 2-factorization.
Discret. Math.
Mekkia Kouider, Dominique Sotteau
1986 J jnl
Digraphs without directed path of length two or three.
Discret. Math.
Dominique Sotteau, A. Pawel Wojda
1985 J jnl
About some cyclic properties in digraphs.
J. Comb. Theory B
Marie-Claude Heydemann, Dominique Sotteau
1984 J jnl
Number of arcs and cycles in digraphs.
Discret. Math.
Marie-Claude Heydemann, Dominique Sotteau
1983 J jnl
Short cycles in mediate graphs.
Discret. Math.
Gena Hahn, Dominique Sotteau, H. Sun
1981 J jnl
Almost resolvable decomposition of K
J. Comb. Theory B
Frank E. Bennett, Dominique Sotteau
1981 J jnl
Decomposition of K
J. Comb. Theory B
Dominique Sotteau
1981 J jnl
Longest paths in digraphs.
Comb.
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
1980 J jnl
Girth in digraphs.
J. Graph Theory
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
1979 J jnl
Resolvable Decomposition of K
J. Comb. Theory A
Jean-Claude Bermond, Anne Germa, Dominique Sotteau
1977 J jnl
Line graphs of hypergraphs I.
Discret. Math.
Jean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau
1976 J jnl
Decomposition of k
Discret. Math.
Dominique Sotteau