default search action
Xianyue Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j29]Huazhong Lü
, Xianyue Li, Heping Zhang:
On anti-Kekulé and s-restricted matching preclusion problems. J. Comb. Optim. 45(4): 103 (2023) - [j28]Qingzhen Dong, Xianyue Li
Partial inverse min-max spanning tree problem under the weighted bottleneck hamming distance. J. Comb. Optim. 46(4): 27 (2023) - 2022
- [j27]Xianyue Li
Partial inverse maximum spanning tree problem under the Chebyshev norm. J. Comb. Optim. 44(5): 3331-3350 (2022) - [j26]Yuanning Gao
An Embedded GRASP-VNS based Two-Layer Framework for Tour Recommendation. IEEE Trans. Serv. Comput. 15(2): 847-859 (2022) - [c14]Qingzhen Dong, Xianyue Li, Yu Yang:
Partial Inverse Min-Max Spanning Tree Problem Under the Weighted Bottleneck Hamming Distance. AAIM 2022: 351-362 - [c13]Xianyue Li, Wei Xu, Shuo Xie:
Withdrawals Prediction in Virtual Learning Environments with Deep Self-paced Learning. ICCSE (3) 2022: 62-72 - 2021
- [j25]Xiaozhi Wang, Xianyue Li, Bo Hou, Wen Liu, Lidong Wu, Suogang Gao:
A greedy algorithm for the fault-tolerant outer-connected dominating set problem. J. Comb. Optim. 41(1): 118-127 (2021) - [j24]Xiaomeng Wang
Independent perfect dominating sets in semi-Cayley graphs. Theor. Comput. Sci. 864: 50-57 (2021) - [c12]Xianyue Li
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l∞ -norm. COCOA 2021: 389-399 - 2020
- [j23]Pengcheng Liu, Zhao Zhang, Xianyue Li
Approximation algorithm for minimum connected 3-path vertex cover. Discret. Appl. Math. 287: 77-84 (2020) - [j22]Zhuo Pan, Yu Yang, Xianyue Li
The complexity of total edge domination and some related results on trees. J. Comb. Optim. 40(3): 571-589 (2020) - [j21]Zhuo Pan, Xianyue Li, Shou-Jun Xu
Complexity and characterization aspects of edge-related domination for graphs. J. Comb. Optim. 40(3): 757-773 (2020) - [j20]Xianyue Li, Zhao Zhang, Ruowang Yang, Heping Zhang, Ding-Zhu Du:
Approximation algorithms for capacitated partial inverse maximum spanning tree problem. J. Glob. Optim. 77(2): 319-340 (2020) - [j19]Yubai Zhang, Zhao Zhang, Yishuo Shi, Xianyue Li:
Algorithm for Online 3-Path Vertex Cover. Theory Comput. Syst. 64(2): 327-338 (2020) - [c11]Xiaomeng Wang
Independent Perfect Domination Sets in Semi-Cayley Graphs. AAIM 2020: 436-447
2010 – 2019
- 2019
- [j18]Xianyue Li
Capacitated partial inverse maximum spanning tree under the weighted Hamming distance. J. Comb. Optim. 38(4): 1005-1018 (2019) - [j17]Zhao Zhang, Zaixin Lu, Xianyue Li, Xiaohui Huang, Ding-Zhu Du:
Online hole healing for sensor coverage. J. Glob. Optim. 75(4): 1111-1131 (2019) - 2018
- [j16]Xianyue Li, Zhao Zhang, Ding-Zhu Du:
Partial inverse maximum spanning tree in which weight can only be decreased under lp-norm. J. Glob. Optim. 70(3): 677-685 (2018) - 2017
- [i1]Huazhong Lü, Xianyue Li, Heping Zhang:
NP-completeness of anti-Kekulé and matching preclusion problems. CoRR abs/1706.09321 (2017) - 2014
- [j15]Chenxia Zhao, Xianyue Li:
Approximation algorithms on 0-1 linear knapsack problem with a single continuous variable. J. Comb. Optim. 28(4): 910-916 (2014) - [c10]Xianyue Li, Xiaofeng Gao, Chenxia Zhao:
A New Greedy Algorithm for D-Hop Connected Dominating Set. MSN 2014: 54-57 - 2013
- [j14]Shou-Jun Xu, Xianyue Li, Ronghua Liang:
Moplex orderings generated by the LexDFS algorithm. Discret. Appl. Math. 161(13-14): 2189-2195 (2013) - [j13]Xianyue Li, Peiling Yang, Haibin Shi, Shumei Ren, Yunkai Li
The effect of transpiration uncertainty on root zone soil water by Bayesian analysis. Math. Comput. Model. 58(3-4): 691-700 (2013) - [j12]Wei Wang, Donghyun Kim, Min Kyung An
On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks. IEEE/ACM Trans. Netw. 21(5): 1499-1510 (2013) - 2012
- [j11]Xiaofeng Gao, Weili Wu, Xuefei Zhang, Xianyue Li:
A constant-factor approximation for d-hop connected dominating sets in unit disk graph. Int. J. Sens. Networks 12(3): 125-136 (2012) - [j10]Xianyue Li, Shan Shan, Hongjie Du, Ailian Jiang, Weili Wu:
An efficient approximation for minimum energy broadcast in multi-channel multi-hop wireless network with directional antennas. Optim. Lett. 6(8): 1787-1794 (2012) - [j9]Huazhong Lü
Matching preclusion for balanced hypercubes. Theor. Comput. Sci. 465: 10-20 (2012) - 2011
- [j8]Feng Zou, Yuexuan Wang, XiaoHua Xu, Xianyue Li, Hongwei Du, Peng-Jun Wan, Weili Wu:
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs. Theor. Comput. Sci. 412(3): 198-208 (2011) - [c9]Zhongyi Qu, Xianyue Li, Dan Tian, Raghavendra B. Jana
Development of regional-scale pedotransfer functions based on Bayesian Neural Networks in the Hetao Irrigation District of China. ICNC 2011: 756-761 - 2010
- [j7]Xianyue Li, Feng Zou, Yaochun Huang, Donghyun Kim, Weili Wu:
A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree. Algorithmica 56(3): 333-341 (2010) - [j6]Xianyue Li, Peiling Yang, Shumei Ren, Liang Ren, Pingfeng Li, Jun Du:
Modelling of the canopy conductance of potted cherry trees based on an artificial neural network. Math. Comput. Model. 51(11-12): 1363-1367 (2010) - [j5]Xianyue Li, Peiling Yang, Shumei Ren, Yunkai Li
An improved canopy transpiration model and parameter uncertainty analysis by Bayesian approach. Math. Comput. Model. 51(11-12): 1368-1374 (2010) - [j4]XiaoHua Xu, Yuexuan Wang, Hongwei Du, Peng-Jun Wan, Feng Zou, Xianyue Li, Weili Wu:
Approximations for node-weighted Steiner tree in unit disk graphs. Optim. Lett. 4(3): 405-416 (2010) - [j3]Donghyun Kim, Zhao Zhang, Xianyue Li, Wei Wang, Weili Wu, Ding-Zhu Du:
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs. IEEE Trans. Mob. Comput. 9(8): 1108-1118 (2010) - [c8]Jun Du, Peiling Yang, Yunkai Li
An Analysis on the Inter-annual Spatial and Temporal Variation of the Water Table Depth and Salinity in Hetao Irrigation District, Inner Mongolia, China. CCTA (1) 2010: 155-177 - [c7]Donghyun Kim, Wei Wang, Xianyue Li, Zhao Zhang, Weili Wu:
A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks. INFOCOM 2010: 2739-2747
2000 – 2009
- 2009
- [j2]Xiaofeng Gao, Yuexuan Wang, Xianyue Li, Weili Wu:
Analysis on Theoretical Bounds for Approximating Dominating Set Problems. Discret. Math. Algorithms Appl. 1(1): 71-84 (2009) - [j1]Feng Zou, Xianyue Li, Suogang Gao, Weili Wu:
Node-weighted Steiner tree approximation in unit disk graphs. J. Comb. Optim. 18(4): 342-349 (2009) - [c6]Xianyue Li, XiaoHua Xu, Feng Zou, Hongwei Du, Peng-Jun Wan, Yuexuan Wang, Weili Wu:
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs. COCOA 2009: 36-48 - 2008
- [c5]Feng Zou, Xianyue Li, Donghyun Kim, Weili Wu:
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs. COCOA 2008: 278-285 - [c4]Xianyue Li, Yaochun Huang, Feng Zou, Donghyun Kim, Weili Wu:
(1+rho)-Approximation for Selected-Internal Steiner Minimum Tree. COCOON 2008: 568-576 - [c3]Feng Zou, Xianyue Li, Donghyun Kim, Weili Wu:
Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network. WASA 2008: 134-140 - [c2]Xianyue Li, Xiaofeng Gao, Weili Wu:
A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph. WASA 2008: 162-175 - [c1]Donghyun Kim, Xianyue Li, Feng Zou, Zhao Zhang, Weili Wu:
Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks. WASA 2008: 560-569
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-11-06 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: