Xianyue Li

Orcid: 0000-0002-6311-8888

According to our database1, Xianyue Li authored at least 43 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Partial inverse min-max spanning tree problem under the weighted bottleneck hamming distance.
J. Comb. Optim., November, 2023

On anti-Kekulé and s-restricted matching preclusion problems.
J. Comb. Optim., May, 2023

2022
An Embedded GRASP-VNS based Two-Layer Framework for Tour Recommendation.
IEEE Trans. Serv. Comput., 2022

Partial inverse maximum spanning tree problem under the Chebyshev norm.
J. Comb. Optim., 2022

Withdrawals Prediction in Virtual Learning Environments with Deep Self-paced Learning.
Proceedings of the Computer Science and Education - 17th International Conference, 2022

2021
Independent perfect dominating sets in semi-Cayley graphs.
Theor. Comput. Sci., 2021

A greedy algorithm for the fault-tolerant outer-connected dominating set problem.
J. Comb. Optim., 2021

Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l<sub>∞ </sub>-norm.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
Algorithm for Online 3-Path Vertex Cover.
Theory Comput. Syst., 2020

Approximation algorithms for capacitated partial inverse maximum spanning tree problem.
J. Glob. Optim., 2020

The complexity of total edge domination and some related results on trees.
J. Comb. Optim., 2020

Complexity and characterization aspects of edge-related domination for graphs.
J. Comb. Optim., 2020

Approximation algorithm for minimum connected 3-path vertex cover.
Discret. Appl. Math., 2020

Independent Perfect Domination Sets in Semi-Cayley Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Online hole healing for sensor coverage.
J. Glob. Optim., 2019

Capacitated partial inverse maximum spanning tree under the weighted Hamming distance.
J. Comb. Optim., 2019

2018
Partial inverse maximum spanning tree in which weight can only be decreased under l<sub>p</sub>-norm.
J. Glob. Optim., 2018

2017
NP-completeness of anti-Kekulé and matching preclusion problems.
CoRR, 2017

2014
Approximation algorithms on 0-1 linear knapsack problem with a single continuous variable.
J. Comb. Optim., 2014

A New Greedy Algorithm for D-Hop Connected Dominating Set.
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

2013
On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks.
IEEE/ACM Trans. Netw., 2013

The effect of transpiration uncertainty on root zone soil water by Bayesian analysis.
Math. Comput. Model., 2013

Moplex orderings generated by the LexDFS algorithm.
Discret. Appl. Math., 2013

2012
Matching preclusion for balanced hypercubes.
Theor. Comput. Sci., 2012

An efficient approximation for minimum energy broadcast in multi-channel multi-hop wireless network with directional antennas.
Optim. Lett., 2012

A constant-factor approximation for d-hop connected dominating sets in unit disk graph.
Int. J. Sens. Networks, 2012

2011
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs.
Theor. Comput. Sci., 2011

Development of regional-scale pedotransfer functions based on Bayesian Neural Networks in the Hetao Irrigation District of China.
Proceedings of the Seventh International Conference on Natural Computation, 2011

2010
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs.
IEEE Trans. Mob. Comput., 2010

Approximations for node-weighted Steiner tree in unit disk graphs.
Optim. Lett., 2010

Modelling of the canopy conductance of potted cherry trees based on an artificial neural network.
Math. Comput. Model., 2010

An improved canopy transpiration model and parameter uncertainty analysis by Bayesian approach.
Math. Comput. Model., 2010

A Better Constant-Factor Approximation for Selected-Internal Steiner Minimum Tree.
Algorithmica, 2010

A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

An Analysis on the Inter-annual Spatial and Temporal Variation of the Water Table Depth and Salinity in Hetao Irrigation District, Inner Mongolia, China.
Proceedings of the Computer and Computing Technologies in Agriculture IV, 2010

2009
Node-weighted Steiner tree approximation in unit disk graphs.
J. Comb. Optim., 2009

Analysis on Theoretical Bounds for Approximating Dominating Set Problems.
Discret. Math. Algorithms Appl., 2009

A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2009

2008
Construction of Minimum Connected Dominating Set in 3-Dimensional Wireless Network.
Proceedings of the Wireless Algorithms, 2008

A Better Theoretical Bound to Approximate Connected Dominating Set in Unit Disk Graph.
Proceedings of the Wireless Algorithms, 2008

Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks.
Proceedings of the Wireless Algorithms, 2008

(1+rho)-Approximation for Selected-Internal Steiner Minimum Tree.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2008


  Loading...