Wu-Hsiung Lin

According to our database, Wu-Hsiung Lin authored at least 10 papers between 2010 and 2021.

Collaborative distances:

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

2021

Equilateral Spherical Drawings of Planar Cayley Graphs.

Ming-Hsuan Kang, Wu-Hsiung Lin

J. Graph Algorithms Appl., 2021

2020

An Effective Sensor Deployment Scheme that Ensures Multilevel Coverage of Wireless Sensor Networks with Uncertain Properties.

Yu-Ning Chen, Wu-Hsiung Lin, Chiuyuan Chen

Sensors, 2020

2019

Mutual transferability for (F, B, R)-domination on strongly chordal graphs and cactus graphs.

Kuan-Ting Chu, Wu-Hsiung Lin, Chiuyuan Chen

Discret. Appl. Math., 2019

2018

A Suggestion of a New Measure of Importance of Nodes in Disease-propagation Graphs.

Siyu Liu, Chiuyuan Chen, Wu-Hsiung Lin

Proceedings of the 2nd High Performance Computing and Cluster Technologies Conference, 2018

2017

Optimal coloring for data collection in tree-based wireless sensor networks.

Shih-Ming Lo, Wu-Hsiung Lin, Chiuyuan Chen, Yu-Chee Tseng

Theor. Comput. Sci., 2017

2013

<i>b</i>b-chromatic numbers of powers of paths and cycles.

Wu-Hsiung Lin, Gerard J. Chang

Discret. Appl. Math., 2013

b-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture.

Wu-Hsiung Lin, Gerard J. Chang

Discret. Appl. Math., 2013

2012

Equitable colorings of Cartesian products of graphs.

Wu-Hsiung Lin, Gerard J. Chang

Discret. Appl. Math., 2012

2011

Resource-sharing systems and hypergraph colorings.

Wu-Hsiung Lin, Gerard J. Chang

J. Comb. Optim., 2011

2010

Equitable colorings of Kronecker products of graphs.

Wu-Hsiung Lin, Gerard J. Chang

Discret. Appl. Math., 2010