Marie-Claude Heydemann

Publication Activity (10 Years)

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

Publications

Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann
Uniform emulations of Cartesian-product and Cayley graphs. Discret. Appl. Math. 116 (1-2) (2002)
Rabah Harbane, Marie-Claude Heydemann
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays. Theor. Comput. Sci. 263 (1-2) (2001)
Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes
Complete Rotations in Cayley Graphs. Eur. J. Comb. 22 (2) (2001)
Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes
Rotational Cayley Graphs on Transposition Generated Groups. Electron. Notes Discret. Math. 5 (2000)
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)
Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann
Uniform homomorphisms of de Bruijn and Kautz networks. Discret. Appl. Math. 83 (1-3) (1998)
Dominique Barth, Marie-Claude Heydemann
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. Discret. Appl. Math. 80 (1) (1997)
Dominique Barth, Marie-Claude Heydemann
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. Discret. Appl. Math. 77 (2) (1997)
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)
Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau
Spanners of Hypercube-Derived Networks. SIAM J. Discret. Math. 9 (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)
Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau
Embeddings of Hypercubes and Grids into de Bruijn Graphs. J. Parallel Distributed Comput. 23 (1) (1994)
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)
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)
Marie-Claude Heydemann
Cycles in strong oriented graphs. Discret. Math. 38 (2-3) (1982)
Marie-Claude Heydemann
Degrees and cycles in digraphs. Discret. Math. 41 (3) (1982)
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Longest paths in digraphs. Comb. 1 (4) (1981)
Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau
Girth in digraphs. J. Graph Theory 4 (3) (1980)
Marie-Claude Heydemann
On cycles and paths in digraphs. Discret. Math. 31 (2) (1980)
Marie-Claude Heydemann
Spectral characterization of some graphs. J. Comb. Theory, Ser. B 25 (3) (1978)
Jean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau
Line graphs of hypergraphs I. Discret. Math. 18 (3) (1977)