Name
Affiliation
Papers
WEI WANG
Institute of Information and System Sciences, Faculty of Science, Xi’an Jiaotong University, Xi’an 710049, PR China
32
Collaborators
Citations 
PageRank 
68
81
12.64
Referers 
Referees 
References 
204
356
207
Search Limit
100356
Title
Citations
PageRank
Year
???????A new criterion for almost controllable graphs being determined by their generalized spectra00.342022
Spectral characterizations of tournaments00.342022
Spectral characterizations of tournaments00.342022
Greedy Approximation For The Minimum Connected Dominating Set With Labeling00.342021
Generalized spectral characterizations of almost controllable graphs00.342021
Generalized spectral characterizations of almost controllable graphs00.342021
Constructing cospectral bipartite graphs00.342020
A new arithmetic criterion for graphs being determined by their generalized Q-spectrum00.342019
The connected vertex cover problem in k-regular graphs00.342019
New families of graphs determined by their generalized spectrum.00.342019
Linear State Estimation For Markov Jump Linear System With Multi-Channel Observation Delays And Packet Dropouts20.372019
On the Generalized Spectral Characterizations of Eulerian Graphs00.342019
On Practical Construction of Quality Fault-Tolerant Virtual Backbone in Homogeneous Wireless Networks.10.352018
A note on non-R-cospectral graphs00.342017
On Theoretical Trajectory Planning of Multiple Drones To Minimize Latency in Search-and-Reconnaissance Operations.10.352017
Complexity and algorithms for the connected vertex cover problem in 4-regular graphs.00.342017
A New Constant Factor Approximation to Construct Highly Fault-Tolerant Connected Dominating Set in Unit Disk Graph.30.382017
A simple greedy approximation algorithm for the minimum connected $$k$$k-Center problem30.402016
Robust track-to-track association in the presence of sensor biases and missed detections00.342016
On Efficient Vaccine Distribution Strategy To Suppress Pandemic Using Social Relation10.362016
On Approximating Minimum 3-Connected m-Dominating Set Problem in Unit Disk Graph.30.382016
Approximation algorithms for minimum weight partial connected set cover problem10.362016
A Better Constant Approximation For Minimum 3-Connected M-Dominating Set Problem In Unit Disk Graph Using Tutte Decomposition70.442015
p-OFTL: An object-based semantic-aware parallel flash translation layer50.442014
PTAS for the minimum k-path connected vertex cover problem in unit disk graphs150.732013
Polynomial time approximation scheme for -latency bounded information propagation problem in wireless networks20.412012
A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs100.582012
Some results on the lexicographic product of vertex-transitive graphs30.412011
Vertex-deleted subgraphs and regular factors from regular graph.00.342011
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs220.812010
On the asymptotic behavior of graphs determined by their generalized spectra00.342010
A Novel Individual Blood Glucose Control Model Based on Mixture of Experts Neural Networks20.472004