NP-Completeness Results for All-Shortest-Path Interval Routing. - Rui Wang 009; Francis C. M. Lau 001; Yan Yan Liu (SIROCCO, 2004)

Optimal Gossiping in Square Meshes in All-Port Mode and with Short Packets. - Rui Wang 009; Francis C. M. Lau 001 (SIROCCO, 2005)

Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices. - Rui Wang 009; Francis C. M. Lau 001; Yingchao Zhao 001 (Discret. Appl. Math., 2007)

Optimal gossiping in square 2D meshes. - Rui Wang 009; Francis C. M. Lau 001 (Theor. Comput. Sci., 2007)

On the hardness of minimizing space for all-shortest-path interval routing schemes. - Rui Wang 009; Francis C. M. Lau 001; Yan Yan Liu (Theor. Comput. Sci., 2007)