default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXie-Bin Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j21]Xie-Bin Chen:
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges. Inf. Process. Lett. 116(2): 107-110 (2016)- [j20]Xie-Bin Chen:
Hamiltonicity of hypercubes with faulty vertices. Inf. Process. Lett. 116(5): 343-346 (2016) - [j19]Xie-Bin Chen:
Paired 2-disjoint path covers of faulty k-ary n-cubes. Theor. Comput. Sci. 609: 494-499 (2016) - 2014
- [j18]Xie-Bin Chen:
A fast algorithm for computing the determinants of banded circulant matrices. Appl. Math. Comput. 229: 201-207 (2014) - [j17]Xiao-Pan Yao, Xie-Bin Chen:
Fault-free cycles passing through prescribed a linear forest in a hypercube with faulty edges. Ars Comb. 116: 213-223 (2014) - [j16]Xie-Bin Chen:
Panconnectivity and edge-pancyclicity of multidimensional torus networks. Discret. Appl. Math. 178: 33-45 (2014) - 2013
- [j15]Xie-Bin Chen:
Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph. Inf. Sci. 235: 341-346 (2013) - [j14]Xie-Bin Chen:
Paired many-to-many disjoint path covers of the hypercubes. Inf. Sci. 236: 218-223 (2013) - [j13]Xie-Bin Chen:
The 2-path-bipanconnectivity of hypercubes. Inf. Sci. 239: 283-293 (2013) - [j12]Xie-Bin Chen:
Construction of optimal independent spanning trees on folded hypercubes. Inf. Sci. 253: 147-156 (2013) - 2012
- [j11]Xie-Bin Chen:
Paired many-to-many disjoint path covers of hypercubes with faulty edges. Inf. Process. Lett. 112(3): 61-66 (2012) - 2011
- [j10]Xie-Bin Chen:
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs. Inf. Process. Lett. 111(5): 235-238 (2011) - 2010
- [j9]Xie-Bin Chen:
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs. Inf. Process. Lett. 110(6): 203-205 (2010) - [j8]Xie-Bin Chen:
Cycles passing through a prescribed path in a hypercube with faulty edges. Inf. Process. Lett. 110(16): 625-629 (2010) - [j7]Xie-Bin Chen:
Edge-fault-tolerant diameter and bipanconnectivity of hypercubes. Inf. Process. Lett. 110(24): 1088-1092 (2010)
2000 – 2009
- 2009
- [j6]Xie-Bin Chen:
Some results on topological properties of folded hypercubes. Inf. Process. Lett. 109(8): 395-399 (2009) - [j5]Xie-Bin Chen:
On path bipancyclicity of hypercubes. Inf. Process. Lett. 109(12): 594-598 (2009) - [j4]Xie-Bin Chen:
Hamiltonian paths and cycles passing through a prescribed path in hypercubes. Inf. Process. Lett. 110(2): 77-82 (2009) - [j3]Xie-Bin Chen:
Many-to-many disjoint paths in faulty hypercubes. Inf. Sci. 179(18): 3110-3115 (2009) - 2008
- [j2]Wen-Qing Wang, Xie-Bin Chen:
A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges. Inf. Process. Lett. 107(6): 205-210 (2008) - 2007
- [j1]Xie-Bin Chen:
Cycles passing through prescribed edges in a hypercube with some faulty edges. Inf. Process. Lett. 104(6): 211-215 (2007)
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-04-25 05:57 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:
