default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarie-Claude Heydemann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j27]Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann:
Uniform emulations of Cartesian-product and Cayley graphs. Discret. Appl. Math. 116(1-2): 37-54 (2002)- 2001
- [j26]Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes:
Complete Rotations in Cayley Graphs. Eur. J. Comb. 22(2): 179-196 (2001) - [j25]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
- [j24]Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes:
Rotational Cayley Graphs on Transposition Generated Groups. Electron. Notes Discret. Math. 5: 177-180 (2000)
1990 – 1999
- 1998
- [j23]Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Cycles in the cube-connected cycles graph. Discret. Appl. Math. 83(1-3): 135-155 (1998) - [j22]Pavel Tvrdík, Rabah Harbane, Marie-Claude Heydemann:
Uniform homomorphisms of de Bruijn and Kautz networks. Discret. Appl. Math. 83(1-3): 279-301 (1998) - [j21]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
- [j20]Dominique Barth, Marie-Claude Heydemann:
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. Discret. Appl. Math. 77(2): 99-118 (1997) - [j19]Dominique Barth, Marie-Claude Heydemann:
A New Digraphs Composition with Applications to De Bruijn and Generalized De Bruijn Digraphs. Discret. Appl. Math. 80(1): 115 (1997) - 1996
- [j18]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) - [j17]Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau:
Spanners of Hypercube-Derived Networks. SIAM J. Discret. 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
- [j16]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
- [j15]Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embeddings of Hypercubes and Grids into de Bruijn Graphs. J. Parallel Distributed Comput. 23(1): 104-111 (1994) - [j14]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
- [j13]Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau:
Forwarding Indices of k-Connected Graphs. Discret. Appl. Math. 37/38: 287-296 (1992) - [j12]Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks. Discret. Appl. Math. 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
- [j11]Odile Favaron, Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau:
A parameter linked with G-factors and the binding number. Discret. Math. 91(3): 311-316 (1990)
1980 – 1989
- 1989
- [j10]Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau:
On forwarding indices of networks. Discret. Appl. Math. 23(2): 103-123 (1989) - 1985
- [j9]Marie-Claude Heydemann, Dominique Sotteau:
About some cyclic properties in digraphs. J. Comb. Theory B 38(3): 261-278 (1985) - 1984
- [j8]Marie-Claude Heydemann, Dominique Sotteau:
Number of arcs and cycles in digraphs. Discret. Math. 52(2-3): 199-207 (1984) - 1982
- [j7]Marie-Claude Heydemann:
Cycles in strong oriented graphs. Discret. Math. 38(2-3): 185-190 (1982) - [j6]Marie-Claude Heydemann:
Degrees and cycles in digraphs. Discret. Math. 41(3): 241-251 (1982) - 1981
- [j5]Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Longest paths in digraphs. Comb. 1(4): 337-341 (1981) - 1980
- [j4]Marie-Claude Heydemann:
On cycles and paths in digraphs. Discret. Math. 31(2): 217-219 (1980) - [j3]Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Girth in digraphs. J. Graph Theory 4(3): 337-341 (1980)
1970 – 1979
- 1978
- [j2]Marie-Claude Heydemann:
Spectral characterization of some graphs. J. Comb. Theory B 25(3): 307-312 (1978) - 1977
- [j1]Jean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau:
Line graphs of hypergraphs I. Discret. Math. 18(3): 235-241 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
