Marie-Claude Heydemann

32 papers B 2Journal 27Unranked 3
YearRankTypeTitle / Venue / Authors
2002 J jnl
Uniform emulations of Cartesian-product and Cayley graphs.
Discret. Appl. Math.
Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann
2001 J jnl
Complete Rotations in Cayley Graphs.
Eur. J. Comb.
Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes
2001 J jnl
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays.
Theor. Comput. Sci.
Rabah Harbane, Marie-Claude Heydemann
2000 J jnl
Rotational Cayley Graphs on Transposition Generated Groups.
Electron. Notes Discret. Math.
Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes
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
1998 J jnl
Uniform homomorphisms of de Bruijn and Kautz networks.
Discret. Appl. Math.
Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann
1997 J jnl
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.
Discret. Appl. Math.
Dominique Barth, Marie-Claude Heydemann
1997 J jnl
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs.
Discret. Appl. Math.
Dominique Barth, Marie-Claude Heydemann
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
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
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
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
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
1982 J jnl
Cycles in strong oriented graphs.
Discret. Math.
Marie-Claude Heydemann
1982 J jnl
Degrees and cycles in digraphs.
Discret. Math.
Marie-Claude Heydemann
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
1980 J jnl
On cycles and paths in digraphs.
Discret. Math.
Marie-Claude Heydemann
1978 J jnl
Spectral characterization of some graphs.
J. Comb. Theory B
Marie-Claude Heydemann
1977 J jnl
Line graphs of hypergraphs I.
Discret. Math.
Jean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau