default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMin-Li Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j19]Frédéric Havet, Ana Karolinna Maia, Min-Li Yu:
Complexity of greedy edge-colouring. J. Braz. Comput. Soc. 21(1): 18:1-18:7 (2015)- [j18]Jean-Claude Bermond, Bi Li
, Nicolas Nisse, Hervé Rivano, Min-Li Yu:
Data gathering and personalized broadcasting in radio grids with interference. Theor. Comput. Sci. 562: 453-475 (2015) - 2010
- [j17]Jean-Claude Bermond, Min-Li Yu:
Optimal Gathering Algorithms in Multi-Hop Radio Tree-Networks with Interferences. Ad Hoc Sens. Wirel. Networks 9(1-2): 109-127 (2010) - [j16]Frédéric Havet, Min-Li Yu:
Corrigendum to "(p, 1)-total labelling of graphs" [Discrete Mathematics 308 (2008) 496-513]. Discret. Math. 310(15-16): 2219-2220 (2010) - 2009
- [j15]Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu:
Optimal gathering protocols on paths under interference constraints. Discret. Math. 309(18): 5574-5587 (2009) - 2008
- [j14]Frédéric Havet, Min-Li Yu:
(p, 1)-Total labelling of graphs. Discret. Math. 308(4): 496-513 (2008) - 2007
- [j13]Jean-Claude Bermond, Min-Li Yu:
Vertex disjoint routings of cycles over tori. Networks 49(3): 217-225 (2007) - 2004
- [j12]Jean-Claude Bermond, Charles J. Colbourn, Alan C. H. Ling, Min-Li Yu:
Grooming in unidirectional rings: K4-e designs. Discret. Math. 284(1-3): 57-62 (2004) - 2003
- [j11]R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu:
On Hamilton cycle decompositions of the tensor product of complete graphs. Discret. Math. 268(1-3): 49-58 (2003) - 2000
- [j10]Jean-Claude Bermond, Susan Marshall, Min-Li Yu:
Improved Bounds for Gossiping in Mesh Bus Networks. J. Interconnect. Networks 1(1): 1-19 (2000) - 1999
- [j9]Gary MacGilivray, Min-Li Yu:
Generalized Partitions of Graphs. Discret. Appl. Math. 91(1-3): 143-153 (1999) - [j8]Katherine Heinrich, Jiping Liu, Min-Li Yu:
P4-decompositions of regular graphs. J. Graph Theory 31(2): 135-143 (1999) - 1993
- [j7]Angelika Steger, Min-Li Yu:
On induced matchings. Discret. Math. 120(1-3): 291-295 (1993) - [j6]Min-Li Yu:
On path factorizations of complete multipartite graphs. Discret. Math. 122(1-3): 325-333 (1993) - [j5]Min-Li Yu:
On tree factorizations of Kn. J. Graph Theory 17(6): 713-725 (1993) - 1992
- [j4]Min-Li Yu:
Resolvable Tree Designs. J. Comb. Theory A 61(2): 302-308 (1992) - 1991
- [j3]Min-Li Yu:
Almost resolvable Pk-decompositions of complete graphs. J. Graph Theory 15(5): 523-541 (1991) - 1990
- [j2]Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu:
Existence of Resolvable Path Designs. Eur. J. Comb. 11(3): 205-211 (1990) - [j1]Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu:
On Resolvable Mixed Path Designs. Eur. J. Comb. 11(4): 313-318 (1990)
Conference and Workshop Papers
- 2008
- [c2]Jean-Claude Bermond, Min-Li Yu:
Optimal Gathering Algorithms in Multi-hop Radio Tree-Networks ith Interferences. ADHOC-NOW 2008: 204-217 - 2006
- [c1]Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu:
Gathering Algorithms on Paths Under Interference Constraints. CIAC 2006: 115-126
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
