default search action
Yujun Yang
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j38]Wensheng Sun, Yujun Yang, Shou-Jun Xu
:
Resistance distance and Kirchhoff index of unbalanced blowups of graphs. Discret. Math. 348(3): 114327 (2025) - 2024
- [j37]Xiaoxu Ma, Yujun Yang
Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink. Appl. Math. Comput. 475: 128722 (2024) - [j36]Yimei Yang, Jinping Liu, Yujun Yang, Lihui Cen:
Dual-stream fusion network with multi-head self-attention for multi-modal fake news detection. Appl. Soft Comput. 167: 112358 (2024) - [j35]Yu Zhang, Jun Shan, Yujun Yang, Jingzhe Wang, Gang Li
Combined control of rehabilitation wheelchair using periocular electromyography and electroencephalography. Biomed. Signal Process. Control. 90: 105854 (2024) - [j34]Wensheng Sun
On the Resistance Distance and Kirchhoff Index of Kn-chain(Ring) Network. Circuits Syst. Signal Process. 43(8): 4728-4749 (2024) - [j33]Yujun Yang
On two conjectures concerning spanning tree edge dependences of graphs. Discret. Appl. Math. 344: 32-42 (2024) - [j32]Na Gao, Yue Qiao, Yuan Wang, Jun Wang
Orientation Dependence of High-Order Harmonic Generation from HeH2+ in a Corotating Two-Color Circularly Polarized Laser Field. Symmetry 16(2): 185 (2024) - 2023
- [j31]Wensheng Sun, Yujun Yang
Extremal pentagonal chains with respect to the Kirchhoff index. Appl. Math. Comput. 437: 127534 (2023) - [j30]Wensheng Sun, Yujun Yang
Solution to a conjecture on resistance diameter of lexicographic product of paths. Discret. Appl. Math. 337: 139-148 (2023) - [j29]Wendi Lan
High-Intensity Harmonic Generation with Energy Tunability Produced by Robust Two-Color Linearly Polarized Laser Fields. Symmetry 15(3): 580 (2023) - [j28]Simeng Song, Linyan Wu, Yue Qiao, Shushan Zhou, Jun Wang
Investigation of the Spatio-Temporal Characteristics of High-Order Harmonic Generation Using a Bohmian Trajectory Scheme. Symmetry 15(3): 581 (2023) - [j27]Siqi Wei, Yun Pan, Yue Qiao, Shushan Zhou, Haiying Yuan, Jun Wang
Theoretical Simulation of the High-Order Harmonic Generated from Neon Atom Irradiated by the Intense Laser Pulse. Symmetry 15(3): 636 (2023) - [j26]Tingting Fu, Fuming Guo, Jun Wang
Waveform Modulation of High-Order Harmonics Generated from an Atom Irradiated by a Laser Pulse and a Weak Orthogonal Electrostatic Field. Symmetry 15(4): 901 (2023) - [c8]Haotian Zhu
"Research of the Smart \"Farmer\" System and Rural Land Risk Prediction". ICMLCA 2023: 293-299 - 2022
- [j25]Jianxin Wei
Fibonacci and Lucas p-cubes. Discret. Appl. Math. 322: 365-383 (2022) - [j24]Yujun Yang
Minimal hexagonal chains with respect to the Kirchhoff index. Discret. Math. 345(12): 113099 (2022) - [j23]Yanzuo Chen, Xuxu Shen, Wendi Lan
The High-Order Harmonic Generation from Atom Driven by Co-Rotating Laser Pulses Composed of Fundamental Frequency and High Frequency. Symmetry 14(3): 519 (2022) - [c7]Yujun Yang
Research on the Reform and Construction of Computer Basic Courses Based on Big Data. ICCSE (2) 2022: 53-61 - [c6]Yimei Yang
Research on College Students' Network Security Education Under the Background of Ideological and Political Education. ICCSE (2) 2022: 75-82 - [c5]Yiwen Liu, Yuanquan Shi
A Study on Random Differentiation Methods for Homework Based on Fuzzy Test. ICCSE (2) 2022: 102-110 - 2021
- [j22]Wang Zhou
Leverage side information for top-N recommendation with latent Gaussian process. Concurr. Comput. Pract. Exp. 33(12) (2021) - [j21]Wang Zhou, Yujun Yang, Yajun Du, Amin Ul Haq:
Pairwise deep learning to rank for top-N recommendation. J. Intell. Fuzzy Syst. 40(6): 10969-10980 (2021) - [j20]Yujun Yang
Research on a hybrid prediction model for stock price based on long short-term memory and variational mode decomposition. Soft Comput. 25(21): 13513-13531 (2021) - [c4]Yimei Yang, Yujun Yang, Wei Li:
Research on the Teaching of Network Engineering Training Courses Under the Online Teaching Mode in the Era of Big Data. ICCSE 2021: 598-601 - 2020
- [j19]Yujun Yang
Hybrid Method for Short-Term Time Series Forecasting Based on EEMD. IEEE Access 8: 61915-61928 (2020) - [j18]Yujun Yang
Hybrid Prediction Method for Wind Speed Combining Ensemble Empirical Mode Decomposition and Bayesian Ridge Regression. IEEE Access 8: 71206-71218 (2020) - [j17]Yujun Yang
Resistance Distances and Kirchhoff Indices Under Graph Operations. IEEE Access 8: 95650-95656 (2020) - [j16]Yujun Yang
A Hybrid Prediction Method for Stock Price Using LSTM and Ensemble EMD. Complex. 2020: 6431712:1-6431712:16 (2020) - [j15]Jianxin Wei
Circular embeddability of isometric words. Discret. Math. 343(10): 112024 (2020)
2010 – 2019
- 2019
- [j14]Jianxin Wei
A characterization of non-isometric binary words. Eur. J. Comb. 78: 121-133 (2019) - 2018
- [j13]Yujun Yang
Solution to a conjecture on a Nordhaus-Gaddum type result for the Kirchhoff index. Appl. Math. Comput. 332: 241-249 (2018) - [j12]Yujun Yang, Dong Ye
Inverses of Bipartite Graphs. Comb. 38(5): 1251-1263 (2018) - [j11]Yujun Yang
Some spectral invariants of the neighborhood corona of graphs. Discret. Appl. Math. 247: 300-308 (2018) - 2017
- [j10]Jianxin Wei
The self-concatenation of isometric strings is isometric. Discret. Math. 340(8): 1844-1850 (2017) - [j9]Jianxin Wei
Infinite families of 2-isometric and not 3-isometric binary words. Theor. Comput. Sci. 696: 1-10 (2017) - 2016
- [j8]Kinkar Chandra Das, Kexiang Xu
Nordhaus-Gaddum-type results for resistance distance-based graph invariants. Discuss. Math. Graph Theory 36(3): 695-707 (2016) - 2015
- [j7]Yujun Yang
Resistance distance-based graph invariants of subdivisions and triangulations of graphs. Discret. Appl. Math. 181: 260-274 (2015) - 2014
- [j6]Yujun Yang:
The Kirchhoff index of subdivisions of graphs. Discret. Appl. Math. 171: 153-157 (2014) - [j5]Yujun Yang:
On a new cyclicity measure of graphs - The global cyclicity index. Discret. Appl. Math. 172: 88-97 (2014) - [j4]Yujun Yang
Comparison theorems on resistance distances and Kirchhoff indices of S, T-isomers. Discret. Appl. Math. 175: 87-93 (2014) - [c3]Yujun Yang:
Computing the Kirchhoff Index of Some xyz-Transformations of Regular Molecular Graphs. ICIC (1) 2014: 173-183 - [c2]Yujun Yang, Chuanze Long, Yu Tao:
Research Scheduling Problem of Job-Shop Robotic Manufacturing Cell with Several Robots. ICIRA (2) 2014: 119-123 - 2013
- [j3]Yujun Yang, Douglas J. Klein:
A recursion formula for resistance distances and its applications. Discret. Appl. Math. 161(16-17): 2702-2715 (2013) - 2012
- [j2]Yujun Yang
Bounds for the Kirchhoff Index of Bipartite Graphs. J. Appl. Math. 2012: 195242:1-195242:9 (2012) - 2010
- [c1]Yujun Yang, Yimei Yang:
An efficient webpage information hiding method based on tag attributes. FSKD 2010: 1181-1184
2000 – 2009
- 2009
- [j1]Heping Zhang
Kirchhoff index of composite graphs. Discret. Appl. Math. 157(13): 2918-2927 (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-12-02 21:32 CET 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: