default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiangwen Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j78]Yiliang Luo, Gulan Zhang, Jing Duan, Xiangwen Li, Chenxi Liang, Qihong Zhong, Shiyun Ran, Caijun Cao:
Multitask Two-Stage Deep Learning Seismic Strong and Weak Reflection Separation. IEEE Trans. Geosci. Remote. Sens. 63: 1-11 (2025)- 2024
- [j77]Lin Niu, Xiangwen Li
:
Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions. Discret. Math. 347(6): 113965 (2024) - [j76]Lin Niu, Xiangwen Li:
On the Alon-Tarsi number of semi-strong product of graphs. J. Comb. Optim. 47(1): 1 (2024) - [j75]Yiliang Luo, Gulan Zhang, Wenge Liu, Jianjun Zhang, Lei Li, Xiangwen Li, Jing Duan:
Strata Boundary-Constrained Multitask Multihorizon Tracking. IEEE Geosci. Remote. Sens. Lett. 21: 1-5 (2024) - [j74]Aiting Jia, Yifang Luo, Bo Hong, Xiangwen Li, Li Yin, Mina Luo:
A Real-Time Monitoring Method for Droplet Transfer Frequency in Wire-Filled GTAW Based on Arc Sensing. Sensors 24(6): 1924 (2024) - [j73]Jing Duan, Gulan Zhang, Xiangwen Li, Yintao Zhang, Lei Li, Wei Liu, Shiyun Ran, Caijun Cao, Wenjie Tang, Fengchi Yang, Yiliang Luo:
Seismic Facies-Guided Trace-by-Trace High-Precision Strong and Weak Reflection Separation. IEEE Trans. Geosci. Remote. Sens. 62: 1-17 (2024) - [j72]Yiliang Luo, Gulan Zhang, Guowei Liang, Xiangwen Li, Jing Duan, Lei Li, Qihong Zhong, Yibo Yang, Ziheng Li, Fengchi Yang, Feng Qian:
Limited-Label Multiscale Deep-Learning Multihorizon Tracking. IEEE Trans. Geosci. Remote. Sens. 62: 1-14 (2024) - 2023
- [j71]Xiangwen Li, Ling Zhou, Haoyu Wu, Bin Yang, Wenjing Zhang, Jiewen Gu, Yinlu Gan:
A Min-Pooling Detection Method for Ship Targets in Noisy SAR Images. IEEE Access 11: 31902-31911 (2023) - [j70]Xiangwen Li, Mao Zhang:
Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable. Australas. J Comb. 87: 86-97 (2023) - [j69]Fangyu Tian, Lin Niu, Xiangwen Li:
Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs. Appl. Math. Comput. 456: 128126 (2023) - [j68]Fangyu Tian, Xiangwen Li:
A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent 4--Cycles. Graphs Comb. 39(6): 115 (2023) - [j67]Xiangwen Li, Jie Liu, Jian-Bo Lv:
Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable. Graphs Comb. 39(6): 118 (2023) - [j66]Xiangwen Li, Yangfan Li, Jian-Bo Lv, Tao Wang:
Strong edge-colorings of sparse graphs with 3Δ - 1 colors. Inf. Process. Lett. 179: 106313 (2023) - [j65]Yiliang Luo, Gulan Zhang, Jing Duan, Chenxi Liang, Qi Wu, Fengchi Yang, Xiangwen Li:
Two-Stage Multitask U-Network VSP Wavefield Separation. IEEE Geosci. Remote. Sens. Lett. 20: 1-5 (2023) - [j64]Haoyu Wu, Lei Yu, Xiangwen Li, Lin Zhou, Wenjing Zhang, Guiming Bai:
CTF-Net: A Convolutional and Transformer Fusion Network for SAR Ship Detection. IEEE Geosci. Remote. Sens. Lett. 20: 1-5 (2023) - 2022
- [j63]Xiangwen Li, Jian-Bo Lv, Mao Zhang:
DP-4-colorability of planar graphs without intersecting 5-cycles. Discret. Math. 345(4): 112790 (2022) - [j62]Xiangwen Li, Jie Liu, Jian-Bo Lv:
Every planar graph with girth at least 5 is (1, 9)-colorable. Discret. Math. 345(6): 112818 (2022) - [j61]Xiangwen Li, Jingye Li, Xukui Feng, Guangjian Dan, Gulan Zhang, Lei Zhang, Ming Zhang, Liangliang Zhang, Hongbo Zhou, Wei Zhao:
Heterogeneous reservoir prediction of ultra-deep strike-slip fault-damaged zone constrained with local seismic anomaly data. Earth Sci. Informatics 15(3): 1427-1441 (2022) - [j60]Yiliang Luo, Gulan Zhang, Lei Li, Xudong Zhang, Jing Duan, Xiangwen Li, Yong Li:
Attention-Based Two-Stage U-Net Horizon Tracking. IEEE Geosci. Remote. Sens. Lett. 19: 1-5 (2022) - 2021
- [j59]Xiangwen Li, Runrun Liu, Gexin Yu:
Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Appl. Math. 304: 236-247 (2021) - [j58]Bo Hong, Aiting Jia, Yuxiang Hong, Xiangwen Li, Jiapeng Gao, Yuanyuan Qu:
Online Extraction of Pose Information of 3D Zigzag-Line Welding Seams for Welding Seam Tracking. Sensors 21(2): 375 (2021) - 2020
- [j57]Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu:
DP-4-colorability of planar graphs without adjacent cycles of given length. Discret. Appl. Math. 277: 245-251 (2020) - [j56]Xiangwen Li, Yuxue Yin, Gexin Yu:
Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable. Discret. Math. 343(2): 111661 (2020) - [j55]Gaoyang Li, Yuxiang Hong, Jiapeng Gao, Bo Hong, Xiangwen Li:
Welding Seam Trajectory Recognition for Automated Skip Welding Guidance of a Spatially Intermittent Welding Seam Based on Laser Vision Sensor. Sensors 20(13): 3657 (2020)
2010 – 2019
- 2019
- [j54]Runrun Liu, Xiangwen Li:
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. Discret. Math. 342(3): 623-627 (2019) - [j53]Runrun Liu, Xiangwen Li:
Every planar graph without adjacent cycles of length at most 8 is 3-choosable. Eur. J. Comb. 82 (2019) - 2018
- [j52]Jian-Bo Lv, Xiangwen Li, Gexin Yu:
On strong edge-coloring of graphs with maximum degree 4. Discret. Appl. Math. 235: 142-153 (2018) - [j51]Lili Hu, Xiangwen Li:
Every signed planar graph without cycles of length from 4 to 8 is 3-colorable. Discret. Math. 341(2): 513-519 (2018) - [j50]Ziwen Huang, Xiangwen Li, Gexin Yu:
A relaxation of the strong Bordeaux Conjecture. J. Graph Theory 88(2): 237-254 (2018) - 2017
- [j49]Ziwen Huang, Xiangwen Li, Jianqing Ma:
Z3-Connectivity of Claw-Free Graphs. Graphs Comb. 33(1): 123-140 (2017) - [j48]Ying Bai, Xiangwen Li, Gexin Yu:
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable. J. Comb. Optim. 33(4): 1354-1364 (2017) - 2016
- [j47]Xiangwen Li, Sanming Zhou:
Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms. Ars Math. Contemp. 10(1): 85-90 (2016) - [j46]Xiangwen Li, Jianqing Ma:
Z_3-connectivity of K_{1, 3}-free graphs without induced cycle of length at least 5. Ars Math. Contemp. 11(1): 35-47 (2016) - [j45]Runrun Liu, Xiangwen Li, Gexin Yu:
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Math. 339(2): 992-1003 (2016) - [j44]Xiangwen Li, Yuanyuan Liu:
Nowhere-zero 3-flows and Z3-connectivity of graphs without two forbidden subgraphs. Discret. Math. 339(9): 2357-2370 (2016) - [j43]Fan Yang, Xiangwen Li, Liangchen Li:
Z3-Connectivity with Independent Number 2. Graphs Comb. 32(1): 419-429 (2016) - 2015
- [j42]Mingfang Huang, Xiangwen Li:
Maximum degree of 3-independent vertices and group connectivity. Ars Comb. 123: 3-16 (2015) - [j41]Xiangwen Li, Yan Xiong:
Collapsible graphs and Hamilton cycles of line graphs. Discret. Appl. Math. 194: 132-142 (2015) - [j40]Xiangwen Li, Xiaoxia Zhang:
Nowhere-zero 3-flows in semistrong product of graphs. Discret. Math. 338(12): 2408-2411 (2015) - [j39]Runrun Liu, Xiangwen Li, Gexin Yu:
A relaxation of the Bordeaux Conjecture. Eur. J. Comb. 49: 240-249 (2015) - [j38]Mingfang Huang, Xiangwen Li:
Group Connectivity and Matchings. Graphs Comb. 31(4): 993-1001 (2015) - [j37]Fan Yang, Xiangwen Li:
Group connectivity in J3 line graphs. Graphs Comb. 31(4): 1065-1076 (2015) - [j36]Xiangwen Li:
Group Chromatic Number of Halin Graphs. Graphs Comb. 31(5): 1531-1538 (2015) - [j35]Xiaoxia Zhang, Xiangwen Li:
Z3-Connectivity of Wreath Product of Graphs. Graphs Comb. 31(6): 2447-2457 (2015) - 2014
- [j34]Mingfang Huang, Xiangwen Li:
A Note on Z5-connectivity in 3-edge-connected graphs. Ars Comb. 113: 241-255 (2014) - [j33]Fan Yang, Xiangwen Li, Hong-Jian Lai:
Realizing degree sequences as Z3-connected graphs. Discret. Math. 333: 110-119 (2014) - [j32]Jianqing Ma, Xiangwen Li:
Nowhere-zero 3-flows of claw-free graphs. Discret. Math. 336: 57-68 (2014) - [j31]Xiaoxia Zhang, Xiangwen Li:
The Chvátal-Erdös Condition for Group Connectivity in Graphs. Graphs Comb. 30(3): 769-781 (2014) - [j30]Xiaoxia Zhang, Xiangwen Li:
Maximum Degree Condition and Group Connectivity. Graphs Comb. 30(4): 1055-1063 (2014) - 2013
- [j29]Xiaoxia Zhang, Xiangwen Li:
Group connectivity of semistrong product of graphs. Australas. J Comb. 56: 123-132 (2013) - [j28]Xiangwen Li, Sanming Zhou:
Labeling outerplanar graphs with maximum degree three. Discret. Appl. Math. 161(1-2): 200-211 (2013) - [j27]Fan Yang, Xiangwen Li:
Degree sum of 3 independent vertices and Z3Z3-connectivity. Discret. Math. 313(21): 2493-2505 (2013) - [j26]Xiangwen Li, Chunxiang Wang, Qiong Fan, Zhaohong Niu, Liming Xiong:
Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs. Graphs Comb. 29(2): 275-280 (2013) - [j25]Liangchen Li, Xiangwen Li, Chi Shu:
Group Connectivity of Bridged Graphs. Graphs Comb. 29(4): 1059-1066 (2013) - [j24]Liangchen Li, Xiangwen Li:
Neighborhood Unions and Z 3-Connectivity in Graphs. Graphs Comb. 29(6): 1891-1898 (2013) - [j23]Xiangwen Li, Vicky H. Mak-Hau, Sanming Zhou:
The L(2, 1)-labelling problem for cubic Cayley graphs on dihedral groups. J. Comb. Optim. 25(4): 716-736 (2013) - 2012
- [j22]Xiangwen Li, Hong-Jian Lai, Yehong Shao:
Degree condition and Z3-connectivity. Discret. Math. 312(10): 1658-1669 (2012) - [j21]Liangchen Li, Xiangwen Li:
Nowhere-zero 3-flows and Z3-connectivity in bipartite graphs. Discret. Math. 312(15): 2238-2251 (2012) - [j20]Fan Yang, Xiangwen Li:
Group Connectivity in 3-Edge-Connected Graphs. Graphs Comb. 28(5): 743-750 (2012) - 2011
- [j19]Fan Yang, Xiangwen Li:
Interval coloring of (3, 4)-biregular bigraphs having two (2, 3)-biregular bipartite subgraphs. Appl. Math. Lett. 24(9): 1574-1577 (2011) - [j18]Liangchen Li, Xiangwen Li:
A Note on Spanning Eulerian Graphs. Ars Comb. 101: 129-135 (2011) - [j17]Fan Yang, Xiangwen Li:
Small cycle covers of 3-connected cubic graphs. Discret. Math. 311(2-3): 186-196 (2011) - [j16]Fan Yang, Xiangwen Li:
Nowhere-zero 3-flows in dihedral Cayley graphs. Inf. Process. Lett. 111(9): 416-419 (2011) - 2010
- [j15]Xiangwen Li, Vicky H. Mak, Sanming Zhou:
Optimal radio labellings of complete m-ary trees. Discret. Appl. Math. 158(5): 507-515 (2010) - [j14]Xiangjuan Yao, Xiangwen Li, Hong-Jian Lai:
Degree conditions for group connectivity. Discret. Math. 310(5): 1050-1058 (2010) - [j13]Xiaoxia Zhang, Mingquan Zhan, Rui Xu, Yehong Shao, Xiangwen Li, Hong-Jian Lai:
Degree sum condition for Z3-connectivity in graphs. Discret. Math. 310(23): 3390-3397 (2010)
2000 – 2009
- 2009
- [j12]Chunxiang Wang, Zhiquan Hu, Xiangwen Li:
A constructive characterization of total domination vertex critical graphs. Discret. Math. 309(4): 991-996 (2009) - [j11]Xiangwen Li:
On 3-choosable planar graphs of girth at least 4. Discret. Math. 309(8): 2424-2431 (2009) - 2007
- [j10]Hong-Jian Lai, Xiangwen Li, Gexin Yu:
An inequality for the group chromatic number of a graph. Discret. Math. 307(23): 3076-3080 (2007) - 2006
- [j9]Hong-Jian Lai, Xiangwen Li:
Group chromatic number of planar graphs of girth at least 4. J. Graph Theory 52(1): 51-72 (2006) - 2005
- [j8]Hong-Jian Lai, Xiangwen Li, Hoifung Poon, Yongbin Ou:
Spanning Trails Connecting Given Edges. Graphs Comb. 21(1): 77-88 (2005) - [j7]Hong-Jian Lai, Xiangwen Li:
On Group Chromatic Number of Graphs. Graphs Comb. 21(4): 469-474 (2005) - [j6]Hong-Jian Lai, Xiangwen Li, Hoifung Poon:
Nowhere zero 4-flow in regular matroids. J. Graph Theory 49(3): 196-204 (2005) - 2004
- [j5]Xiangwen Li, Bing Wei, Fan Yang:
Independent Cycles in a Bipartite Graph. Ars Comb. 73 (2004) - 2003
- [j4]Hong-Jian Lai, Xiangwen Li:
Small cycle cover of 2-connected cubic graphs. Discret. Math. 269(1-3): 295-302 (2003) - [j3]Zhi-Hong Chen, Hong-Jian Lai, Xiangwen Li, Deying Li, Jingzhong Mao:
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs. J. Graph Theory 42(4): 308-319 (2003) - 2002
- [j2]Xiangwen Li, Bing Wei, Zhengguang Yu, Yongjin Zhu:
Hamilton cycles in 1-tough triangle-free graphs. Discret. Math. 254(1-3): 275-287 (2002) - 2001
- [j1]Xiangwen Li, Bing Wei, Fan Yang:
A degree condition of 2-factors in bipartite graphs. Discret. Appl. Math. 113(2-3): 311-318 (2001)
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 2025-01-26 23:50 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:
