Dominique Sotteau

Affiliations:
  • University of Paris-Sud, Laboratory for Computer Science (LRI), France


According to our database1, Dominique Sotteau authored at least 41 papers between 1976 and 2002.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2002
On the injective chromatic number of graphs.
Discret. Math., 2002

2001
Edge-disjoint spanners of complete bipartite graphs.
Discret. Math., 2001

All-to-All Optical Routing in Chordal Rings of Degree 4.
Algorithmica, 2001

2000
Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1.
Discret. Appl. Math., 2000

1999
Edge-disjoint spanners of complete graphs and complete digraphs.
Discret. Math., 1999

All-to-All Optical Routing in Optimal Chordal Rings of Degree Four.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Embedding Complete Binary Trees Into Star and Pancake Graphs.
Theory Comput. Syst., 1998

Cycles in the cube-connected cycles graph.
Discret. Appl. Math., 1998

1997
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs.
Proceedings of the 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 1997

1996
DCC Linear Congruential Graphs: A New Class of Interconnection Networks.
IEEE Trans. Computers, 1996

Spanners of Hypercube-Derived Networks.
SIAM J. Discret. Math., 1996

Gossiping in d-Dimensional Mesh-Bus Networks.
Parallel Process. Lett., 1996

Embeddings of Complete Binary Trees into Extended Grids with Edge-congestion 1*.
Parallel Algorithms Appl., 1996

2-diameter of de Bruijn graphs.
Networks, 1996

Emulating Networks by Bus Networks: Application to Trees and Hypermeshes.
Proceedings of the SIROCCO'96, 1996

1995
A Note on Recursive Properties of the de Bruijn, Kautz and FFT Digraphs.
Inf. Process. Lett., 1995

Embeddings of complete binary trees into star graphs with congestion 1.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994
Forwarding indices of consistent routings and their complexity.
Networks, 1994

Embeddings of Hypercubes and Grids into de Bruijn Graphs.
J. Parallel Distributed Comput., 1994

Embedding Complete Binary Trees into Star Networks.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Communications in Bus Networks.
Proceedings of the Parallel and Distributed Computing, 1994

1993
Open Problems.
Parallel Process. Lett., 1993

On the edge forwarding index problem for small graphs.
Networks, 1993

Symmetric routings of the hypercube.
Discret. Math., 1993

1992
Broadcasting and Spanning Trees in de Bruijn and Kautz Networks.
Discret. Appl. Math., 1992

Forwarding Indices of <i>k</i>-Connected Graphs.
Discret. Appl. Math., 1992

1991
Embeddings of Shuffle-Like Graphs in Hyphercubes.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

1990
A parameter linked with G-factors and the binding number.
Discret. Math., 1990

1989
On the existence of a matching orthogonal to a 2-factorization.
Discret. Math., 1989

On forwarding indices of networks.
Discret. Appl. Math., 1989

1986
Digraphs without directed path of length two or three.
Discret. Math., 1986

1985
About some cyclic properties in digraphs.
J. Comb. Theory B, 1985

1984
Number of arcs and cycles in digraphs.
Discret. Math., 1984

1983
Short cycles in mediate graphs.
Discret. Math., 1983

1981
Decomposition of K<sub>m, n</sub>(K<sub>m, n</sub><sup>*</sup>) into cycles (circuits) of length 2k.
J. Comb. Theory B, 1981

Almost resolvable decomposition of K<sub>n</sub><sup>*</sup>.
J. Comb. Theory B, 1981

Longest paths in digraphs.
Comb., 1981

1980
Girth in digraphs.
J. Graph Theory, 1980

1979
Resolvable Decomposition of K<sub>n</sub>.
J. Comb. Theory A, 1979

1977
Line graphs of hypergraphs I.
Discret. Math., 1977

1976
Decomposition of k<sup>*</sup><sub>n</sub> into circuits of odd length.
Discret. Math., 1976


  Loading...