dblp.uni-trier.dewww.uni-trier.de

Min-Li Yu

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
11EEJean-Claude Bermond, Min-Li Yu: Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences. ADHOC-NOW 2008: 204-217
10EEFrédéric Havet, Min-Li Yu: (p, 1)-Total labelling of graphs. Discrete Mathematics 308(4): 496-513 (2008)
2007
9EEJean-Claude Bermond, Min-Li Yu: Vertex disjoint routings of cycles over tori. Networks 49(3): 217-225 (2007)
2006
8EEJean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu: Gathering Algorithms on Paths Under Interference Constraints. CIAC 2006: 115-126
2004
7EEJean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu: Grooming in unidirectional rings: K4-e designs. Discrete Mathematics 284(1-3): 57-62 (2004)
2003
6EER. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu: On Hamilton cycle decompositions of the tensor product of complete graphs. Discrete Mathematics 268(1-3): 49-58 (2003)
2000
5 Jean-Claude Bermond, Susan Marshall, Min-Li Yu: Improved Bounds for Gossiping in Mesh Bus Networks. Journal of Interconnection Networks 1(1): 1-19 (2000)
1999
4EEGary MacGilivray, Min-Li Yu: Generalized Partitions of Graphs. Discrete Applied Mathematics 91(1-3): 143-153 (1999)
1993
3EEAngelika Steger, Min-Li Yu: On induced matchings. Discrete Mathematics 120(1-3): 291-295 (1993)
2EEMin-Li Yu: On path factorizations of complete multipartite graphs. Discrete Mathematics 122(1-3): 325-333 (1993)
1992
1 Min-Li Yu: Resolvable Tree Designs. J. Comb. Theory, Ser. A 61(2): 302-308 (1992)

Coauthor Index

1R. Balakrishnan [6]
2Jean-Claude Bermond [5] [6] [7] [8] [9] [11]
3Charles J. Colbourn [7]
4Ricardo C. Corrêa [8]
5Frédéric Havet [10]
6Alan C. H. Ling [7]
7Gary MacGilivray [4]
8Susan Marshall [5]
9P. Paulraja [6]
10Angelika Steger [3]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)