Dieyan Liang

According to our database, Dieyan Liang authored at least 6 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

A Path Planning Method for Chargeable Sweep Coverage With Multiple Charging Stations.

Dieyan Liang, Baojian Feng, Xuefeng Liao

IEEE Access, 2024

2021

Maximum Target Coverage Problem in Mobile Wireless Sensor Networks.

Dieyan Liang, Hong Shen, Lin Chen

Sensors, 2021

Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines.

Dieyan Liang, Hong Shen

Sensors, 2021

Changeable Sweep Coverage Problem.

Dieyan Liang, Hong Shen

CoRR, 2021

2019

Cost-minimizing online algorithm for internet green data centers on multi-source energy.

Huaiwen He, Hong Shen, Dieyan Liang

Concurr. Comput. Pract. Exp., 2019

2017

Point Sweep Coverage on Path.

Dieyan Liang, Hong Shen

CoRR, 2017