Marie-Claude Heydemann

2002
29		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
28	EE	Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes: Complete Rotations in Cayley Graphs. Eur. J. Comb. 22(2): 179-196 (2001)
27	EE	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
26	EE	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
25	EE	Anne Germa, Marie-Claude Heydemann, Dominique Sotteau: Cycles in the cube-connected cycles graph. Discrete Applied Mathematics 83(1-3): 135-155 (1998)
24	EE	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)
23		A. 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
22	EE	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)
21	EE	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
20		Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau: Emulating Networks by Bus Networks: Application to Trees and Hypermeshes. SIROCCO 1996: 241-254
19	EE	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)
18	EE	Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau: Spanners of Hypercube-Derived Networks. SIAM J. Discrete Math. 9(1): 37-54 (1996)
1995
17	EE	Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of complete binary trees into star graphs with congestion 1. HICSS (2) 1995: 546-554
16	EE	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)
1994
15		A. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embedding Complete Binary Trees into Star Networks. MFCS 1994: 266-275
14		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)
1992
13		Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of Hypercubes and Grids into de Bruijn Graphs. ICPP (3) 1992: 28-37
12	EE	Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau: Forwarding Indices of k-Connected Graphs. Discrete Applied Mathematics 37/38: 287-296 (1992)
11	EE	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)
1991
10		Marc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau: Embeddings of Shuffle-Like Graphs in Hyphercubes. PARLE (1) 1991: 179-190
1990
9	EE	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
8	EE	Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau: On forwarding indices of networks. Discrete Applied Mathematics 23(2): 103-123 (1989)
1985
7	EE	Marie-Claude Heydemann, Dominique Sotteau: About some cyclic properties in digraphs. J. Comb. Theory, Ser. B 38(3): 261-278 (1985)
1984
6	EE	Marie-Claude Heydemann, Dominique Sotteau: Number of arcs and cycles in digraphs. Discrete Mathematics 52(2-3): 199-207 (1984)
1982
5	EE	Marie-Claude Heydemann: Cycles in strong oriented graphs. Discrete Mathematics 38(2-3): 185-190 (1982)
4	EE	Marie-Claude Heydemann: Degrees and cycles in digraphs. Discrete Mathematics 41(3): 241-251 (1982)
1981
3		Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau: Longest paths in digraphs. Combinatorica 1(4): 337-341 (1981)
1980
2	EE	Marie-Claude Heydemann: On cycles and paths in digraphs. Discrete Mathematics 31(2): 217-219 (1980)
1978
1	EE	Marie-Claude Heydemann: Spectral characterization of some graphs. J. Comb. Theory, Ser. B 25(3): 307-312 (1978)

Coauthor Index

1	Dominique Barth	[20] [21] [22] [29]
2	Marc Baumslag	[10]
3	Jean-Claude Bermond	[3]
4	A. Bouabdallah	[15] [23]
5	Odile Favaron	[9]
6	Paraskevi Fragopoulou	[29]
7	Anne Germa	[3] [20] [25]
8	Rabah Harbane	[24] [27]
9	Nausica Marlin	[26] [28]
10	J. C. Meyer	[8] [9] [12]
11	Jaroslav Opatrny	[10] [11] [12] [13] [14] [15] [17] [19] [23]
12	Stéphane Pérennes (Stephane Perennes)	[26] [28]
13	Joseph G. Peters	[18]
14	Dominique Sotteau	[3] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19] [20] [23] [25]
15	Pavel Tvrdík	[24]

Colors in the list of coauthors