default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuquan Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j11]Yuquan Lin
, Wensong Lin:
Computational results on semistrong edge coloring of graphs. Discret. Appl. Math. 391: 399-412 (2026)- [j10]Xuchong Zhang, Yuanmeng Hu, Jinbang Tan, Yuquan Lin, Xiaohui Ma:
Recurrent neural network-based dynamic obstacle avoidance for dual-arm robot with joint discomfort optimization. Robotica 44(3): 908-928 (2026) - [j9]Lifeng Huang, Yuquan Lin, Chen Wan, Fang Shi, Shaojian Qiu, Qiong Huang:
Rethinking Fake Adversarial Examples for Single-Step Adversarial Training. IEEE Trans. Inf. Forensics Secur. 21: 7259-7273 (2026) - [c1]Linping Yuan, Le Lin, Yuquan Lin, Jun Han, Zikun Deng, Weicong Cheng, Huamin Qu:
Towards Understanding Time-Varying Spatial 3D Data Analysis with Animation and Small Multiples in Virtual Reality and Desktop. VR 2026: 12-21 - [i5]Hector Buffière, Yuquan Lin, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
Characterizations of monadically dependent tree-ordered weakly sparse structures. CoRR abs/2601.16039 (2026) - [i4]Hector Buffière, Yuquan Lin, Jaroslav Nesetril, Patrice Ossona de Mendez, Sebastian Siebertz:
On merge-models. CoRR abs/2603.26570 (2026) - [i3]Hector Buffière, Yuquan Lin, Patrice Ossona de Mendez:
Monadic dependence from reducts, and applications to twin-width of oriented graphs. CoRR abs/2606.18934 (2026) - 2025
- [j8]Wenying Xi, Wensong Lin, Yuquan Lin:
Packing 2- and 3-stars into (2,3)-regular graphs. Discret. Appl. Math. 361: 440-452 (2025) - [j7]Yuquan Lin, Wensong Lin:
Semistrong edge colorings of planar graphs. J. Comb. Optim. 50(2): 16 (2025) - [i2]Yuquan Lin, Patrice Ossona de Mendez:
Path degeneracy and applications. CoRR abs/2503.18614 (2025) - 2024
- [j6]Wenying Xi, Wensong Lin, Yuquan Lin:
Packing 2- and 3-stars into cubic graphs. Appl. Math. Comput. 460: 128287 (2024) - [j5]Yuquan Lin, Wensong Lin:
Strong chromatic index of claw-free graphs with edge weight seven. Discuss. Math. Graph Theory 44(4): 1311-1325 (2024) - 2023
- [j4]Yuquan Lin, Wensong Lin:
The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs. Graphs Comb. 39(3): 58 (2023) - [j3]Yuquan Lin, Wensong Lin:
Maximum weight t-sparse set problem on vector-weighted graphs. RAIRO Oper. Res. 57(5): 2799-2818 (2023) - 2021
- [i1]Xiangyan Sun, Ke Liu, Yuquan Lin, Lingjie Wu, Haoming Xing, Minghong Gao, Ji Liu, Suocheng Tan, Zekun Ni, Qi Han, Junqiu Wu, Jie Fan:
ChemiRise: a data-driven retrosynthesis engine. CoRR abs/2108.04682 (2021) - 2020
- [j2]Jingwei Zhang, Shengbo Ye, Yuquan Lin, Xin Liu, Guangyou Fang:
A Modified Model for Quasi-Monostatic Ground Penetrating Radar. IEEE Geosci. Remote. Sens. Lett. 17(3): 406-410 (2020)
2010 – 2019
- 2018
- [j1]Jingwei Zhang, Shengbo Ye, Li Yi, Yuquan Lin, Hai Liu, Guangyou Fang:
A Hybrid Method Applied to Improve the Efficiency of Full-Waveform Inversion for Pavement Characterization. Sensors 18(9): 2916 (2018)
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 2026-08-20 01: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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
