default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominique Sotteau
Person information
- affiliation: University of Paris-Sud, Laboratory for Computer Science (LRI), France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2002
[j34]Gena Hahn, Jan Kratochvíl
, Jozef Sirán, Dominique Sotteau:
On the injective chromatic number of graphs. Discret. Math. 256(1-2): 179-192 (2002)- 2001
- [j33]Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau:
All-to-All Optical Routing in Chordal Rings of Degree 4. Algorithmica 31(2): 155-178 (2001) - [j32]Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau:
Edge-disjoint spanners of complete bipartite graphs. Discret. Math. 234(1-3): 65-76 (2001) - 2000
- [j31]Jaroslav Opatrny, Dominique Sotteau:
Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1. Discret. Appl. Math. 98(3): 237-254 (2000)
1990 – 1999
- 1999
- [j30]Christian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau:
Edge-disjoint spanners of complete graphs and complete digraphs. Discret. Math. 203(1-3): 133-159 (1999) - [c8]Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau:
All-to-All Optical Routing in Optimal Chordal Rings of Degree Four. SODA 1999: 695-703 - 1998
- [j29]Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Cycles in the cube-connected cycles graph. Discret. Appl. Math. 83(1-3): 135-155 (1998) - [j28]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
- [c7]Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau:
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. HICSS (1) 1997: 191-199 - 1996
- [j27]Qiao Li, Dominique Sotteau, Junming Xu:
2-diameter of de Bruijn graphs. Networks 28(1): 7-14 (1996) - [j26]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) - [j25]André Hily, Dominique Sotteau:
Gossiping in d-Dimensional Mesh-Bus Networks. Parallel Process. Lett. 6(1): 101-113 (1996) - [j24]Marie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau:
Spanners of Hypercube-Derived Networks. SIAM J. Discret. Math. 9(1): 37-54 (1996) - [j23]Jaroslav Opatrny, Dominique Sotteau, N. Srinivasan, Krishnaiyan Thulasiraman:
DCC Linear Congruential Graphs: A New Class of Interconnection Networks. IEEE Trans. Computers 45(2): 156-164 (1996) - [c6]Dominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Emulating Networks by Bus Networks: Application to Trees and Hypermeshes. SIROCCO 1996: 241-254 - 1995
- [j22]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) - [c5]Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embeddings of complete binary trees into star graphs with congestion 1. HICSS (2) 1995: 546-554 - [e1]D. Frank Hsu, Arnold L. Rosenberg, Dominique Sotteau:
Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, February 7-9, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 21, DIMACS/AMS 1995, ISBN 978-0-8218-0238-0 [contents] - 1994
- [j21]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) - [j20]Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau, Jaroslav Opatrny:
Forwarding indices of consistent routings and their complexity. Networks 24(2): 75-82 (1994) - [c4]André Hily, Dominique Sotteau:
Communications in Bus Networks. Canada-France Conference on Parallel and Distributed Computing 1994: 197-206 - [c3]Abdelmadjid Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau:
Embedding Complete Binary Trees into Star Networks. MFCS 1994: 266-275 - 1993
- [j19]Jean-Claude König, Dominique Sotteau:
Symmetric routings of the hypercube. Discret. Math. 121(1-3): 123-134 (1993) - [j18]Abdelmadjid Bouabdallah, Dominique Sotteau:
On the edge forwarding index problem for small graphs. Networks 23(4): 249-255 (1993) - [j17]Pierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau:
Open Problems. Parallel Process. Lett. 3: 507-524 (1993) - 1992
- [j16]Marie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau:
Forwarding Indices of k-Connected Graphs. Discret. Appl. Math. 37/38: 287-296 (1992) - [j15]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
- [j14]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
- [j13]Marie-Claude Heydemann, J. C. Meyer, Dominique Sotteau:
On forwarding indices of networks. Discret. Appl. Math. 23(2): 103-123 (1989) - [j12]Mekkia Kouider, Dominique Sotteau:
On the existence of a matching orthogonal to a 2-factorization. Discret. Math. 73(3): 301-304 (1989) - 1986
- [j11]Dominique Sotteau, A. Pawel Wojda:
Digraphs without directed path of length two or three. Discret. Math. 58(1): 105-108 (1986) - 1985
- [j10]Marie-Claude Heydemann, Dominique Sotteau:
About some cyclic properties in digraphs. J. Comb. Theory B 38(3): 261-278 (1985) - 1984
- [j9]Marie-Claude Heydemann, Dominique Sotteau:
Number of arcs and cycles in digraphs. Discret. Math. 52(2-3): 199-207 (1984) - 1983
- [j8]Gena Hahn, Dominique Sotteau, H. Sun:
Short cycles in mediate graphs. Discret. Math. 44(3): 281-284 (1983) - 1981
- [j7]Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Longest paths in digraphs. Comb. 1(4): 337-341 (1981) - [j6]Dominique Sotteau:
Decomposition of Km, n(Km, n*) into cycles (circuits) of length 2k. J. Comb. Theory B 30(1): 75-81 (1981) - [j5]Frank E. Bennett, Dominique Sotteau:
Almost resolvable decomposition of Kn*. J. Comb. Theory B 30(2): 228-232 (1981) - 1980
- [j4]Jean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau:
Girth in digraphs. J. Graph Theory 4(3): 337-341 (1980)
1970 – 1979
- 1979
- [j3]Jean-Claude Bermond, Anne Germa, Dominique Sotteau:
Resolvable Decomposition of Kn. J. Comb. Theory A 26(2): 179-185 (1979) - 1977
- [j2]Jean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau:
Line graphs of hypergraphs I. Discret. Math. 18(3): 235-241 (1977) - 1976
- [j1]Dominique Sotteau:
Decomposition of k*n into circuits of odd length. Discret. Math. 15(2): 185-191 (1976)
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 2025-01-21 00:10 CET 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:
