Publications of Min-Li Yu
BACK TO COATI PUBLICATION INDEX
Publications of Min-Li Yu
-
Jean-Claude Bermond,
Bi Li,
Nicolas Nisse,
Hervé Rivano,
and Min-Li Yu.
Data gathering and personalized broadcasting in radio grids with interference.
Journal of Theoretical Computer Science (TCS),
562:453-475,
2015.
[WWW
] [PDF
]
Keywords:
Gathering,
Personalized broadcasting,
Interference,
Grid,
Radio networks.
[Abstract] [bibtex-entry]
-
Frédéric Havet,
A Karolinna Maia,
and Min-Li Yu.
Complexity of greedy edge-colouring.
Journal of the Brazilian Computer Society,
21(18),
2015.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond and M-L. Yu.
Optimal gathering algorithms in multi-hop radio tree networks with interferences.
Ad Hoc and Sensor Wireless Networks,
9(1-2):109-128,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
R. Correa,
and M-L. Yu.
Optimal Gathering Protocols on Paths under Interference Constraints.
Discrete Mathematics,
309(18):5574-5587,
September 2009.
Note: A preliminary version has been presented at CIAC06.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet and M-L. Yu.
$(p,1)$-total labelling of graphs.
Discrete Mathematics,
308(4):496--513,
February 2008.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond and M-L. Yu.
Vertex disjoint routings of cycles over tori.
Networks,
49(3):217-225,
2007.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
C.J. Colbourn,
A. Ling,
and M-L. Yu.
Grooming in unidirectional rings : $K_4 -e$ designs.
Discrete Mathematics, Lindner's Volume,
284(1-3):57--62,
2004.
[PDF
] [bibtex-entry]
-
R. Balakhrishnan,
J-C. Bermond,
P. Paulraja,
and M-L. Yu.
On Hamilton cycle decompositions of the tensor product of complete graphs.
Discrete Mathematics,
268:49--58,
2003.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
and M-L. Yu.
On DRC-Covering of $K_n$ by cycles.
Journal of Combinatorial Designs,
11(2):100-112,
2003.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
S. Marshall,
and M-L. Yu.
Improved bounds for gossiping in mesh-bus networks.
JOIN,
1(1):1-19,
2000.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
K. Heinrich,
and M-L. Yu.
Existence of resolvable path designs.
Journal Europeen de Combinatoire,
11:205--211,
1990.
[bibtex-entry]
-
J-C. Bermond,
K. Heinrich,
and M-L. Yu.
On resolvable mixed path designs.
Journal Europeen de Combinatoire,
11:313--318,
1990.
[bibtex-entry]
-
J-C. Bermond and M-L. Yu.
Optimal gathering algorithms in multi-hop radio tree networks with interferences.
In Proceedings of the 7th international conference on Ad Hoc Networks and Wireless (AdHoc-Now),
volume 5198 of Lecture Notes in Computer Science,
pages 204-217,
September 2008.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
R. Corrêa,
and M-L. Yu.
Gathering algorithms on paths under interference constraints.
In 6th Conference on Algorithms and Complexity,
volume 3998 of Lecture Notes in Computer Science,
Roma, Italy,
pages 115--126,
May 2006.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Bermond,
B. Li,
N. Nisse,
H. Rivano,
and M-L. Yu.
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences.
Research Report RR-8218,
INRIA,
2013.
[WWW
] [PDF
] [bibtex-entry]
-
F. Havet,
A. K. Maia,
and M-L. Yu.
Complexity of greedy edge-colouring.
Technical report RR-8171,
INRIA,
December 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
A. Jean-Marie,
D. Mazauric,
and M-L. Yu.
Well Balanced Designs for Data Placement.
Research Report 7725,
INRIA,
09 2011.
[WWW
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
R. Correa,
and M-L. Yu.
Optimal Gathering Protocols on Paths under Interference Constraints.
Technical report inria-00168162,
HAL,
August 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet and M-L. Yu.
On $(d,1)$-total labelling of graphs.
Rapport de recherche INRIA,
Projet MASCOTTE,
Sophia Antipolis,
November 2002.
[bibtex-entry]
-
J-C. Bermond,
D. Coudert,
and M-L. Yu.
On DRC-Covering of $K_n$ by cycles.
Technical report,
INRIA Research Report RR-4299, I3S Research Report I3S/RR-2002-30-FR,
2001.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:47 2022
