Yen Hung Chen - RankMe

21 papers A 1C 1Misc 2Journal 11Unranked 6

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Approximability results for the $p$-centdian and the converse centdian problems. Discret. Math. Theor. Comput. Sci. Yen Hung Chen
2022	J	`jnl`	The Clustered Selected-Internal Steiner Tree Problem. Int. J. Found. Comput. Sci. Yen Hung Chen
2020	J	`jnl`	Approximability results for the p-centdian and the converse centdian problems. CoRR Yen Hung Chen
2020	J	`jnl`	Approximating the clustered selected-internal Steiner tree problem. CoRR Yen Hung Chen
2018	A	`conf`	A Measure and Conquer Algorithm for the Minimum User Spatial-Aware Interest Group Query Problem. ICS Chih-Yang Huang, Po-Chuan Chien, Yen Hung Chen
2016	J	`jnl`	Approximability results for the converse connected p-centre problem. Int. J. Comput. Math. Yen Hung Chen
2016	J	`jnl`	The bottleneck selected-internal and partial terminal Steiner tree problems. Networks Yen Hung Chen
2014	—	`conf`	The Dominated Coloring Problem and Its Application. ICCSA (6) Yen Hung Chen
2012	C	`conf`	Approximation Hardness of the Mixed Dominating Set Problem. CTW Yen Hung Chen
2012	J	`jnl`	Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem. J. Appl. Math. Yen Hung Chen
2012	J	`jnl`	The J. Comput. Biol. Yen Hung Chen
2011	—	`conf`	An Improved Approximation Algorithm for the Terminal Steiner Tree Problem. ICCSA (3) Yen Hung Chen
2010	J	`jnl`	On the bottleneck tree alignment problems. Inf. Sci. Yen Hung Chen, Chuan Yi Tang
2009	—	`conf`	A Fast Approximation Algorithm for the ICCSA (2) Yen Hung Chen
2009	J	`jnl`	Optimal economic production quantity policy for imperfect process with imperfect repair and maintenance. Eur. J. Oper. Res. Gwo-Liang Liao, Yen Hung Chen, Shey-Huei Sheu
2007	—	`conf`	Approximation Algorithms for 2-Source Minimum Routing Cost ICCSA (3) Yen Hung Chen, Gwo-Liang Liao, Chuan Yi Tang
2006	J	`jnl`	Approximation algorithms for some Networks Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang
2006	—	`conf`	The Bottleneck Tree Alignment Problems. ICCSA (3) Yen Hung Chen, Chuan Yi Tang
2005	Misc	`conf`	Disjoint Segments with Maximum Density. International Conference on Computational Science (2) Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang
2004	—	`conf`	Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. ICCSA (3) Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang
2003	Misc	`conf`	On the Full and Bottleneck Full Steiner Tree Problems. COCOON Yen Hung Chen, Chin Lung Lu, Chuan Yi Tang