On the Full and Bottleneck Full Steiner Tree Problems. - Yen Hung Chen; Chin Lung Lu; Chuan Yi Tang (COCOON, 2003)

Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. - Yen Hung Chen; Bang Ye Wu; Chuan Yi Tang (ICCSA (3), 2004)

Disjoint Segments with Maximum Density. - Yen Hung Chen; Hsueh-I Lu; Chuan Yi Tang (International Conference on Computational Science (2), 2005)

Approximation algorithms for some k-source shortest paths spanning tree problems. - Yen Hung Chen; Bang Ye Wu; Chuan Yi Tang (Networks, 2006)

Approximation Algorithms for 2-Source Minimum Routing Cost k -Tree Problems. - Yen Hung Chen; Gwo-Liang Liao; Chuan Yi Tang (ICCSA (3), 2007)

A Fast Approximation Algorithm for the k Partition-Distance Problem. - Yen Hung Chen (ICCSA (2), 2009)

Optimal economic production quantity policy for imperfect process with imperfect repair and maintenance. - Gwo-Liang Liao; Yen Hung Chen; Shey-Huei Sheu (Eur. J. Oper. Res., 2009)

On the bottleneck tree alignment problems. - Yen Hung Chen; Chuan Yi Tang (Inf. Sci., 2010)

An Improved Approximation Algorithm for the Terminal Steiner Tree Problem. - Yen Hung Chen (ICCSA (3), 2011)

Approximation Hardness of the Mixed Dominating Set Problem. - Yen Hung Chen (CTW, 2012)

Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem. - Yen Hung Chen (J. Appl. Math., 2012)

The k Partition-Distance Problem. - Yen Hung Chen (J. Comput. Biol., 2012)

The Dominated Coloring Problem and Its Application. - Yen Hung Chen (ICCSA (6), 2014)

Approximability results for the converse connected p-centre problem. - Yen Hung Chen (Int. J. Comput. Math., 2016)

The bottleneck selected-internal and partial terminal Steiner tree problems. - Yen Hung Chen (Networks, 2016)

A Measure and Conquer Algorithm for the Minimum User Spatial-Aware Interest Group Query Problem. - Chih-Yang Huang; Po-Chuan Chien; Yen Hung Chen (ICS, 2018)

Approximating the clustered selected-internal Steiner tree problem. - Yen Hung Chen (CoRR, 2020)

Approximability results for the $p$-centdian and the converse centdian problems. - Yen Hung Chen (Discret. Math. Theor. Comput. Sci., 2022)

The Clustered Selected-Internal Steiner Tree Problem. - Yen Hung Chen (Int. J. Found. Comput. Sci., 2022)