default search action
Zhidan Yan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Zhidan Yan
, Shiyan Deng
An ADRC Strategy With Sequential Output Stacking Extended State Observers to Evaluate Hydraulic Torque for a Continuous-Wave Pulse Generator. IEEE Trans. Ind. Informatics 20(3): 4259-4270 (2024) - 2022
- [j16]Zhidan Yan
The smallest pair of cospectral cubic graphs with different chromatic indexes. Discret. Appl. Math. 309: 265-268 (2022) - 2021
- [j15]Xiang Shi
High-performance vibration isolation technique using passive negative stiffness and semiactive damping. Comput. Aided Civ. Infrastructure Eng. 36(8): 1034-1055 (2021) - [j14]Zhidan Yan
An effective compression algorithm for real-time transmission data using predictive coding with mixed models of LSTM and XGBoost. Neurocomputing 462: 247-259 (2021) - 2020
- [j13]Wei Wang
Colorings versus list colorings of uniform hypergraphs. J. Graph Theory 95(3): 384-397 (2020)
2010 – 2019
- 2017
- [j12]Wei Wang
Towards a Version of Ohba's Conjecture for Improper Colorings. Graphs Comb. 33(2): 489-501 (2017) - [j11]Wei Wang
When does the list-coloring function of a graph equal its chromatic polynomial. J. Comb. Theory B 122: 543-549 (2017) - 2015
- [j10]Zhidan Yan
Equitable colorings of Cartesian products with balanced complete multipartite graphs. Discret. Appl. Math. 180: 200-203 (2015) - [j9]Wei Wang
A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs. Graphs Comb. 31(5): 1779-1787 (2015) - [j8]Zhidan Yan
On Improperly Chromatic-Choosable Graphs. Graphs Comb. 31(5): 1807-1814 (2015) - 2014
- [j7]Wei Wang, Zhidan Yan:
Hamiltonicity of the Inner Power of a Cycle. Ars Comb. 113: 281-288 (2014) - [j6]Zhidan Yan, Wei Wang:
Equitable chromatic threshold of direct products of complete graphs. Ars Comb. 114: 235-243 (2014) - [j5]Zhidan Yan
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs. Discret. Appl. Math. 162: 328-333 (2014) - [j4]Wei Wang
On r-equitable chromatic threshold of Kronecker products of complete graphs. Discret. Appl. Math. 175: 129-134 (2014) - 2013
- [j3]Wei Wang
Connectivity of Kronecker products with complete multipartite graphs. Discret. Appl. Math. 161(10-11): 1655-1659 (2013) - [j2]Wei Wang
On the Edge Connectivity of Direct Products with Dense Graphs. Graphs Comb. 29(5): 1569-1575 (2013) - [i1]Wei Wang, Zhidan Yan, Xin Zhang:
On r-equitable chromatic threshold of Kronecker products of complete graphs. CoRR abs/1310.2188 (2013) - 2012
- [j1]Wei Wang
Connectivity of Kronecker products by K2. Appl. Math. Lett. 25(2): 172-174 (2012) - [c1]Zhidan Yan
The Contourlet-based structural similarity for image quality evaluation. BMEI 2012: 383-386
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 20:25 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: