Peihuang Huang

According to our database1, Peihuang Huang authored at least 13 papers between 2018 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Min-max movement of barrier coverage with sink-based mobile sensors for crowdsensing.
Pervasive Mob. Comput., 2022

Linear time algorithm for computing min-max movement of sink-based mobile sensors for line barrier coverage.
Concurr. Comput. Pract. Exp., 2022

Information Diffusion with SIRP and SEIRP in Social Networks.
Proceedings of the 13th IEEE International Symposium on Parallel Architectures, 2022

2020
Maximizing Group Coverage in Social Networks.
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

System-Level FPGA Routing for Logic Verification with Time-Division Multiplexing.
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

Approximation Algorithms for the General Cluster Routing Problem.
Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

2019
Optimizing Movement for Maximizing Lifetime of Mobile Sensors for Covering Targets on a Line.
Sensors, 2019

On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary.
Proceedings of the Theory and Applications of Models of Computation, 2019

Min-Max Movement of Sink-Based Mobile Sensors in the Plane for Barrier Coverage.
Proceedings of the 20th International Conference on Parallel and Distributed Computing, 2019

Efficient Algorithms for Constrained Clustering with Side Information.
Proceedings of the Parallel Architectures, Algorithms and Programming, 2019

Evaluating Connection Quality between Two Individuals in Social Networks.
Proceedings of the 6th International Conference on Behavioral, 2019

2018
Efficient Algorithms for Flexible Sweep Coverage in Crowdsensing.
IEEE Access, 2018

Exact Algorithms for Finding Partial Edge-Disjoint Paths.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018


  Loading...