default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeirun Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Meirun Chen, Michel Habib, Cheng-Kuan Lin:
A novel edge connectivity based on edge partition for hypercube and folded hypercube. Appl. Math. Comput. 470: 128558 (2024)- [j18]Meirun Chen, Xiao-Yan Li, Cheng-Kuan Lin, Kung-Jui Pai:
A New Tree Structure for Local Diagnosis. J. Inf. Sci. Eng. 40(2): 231-244 (2024) - [j17]Meirun Chen, Cheng-Kuan Lin, Kung-Jui Pai:
A tree structure for local diagnosis in multiprocessor systems under the comparison model. Theor. Comput. Sci. 992: 114444 (2024) - 2023
- [j16]Meirun Chen, Michel Habib, Cheng-Kuan Lin
:
Diagnosability for a family of matching composition networks. J. Supercomput. 79(7): 7584-7608 (2023) - 2022
- [j15]Hong Chen, Meirun Chen, Michel Habib, Cheng-Kuan Lin:
Connectivity for some families of composition networks. Theor. Comput. Sci. 922: 361-367 (2022) - [j14]Meirun Chen, D. Frank Hsu, Cheng-Kuan Lin:
A new structure for a vertex to be locally t-diagnosable in large multiprocessor systems. Theor. Comput. Sci. 934: 81-90 (2022) - [c3]Meirun Chen, Cheng-Kuan Lin, Kung-Jui Pai:
A Tree Structure for Local Diagnosis in Multiprocessor Systems Under Comparison Model. ICS 2022: 49-60 - 2021
- [c2]Meirun Chen, D. Frank Hsu, Cheng-Kuan Lin:
A New Measure for Locally t-Diagnosable Under PMC Model. COCOON 2021: 306-316 - 2020
- [j13]Meirun Chen, Reza Naserasr:
Homomorphisms of partial t-trees and edge-colorings of partial 3-trees. J. Comb. Theory B 145: 1-31 (2020)
2010 – 2019
- 2018
- [j12]Naidan Ji, Meirun Chen:
Graphs with Almost All Edges in Long Cycles. Graphs Comb. 34(6): 1295-1314 (2018) - [j11]Meirun Chen, Reza Naserasr:
The optimal routing of augmented cubes. Inf. Process. Lett. 136: 59-63 (2018) - 2016
- [c1]Meirun Chen, Yang Yi:
Fault-Tolerant Adaptive Routing in n-D Mesh. WAIM Workshops 2016: 77-87 - 2014
- [j10]Meirun Chen, Shaohui Zhai:
Total and adjacent vertex-distinguishing total chromatic numbers of augmented cubes. Ars Comb. 114: 87-96 (2014) - [j9]Meirun Chen, Xiaofeng Guo, Hao Li, Lianzhu Zhang:
Total chromatic number of generalized Mycielski graphs. Discret. Math. 334: 48-51 (2014) - [j8]Yang Yi, Meirun Chen, Hao Li, Lian Li:
Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model. J. Appl. Math. 2014: 592638:1-592638:10 (2014) - 2013
- [j7]Meirun Chen, Xiaofeng Guo, Shaohui Zhai:
Total chromatic number of folded hypercubes. Ars Comb. 111: 265-272 (2013) - 2011
- [j6]Meirun Chen, Xiaofeng Guo, Shaohui Zhai:
The optimal strong radius and optimal strong diameter of the Cartesian product graphs. Appl. Math. Lett. 24(5): 657-660 (2011) - 2010
- [j5]Meirun Chen, Xiaofeng Guo:
Lower and Upper Orientable Strong Radius and Strong Diameter of the Cartesian Product of Complete Graphs. Ars Comb. 97 (2010) - [j4]Meirun Chen, Xiaofeng Guo:
On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition. Ars Comb. 97 (2010)
2000 – 2009
- 2009
- [j3]Meirun Chen, Xiaofeng Guo, Hao Li:
Lower and upper orientable strong diameters of graphs satisfying the Ore condition. Appl. Math. Lett. 22(7): 994-997 (2009) - [j2]Meirun Chen, Xiaofeng Guo:
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes. Inf. Process. Lett. 109(12): 599-602 (2009) - [j1]Meirun Chen, Jianguo Qian:
On f-fault tolerant arc-forwarding and optical indices of all-optical folded hypercubes. Inf. Process. Lett. 109(15): 828-831 (2009)
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:27 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:
