
Search the dblp DataBase
MinLi Yu:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 JeanClaude Bermond, Ricardo C. Corrêa, MinLi Yu
Gathering Algorithms on Paths Under Interference Constraints. [Citation Graph (0, 0)][DBLP] CIAC, 2006, pp:115126 [Conf]
 Gary MacGilivray, MinLi Yu
Generalized Partitions of Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:91, n:13, pp:143153 [Journal]
 R. Balakrishnan, JeanClaude Bermond, P. Paulraja, MinLi Yu
On Hamilton cycle decompositions of the tensor product of complete graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:268, n:13, pp:4958 [Journal]
 JeanClaude Bermond, Charles J. Colbourn, Alan C. H. Ling, MinLi Yu
Grooming in unidirectional rings: K_{4}e designs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:284, n:13, pp:5762 [Journal]
 MinLi Yu
Resolvable Tree Designs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1992, v:61, n:2, pp:302308 [Journal]
 JeanClaude Bermond, Susan Marshall, MinLi Yu
Improved Bounds for Gossiping in Mesh Bus Networks. [Citation Graph (0, 0)][DBLP] Journal of Interconnection Networks, 2000, v:1, n:1, pp:119 [Journal]
 Angelika Steger, MinLi Yu
On induced matchings. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:120, n:13, pp:291295 [Journal]
 MinLi Yu
On path factorizations of complete multipartite graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:122, n:13, pp:325333 [Journal]
Optimal Gathering Algorithms in Multihop Radio TreeNetworks ith Interferences. [Citation Graph (, )][DBLP]
(p, 1)Total labelling of graphs. [Citation Graph (, )][DBLP]
Optimal gathering protocols on paths under interference constraints. [Citation Graph (, )][DBLP]
Corrigendum to "(p, 1)total labelling of graphs" [Discrete Mathematics 308 (2008) 496513]. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.003secs
