Dominique Sotteau - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2002

On the injective chromatic number of graphsGena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau. DM, 256(1-2):179-192, 2002. [doi]

2001

Edge-disjoint spanners of complete bipartite graphsChristian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau. DM, 234(1-3):65-76, 2001. [doi]

All-to-All Optical Routing in Chordal Rings of Degree 4Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau. algorithmica, 31(2):155-178, 2001. [doi]

2000

Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1Jaroslav Opatrny, Dominique Sotteau. DAM, 98(3):237-254, 2000. [doi]

1999

Edge-disjoint spanners of complete graphs and complete digraphsChristian Laforest, Arthur L. Liestman, David Peleg, Thomas C. Shermer, Dominique Sotteau. DM, 203(1-3):133-159, 1999. [doi]

All-to-All Optical Routing in Optimal Chordal Rings of Degree FourLata Narayanan, Jaroslav Opatrny, Dominique Sotteau. soda 1999: 695-703 [doi]

1998

Embedding Complete Binary Trees Into Star and Pancake GraphsA. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau. mst, 31(3):279-305, 1998.

Cycles in the cube-connected cycles graphAnne Germa, Marie-Claude Heydemann, Dominique Sotteau. DAM, 83(1-3):135-155, 1998. [doi]

1997

Edge Disjoint Graph Spanners of Complete Graphs and Complete DigraphsChristian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau. hicss 1997: 191-199 [doi]

1996

Emulating Networks by Bus Networks: Application to Trees and HypermeshesDominique Barth, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau. sirocco 1996: 241-254

Spanners of Hypercube-Derived NetworksMarie-Claude Heydemann, Joseph G. Peters, Dominique Sotteau. siamdm, 9(1):37-54, 1996. [doi]

Embeddings of Complete Binary Trees into Extended Grids with Edge-congestion 1*Marie-Claude Heydemann, Dominique Sotteau, Jaroslav Opatrny. paapp, 8(3-4):333-354, 1996. [doi]

Gossiping in d-Dimensional Mesh-Bus NetworksAndré Hily, Dominique Sotteau. ppl, 6(1):101-113, 1996. [doi]

2-diameter of de Bruijn graphsQiao Li, Dominique Sotteau, Junming Xu. networks, 28(1):7-14, 1996. [doi]

DCC Linear Congruential Graphs: A New Class of Interconnection NetworksJaroslav Opatrny, Dominique Sotteau, N. Srinivasan, Krishnaiyan Thulasiraman. TC, 45(2):156-164, 1996.

1995

Embeddings of complete binary trees into star graphs with congestion 1Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau. hicss 1995: 546-554 [doi]

A Note on Recursive Properties of the de Bruijn, Kautz and FFT DigraphsMarie-Claude Heydemann, Dominique Sotteau. ipl, 53(5):255-259, 1995. [doi]

1994

1993

On the edge forwarding index problem for small graphsAbdelmadjid Bouabdallah, Dominique Sotteau. networks, 23(4):249-255, 1993. [doi]

Open ProblemsPierre Fraigniaud, Arthur L. Liestman, Dominique Sotteau. ppl, 3:507-524, 1993.

Symmetric routings of the hypercubeJean-Claude König, Dominique Sotteau. DM, 121(1-3):123-134, 1993. [doi]

1992

Embeddings of Hypercubes and Grids into de Bruijn GraphsMarie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau. icpp 1992: 28-37

Broadcasting and Spanning Trees in de Bruijn and Kautz NetworksMarie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau. DAM, 37/38:297-317, 1992. [doi]

Forwarding Indices of ::::k::::-Connected GraphsMarie-Claude Heydemann, J. C. Meyer, Jaroslav Opatrny, Dominique Sotteau. DAM, 37/38:287-296, 1992. [doi]

1991

Embeddings of Shuffle-Like Graphs in HyphercubesMarc Baumslag, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau. parle 1991: 179-190

1990

A parameter linked with G-factors and the binding numberOdile Favaron, Marie-Claude Heydemann, John-Jules Ch. Meyer, Dominique Sotteau. DM, 91(3):311-316, 1990. [doi]

1989

On forwarding indices of networksMarie-Claude Heydemann, John-Jules Ch. Meyer, Dominique Sotteau. DAM, 23(2):103-123, 1989. [doi]

On the existence of a matching orthogonal to a 2-factorizationMekkia Kouider, Dominique Sotteau. DM, 73(3):301-304, 1989. [doi]

1986

Digraphs without directed path of length two or threeDominique Sotteau, A. Pawel Wojda. DM, 58(1):105-108, 1986. [doi]

1985

About some cyclic properties in digraphsMarie-Claude Heydemann, Dominique Sotteau. JCT, 38(3):261-278, 1985. [doi]

1984

Number of arcs and cycles in digraphsMarie-Claude Heydemann, Dominique Sotteau. DM, 52(2-3):199-207, 1984. [doi]

1983

Short cycles in mediate graphsGena Hahn, Dominique Sotteau, H. Sun. DM, 44(3):281-284, 1983. [doi]

1981

Almost resolvable decomposition of K::n:::::*:::F. E. Bennett, Dominique Sotteau. JCT, 30(2):228-232, 1981. [doi]

Longest paths in digraphsJean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau. combinatorica, 1(4):337-341, 1981.

Decomposition of K::m, n::(K::m, n:::::*:::) into cycles (circuits) of length 2kDominique Sotteau. JCT, 30(1):75-81, 1981. [doi]

1980

Girth in digraphsJean-Claude Bermond, Anne Germa, Marie-Claude Heydemann, Dominique Sotteau. jgt, 4(3):337-341, 1980. [doi]

1979

Resolvable Decomposition of K::n::Jean-Claude Bermond, Anne Germa, Dominique Sotteau. JCT, 26(2):179-185, 1979.

1977

Line graphs of hypergraphs IJean-Claude Bermond, Marie-Claude Heydemann, Dominique Sotteau. DM, 18(3):235-241, 1977. [doi]

1976

n into circuits of odd lengthDominique Sotteau. DM, 15(2):185-191, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL