The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Min-Li Yu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu
    Gathering Algorithms on Paths Under Interference Constraints. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:115-126 [Conf]
  2. Gary MacGilivray, Min-Li Yu
    Generalized Partitions of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:143-153 [Journal]
  3. R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu
    On Hamilton cycle decompositions of the tensor product of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:49-58 [Journal]
  4. Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu
    Grooming in unidirectional rings: K4-e designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:284, n:1-3, pp:57-62 [Journal]
  5. Min-Li Yu
    Resolvable Tree Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:2, pp:302-308 [Journal]
  6. Jean-Claude Bermond, Susan Marshall, Min-Li Yu
    Improved Bounds for Gossiping in Mesh Bus Networks. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2000, v:1, n:1, pp:1-19 [Journal]
  7. Angelika Steger, Min-Li Yu
    On induced matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:291-295 [Journal]
  8. Min-Li Yu
    On path factorizations of complete multipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:325-333 [Journal]

  9. Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences. [Citation Graph (, )][DBLP]


  10. (p, 1)-Total labelling of graphs. [Citation Graph (, )][DBLP]


  11. Optimal gathering protocols on paths under interference constraints. [Citation Graph (, )][DBLP]


  12. Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513]. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002