Lidong Wu

According to our database1, Lidong Wu authored at least 39 papers between 2012 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
An efficient case for computing minimum linear arboricity with small maximum degree.
Optimization Letters, 2019

The Generalized Connectivity of (n, k)-Bubble-Sort Graphs.
Comput. J., 2019

A multi-start iterated greedy algorithm for the minimum weight vertex cover P3 problem.
Appl. Math. Comput., 2019

Trajectory Optimization of UAV for Efficient Data Collection from Wireless Sensor Networks.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

On Approximation Algorithm for the Edge Metric Dimension Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
On general threshold and general cascade models of social influence.
J. Comb. Optim., 2018

Blocking Rumor by Cut.
J. Comb. Optim., 2018

2017
Connected sensor cover and related problems.
Peer-to-Peer Networking and Applications, 2017

On the vertex cover P3 problem parameterized by treewidth.
J. Comb. Optim., 2017

Approximation Designs for Cooperative Relay Deployment in Wireless Networks.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016
Connected Set-Cover and Group Steiner Tree.
Encyclopedia of Algorithms, 2016

Minimum Connected Sensor Cover.
Encyclopedia of Algorithms, 2016

On single machine scheduling with resource constraint.
J. Comb. Optim., 2016

On strongly planar 3SAT.
J. Comb. Optim., 2016

A note on the minimum number of choosability of planar graphs.
J. Comb. Optim., 2016

List edge and list total coloring of planar graphs with maximum degree 8.
J. Comb. Optim., 2016

2015
Preface.
Theor. Comput. Sci., 2015

Better approximation algorithms for influence maximization in online social networks.
J. Comb. Optim., 2015

PTAS for routing-cost constrained minimum connected dominating set in growth bounded graphs.
J. Comb. Optim., 2015

Strongly connected dominating and absorbing set in directed disk graph.
IJSNet, 2015

2014
Total coloring of planar graphs with maximum degree 8.
Theor. Comput. Sci., 2014

Routing-efficient CDS construction in Disk-Containment Graphs.
Optimization Letters, 2014

Minimum total coloring of planar graph.
J. Global Optimization, 2014

A two-stage approach for surgery scheduling.
J. Comb. Optim., 2014

A short-term trend prediction model of topic over Sina Weibo dataset.
J. Comb. Optim., 2014

Minimum number of disjoint linear forests covering a planar graph.
J. Comb. Optim., 2014

Improvement of path analysis algorithm in social networks based on HBase.
J. Comb. Optim., 2014

Clustering and Indexing Schemes for Wireless Data Broadcasting.
I. J. Comput. Appl., 2014

An efficient routing protocol based on consecutive forwarding prediction in delay tolerant networks.
IJSNet, 2014

How Many Target Points Can Replace a Target Area?
Proceedings of the 10th International Conference on Mobile Ad-hoc and Sensor Networks, 2014

An approximation algorithm for client assignment in client/server systems.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

2013
Constant-approximation for optimal data aggregation with physical interference.
J. Global Optimization, 2013

Maximum lifetime connected coverage with two active-phase sensors.
J. Global Optimization, 2013

SmartPrint: A Cloud Print System for Office.
Proceedings of the IEEE 9th International Conference on Mobile Ad-hoc and Sensor Networks, 2013

Approximations for Minimum Connected Sensor Cover.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

A Short-Term Prediction Model of Topic Popularity on Microblogs.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Social Network Path Analysis Based on HBase.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012
A New Proof for Zassenhaus-Groemer-Oler inequality.
Discrete Math., Alg. and Appl., 2012

Constant-approximation for target coverage problem in wireless sensor networks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012


  Loading...