The University of Adelaide Australia
 Home  >> Research  >> Publications  >> Hong Shen  ||  Courses  ||  Programs  ||  Staff  ||  Research  || 

Below are my selected recent journal publications (2012-). Here is my full publication list (400+)

1.   (ERA A) Neetesh Saxen, Hong Shen, Nikos Komninos, Kim-Kwang Raymond Choo, and Narendra S. Chaudhari, “BVPSMS: A Batch Verification Protocol for End-to-End Secure SMS for Mobile Users”,  IEEE Transactions on Dependable and Secure Computing, VOL. 15, NO. X, XXXXX 2018 (

2.   (ERA A) Huaiwen He, Hong Shen and Dieyan Liang, “Cost-Minimizing Online Algorithm for Internet Green Data Centers on Multi-source Energy", Concurrency and Computation: Practice and Experience, to appear (accepted August 2018).

3.   (ERA A*) Longkun Guo and Hong Shen: Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds. IEEE Transactions on Parallel and Distributed Systems. 28(12): 3511-3520 (2017).

4.   (ERA A*) Longkun Guo, Hong Shen, and Wenxing Zhu: Efficient Approximation Algorithms for Multi-Antennae Largest Weight Data Retrieval. IEEE Transactions on Mobile Computing. 16(12): 3320-3333 (2017).

5.   (ERA A) Shangsong Liang, Emine Yilmaz, Hong Shen, Maarten De Rijke, W. Bruce Croft: Search Result Diversification in Short Text Streams. ACM Transactions on Information Systems (TOIS). 36(1):  8:1-8:35 (2017).

6.   (ERA A) Yingpeng Sang, Hong Shen, Hui Tian, Zonghua Zhang: Achieving Probabilistic Anonymity in a Linear and Hybrid Randomization Model, IEEE Transactions on Information Forensics and Security. 11(10): 2187-2202 (2016).

7.   (ERA A*) Wenhao Shu, Hong Shen: Multi-criteria feature selection on cost-sensitive data with missing values. Pattern Recognition 51: 268-280 (2016)

8.   (ERA A) Ping He, Hong Shen, Hui Tian:On-demand data broadcast with deadlines for avoiding conflicts in wireless networks. Journal of Systems and Software 103: 118-127 (2015)

9.   (ERA A) Kewen Liao, Hong Shen, Longkun Guo:Improved approximation algorithms for constrained fault-tolerant resource allocation. Theor. Comput. Sci. 590: 118-128 (2015)

10. (ERA A*) Yanbo Wu, Hong Shen, and Quan Z. Sheng, “A Cloud-Friendly RFID Trajectory Clustering Algorithm in Uncertain Environments”, IEEE Transactions on Parallel and Distributed System 26(8): 2075-2088 (2015).

11. (ERA A*) Wenhao Su and Hong Shen, “Incremental Feature Selection Based on Rough Set in Dynamic Incomplete Data”, Pattern Recognition, 47(12): 3890-3906 (2014).

12. (ERA A*) Kewen Liao and Hong Shen, “LP-Based Approximation Algorithms for Reliable Resource Allocation”, The Computer Journal, Oxford Press, 57(1): 154-164 (2014).

13. (ERA A) Hong Shen and Shihong Xu, Approximation Algorithms for Fault Tolerant for Facility Application, SIAM Journal on Discrete Mathematics, 27(3): 1584-1609, (2013).

14. (ERA A*) Hong Shen and Longkun Guo, “An 8-Approximation Algorithm for Computing Rooted 3-Vertex Connected Minimum Steiner Networks”, IEEE Transactions on Computers, 62(9): 1684-1693 (2013).

15. (ERA A) Yidong Li and Hong Shen. On Identity Disclosure Control for Hypergraph-based Data Publishing, IEEE Transactions on Information Forensics and Security, 8(8): 1384-1396 (2013).

16. (ERA A*) Longkun Guo and Hong Shen, “On Finding Min-Min Disjoint Paths”, Algorithmica, 66(3): 641-653 (2013).

17. (ERA A*) Yanbo Wu, Quan Z. Sheng, Hong Shen, and SheraliZeadally, “Modeling Object Flows from Distributed and Federated RFID Data Streams for Efficient Tracking and Tracing”. IEEE Transactions on Parallel and Distributed Systems, 24(10): 2036-2045 (2013).  

18. (ERA A*) Hong Shen and Longkun Guo, “Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks”, IEEE Transactions on Computers, 61(7): 954-968 (2012).

19. (ERA A) Longkun Guo and Hong Shen, “On the Complexity of the Edge-Disjoint Min-Min Problem in Planar Digraphs”, Theoretical Computer Science, Vol 432: 58-63 (2012).

20. (ERA A*) Yingpeng Sang, Hong Shen, HuiTian: Effective Reconstruction of Data Perturbed by Random Projections, IEEE Transactions on Computers, 61(1): 101-117 (2012).