| 2002 | ||
|---|---|---|
| j25 | Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann: Uniform emulations of Cartesian-product and Cayley graphs. Discrete Applied Mathematics 116(1-2): 37-54 (2002) | |
| 2001 | ||
| j24 | Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes: Complete Rotations in Cayley Graphs. Eur. J. Comb. 22(2): 179-196 (2001) | |
| j23 | Rabah Harbane, Marie-Claude Heydemann: Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays. Theor. Comput. Sci. 263(1-2): 173-189 (2001) | |
| 2000 | ||
| j22 | Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes: Rotational Cayley Graphs on Transposition Generated Groups. Electronic Notes in Discrete Mathematics 5: 177-180 (2000) | |
| 1998 | ||
| j21 | Anne Germa, Marie-Claude Heydemann, Dominique Sotteau: Cycles in the cube-connected cycles graph. Discrete Applied Mathematics 83(1-3): 135-155 (1998) | |
| j20 | Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann: Uniform homomorphisms of de Bruijn and Kautz networks. Discrete Applied Mathematics 83(1-3): 279-301 (1998) | |
| j19 | Abdelmadjid 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 | ||
| j18 | Dominique Barth, Marie-Claude Heydemann: A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. Discrete Applied Mathematics 77(2): 99-118 (1997) | |
| j17 | Dominique Barth, Marie-Claude Heydemann: A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. Discrete Applied Mathematics 80(1): 115 (1997) | |
| 1996 | ||
| j16 | 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) | |
| j15 | Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau: Spanners of Hypercube-Derived Networks. SIAM J. Discrete Math. 9(1): 37-54 (1996) | |
| c5 | Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau: Emulating Networks by Bus Networks: Application to Trees and Hypermeshes. SIROCCO 1996: 241-254 | |
| 1995 | ||
| j14 | 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) | |
| c4 | Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of complete binary trees into star graphs with congestion 1. HICSS (2) 1995: 546-554 | |
| 1994 | ||
| j13 | 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) | |
| j12 | Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau, Jaroslav Opatrny: Forwarding indices of consistent routings and their complexity. Networks 24(2): 75-82 (1994) | |
| c3 | Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embedding Complete Binary Trees into Star Networks. MFCS 1994: 266-275 | |
| 1992 | ||
| j11 | Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau: Forwarding Indices of k-Connected Graphs. Discrete Applied Mathematics 37/38: 287-296 (1992) | |
| j10 | 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) | |
| c2 | Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of Hypercubes and Grids into de Bruijn Graphs. ICPP (3) 1992: 28-37 | |
| 1991 | ||
| c1 | Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of Shuffle-Like Graphs in Hyphercubes. PARLE (1) 1991: 179-190 | |
| 1990 | ||
| j9 | 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 | ||
| j8 | Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau: On forwarding indices of networks. Discrete Applied Mathematics 23(2): 103-123 (1989) | |
| 1985 | ||
| j7 | Marie-Claude Heydemann, Dominique Sotteau: About some cyclic properties in digraphs. J. Comb. Theory, Ser. B 38(3): 261-278 (1985) | |
| 1984 | ||
| j6 | Marie-Claude Heydemann, Dominique Sotteau: Number of arcs and cycles in digraphs. Discrete Mathematics 52(2-3): 199-207 (1984) | |
| 1982 | ||
| j5 | Marie-Claude Heydemann: Cycles in strong oriented graphs. Discrete Mathematics 38(2-3): 185-190 (1982) | |
| j4 | ||
| 1981 | ||
| j3 | Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau: Longest paths in digraphs. Combinatorica 1(4): 337-341 (1981) | |
| 1980 | ||
| j2 | ||
| 1978 | ||
| j1 | Marie-Claude Heydemann: Spectral characterization of some graphs. J. Comb. Theory, Ser. B 25(3): 307-312 (1978) | |
Colors in the list of coauthors
Last update Sun May 26 06:40:00 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page