default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLinji Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Linji Yang, Qiankun Song
, Yurong Liu:
Dynamics analysis of a new fractional-order SVEIR-KS model for computer virus propagation: Stability and Hopf bifurcation. Neurocomputing 598: 128075 (2024)- 2023
- [j9]Qiankun Song, Linji Yang, Yurong Liu, Fuad E. Alsaadi:
Stability of quaternion-valued neutral-type neural networks with leakage delay and proportional delays. Neurocomputing 521: 191-198 (2023) - [j8]Linji Yang, Qiankun Song, Yurong Liu:
Stability and Hopf bifurcation analysis for fractional-order SVEIR computer virus propagation model with nonlinear incident rate and two delays. Neurocomputing 547: 126397 (2023)
2010 – 2019
- 2016
- [j7]Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. SIAM J. Comput. 45(6): 2004-2065 (2016) - [j6]Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan:
Average-case complexity of the min-sum matrix product problem. Theor. Comput. Sci. 609: 76-86 (2016) - 2015
- [j5]Juan Carlos Vera, Eric Vigoda, Linji Yang:
Improved Bounds on the Phase Transition for the Hard-Core Model in 2 Dimensions. SIAM J. Discret. Math. 29(4): 1895-1915 (2015) - 2014
- [j4]Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved inapproximability results for counting independent sets in the hard-core model. Random Struct. Algorithms 45(1): 78-110 (2014) - [j3]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SIAM J. Discret. Math. 28(2): 835-861 (2014) - [c9]Andreas Galanis, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. APPROX-RANDOM 2014: 677-691 - [c8]Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan:
Average-Case Complexity of the Min-Sum Matrix Product Problem. ISAAC 2014: 41-52 - 2013
- [c7]Juan Carlos Vera, Eric Vigoda, Linji Yang:
Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. APPROX-RANDOM 2013: 699-713 - [i4]Juan Carlos Vera, Eric Vigoda, Linji Yang:
Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. CoRR abs/1306.0431 (2013) - 2011
- [c6]Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. APPROX-RANDOM 2011: 567-578 - [c5]Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang:
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. FOCS 2011: 140-149 - [c4]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. SODA 2011: 945-956 - [i3]Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang:
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. CoRR abs/1105.0914 (2011) - [i2]Andreas Galanis, Qi Ge, Daniel Stefankovic, Eric Vigoda, Linji Yang:
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model. CoRR abs/1105.5131 (2011) - 2010
- [c3]Prasad Tetali, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. SODA 2010: 1646-1656 - [i1]Ricardo Restrepo, Daniel Stefankovic, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees. CoRR abs/1007.2255 (2010)
2000 – 2009
- 2007
- [j2]Erdong Chen, Linji Yang, Hao Yuan:
Improved algorithms for largest cardinality 2-interval pattern problem. J. Comb. Optim. 13(3): 263-275 (2007) - [j1]Erdong Chen, Linji Yang, Hao Yuan:
Longest increasing subsequences in windows based on canonical antichain partition. Theor. Comput. Sci. 378(3): 223-236 (2007) - 2005
- [c2]Hao Yuan, Linji Yang, Erdong Chen:
Improved Algorithms for Largest Cardinality 2-Interval Pattern Problem. ISAAC 2005: 412-421 - [c1]Erdong Chen, Hao Yuan, Linji Yang:
Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition. ISAAC 2005: 1153-1162
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-07-05 20:12 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:
