Dr. Rui Wang's Home Pages

Essays (most in Chinese )

Rui Wang

B.Sc. and M.Eng, Shandong University; Ph.D., The University of Hong Kong
Associate Professor in the Department of Computer Science, The Ocean University of China
Emails: rwang@plcamr.com ; rwang@cs.hku.hk

Tel: (+86) 139-69809328

QQ: http://user.qzone.qq.com/1219126588 (for my off-road life only)

Dr. Wang joined the Department of Computer Science, The Ocean University of China as a teacher in 1986. His originally work was focused on developing real software for real applications, which consumed about 15 years of his professional life. During that period, he designed and implemented many successful industrial collaboration projects. Four large scale ones among them are the MIS of Electricity Company, Social Security Systems, Court MIS, and Automatic Meter Reading via Power Line Communication Networks (AMR). Of which, the second last project (Court MIS) has been adopted throughout and outside the province in this country, and the last one (AMR) has been fully commercialized and marketed worldwide, refer to Eastsoft LTD for detail information about these projects.

In the recent years, while continue to provide consultancy to AMR systems, Dr. Wang's research interests have migrated to theoretical aspects of computer science. His theoretical work has closed a number of long-standing open problems and got published in top international conferences and prestigious journals.

In his spare time, Dr. Wang pretends to be a chess player. He derives a lot of pleasure from playing Chinese Xiangqi, and likes to play on Ourgame at times when he is not so much loaded with work. He loves off-road sports, and as being a member of "Off-Road E-Society", visits http://www.fblife.com regularly.

Research Interests

Algorithms, Computational Complexity, Routing Methods in Parallel, Distributed, and Power Line Communication Networks.

Teaching

Algorithms, fall 2010.
Probabilistic Methods in Computer Science, spring 2010
Algorithms, fall 2009.
Probabilistic Methods in Computer Science, spring 2009
English for Computer Science, fall 2008
Algorithms, fall 2008.
Probabilistic Methods in Computer Science, spring 2008
English for Computer Science, fall 2007
Algorithms, fall 2007.

Talk Presentation

Link and Lower Layers in PLC Networks, EastSoft, June 9-11, 2008 (Handout for print, Screen-Display for presentation).

Representative Publications

· K. Wang, R. Wang, and Y.Y. Liu, "All-Shortest-Path 2-Interval Routing is NP-Complete", Journal of Applied Mathematics and Computing, Vol. 32, No. 2, April 2010, 479-489. doi: 10.1007/s12190-009-0265-2.

· R. Wang, F.C.M. Lau, and Y.Y. Liu, "On the Hardness of Minimizing Space for All-Shortest-Path Interval Routing Schemes", Theoretical Computer Science, Vol. 389, Nos. 1-2, December 2007, 250-264. doi:10.1016/j.tcs.2007.09.010.

· R. Wang, F.C.M. Lau, and Y.C. Zhao, "Hamiltonicity of Regular Graphs and Blocks of Consecutive Ones in Symmetric Matrices", Discrete Applied Mathematics, Vol. 155, Issue 17, October 2007, 2312-2320. doi:10.1016/j.dam.2007.06.009.

· R. Wang and F.C.M. Lau, "Optimal gossiping in square 2D meshes", Theoretical Computer Science, Vol. 384, Nos. 2-3, October 2007, 263-286. doi:10.1016/j.tcs.2007.04.032.

· R. Wang and F.C.M. Lau, "Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets", Proc. 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), Lecture notes in Computer Science, Vol.3104, Springer-verlag, Le Mont St. Michel, France, May 2005, 292-306.

· R. Wang, F.C.M. Lau, and Y.Y. Liu, "NP-Complete Results for All-Shortest Paths Interval Routing", Proc. of 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2004), Lecture notes in Computer Science, Vol.3499, Springer-verlag, Smolenice Castle, Slowakia, June 2004, 267-278.

· 马绍汉, 王锐, "Steiner 树问题的近似算法", 计算机学报, 7:7, 1989, 558-560.