Min-Li Yu

20 papers C 1Journal 18Unranked 1
YearRankTypeTitle / Venue / Authors
2015 J jnl
Complexity of greedy edge-colouring.
J. Braz. Comput. Soc.
Frédéric Havet, Ana Karolinna Maia, Min-Li Yu
2015 J jnl
Data gathering and personalized broadcasting in radio grids with interference.
Theor. Comput. Sci.
Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, Min-Li Yu
2010 J jnl
Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513].
Discret. Math.
Frédéric Havet, Min-Li Yu
2010 J jnl
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences.
Ad Hoc Sens. Wirel. Networks
Jean-Claude Bermond, Min-Li Yu
2009 J jnl
Optimal gathering protocols on paths under interference constraints.
Discret. Math.
Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu
2008 J jnl
(p, 1)-Total labelling of graphs.
Discret. Math.
Frédéric Havet, Min-Li Yu
2008 — conf
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences.
ADHOC-NOW
Jean-Claude Bermond, Min-Li Yu
2007 J jnl
Vertex disjoint routings of cycles over tori.
Networks
Jean-Claude Bermond, Min-Li Yu
2006 C conf
Gathering Algorithms on Paths Under Interference Constraints.
CIAC
Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu
2004 J jnl
Grooming in unidirectional rings:
Discret. Math.
Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu
2003 J jnl
On Hamilton cycle decompositions of the tensor product of complete graphs.
Discret. Math.
R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu
2000 J jnl
Improved Bounds for Gossiping in Mesh Bus Networks.
J. Interconnect. Networks
Jean-Claude Bermond, Susan Marshall, Min-Li Yu
1999 J jnl
Generalized Partitions of Graphs.
Discret. Appl. Math.
Gary MacGilivray, Min-Li Yu
1993 J jnl
On induced matchings.
Discret. Math.
Angelika Steger, Min-Li Yu
1993 J jnl
On path factorizations of complete multipartite graphs.
Discret. Math.
Min-Li Yu
1993 J jnl
On tree factorizations of
J. Graph Theory
Min-Li Yu
1992 J jnl
Resolvable Tree Designs.
J. Comb. Theory A
Min-Li Yu
1991 J jnl
Almost resolvable
J. Graph Theory
Min-Li Yu
1990 J jnl
Existence of Resolvable Path Designs.
Eur. J. Comb.
Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu
1990 J jnl
On Resolvable Mixed Path Designs.
Eur. J. Comb.
Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu