
Postdoctoral Fellow  Yu, HungI 





Publications 

Journal Articles  
1. 
HungI Yu, TienChing Lin, and D. T. Lee, "The (11)Centroid Problem in the Plane with Distance Constraints," to appear in International Journal of Computational Geometry and Applications. 
2. 
HungI Yu, ChengChung Li, and D.T. Lee, "The multiservice center problem," to appear in Theoretical Computer Science. 
3. 
ChengHsiao Tsou, GenHuey Chen, HungI Yu, ChingChi Lin, "The broadcast median problem in heterogeneous postal model," Journal of Combinatorial Optimization, volume 25, number 4, pages 602616, January 2013. ::: 
4. 
ChiYuan Chan, HungI Yu, WingKai Hon, BiingFeng Wang, "Faster query algorithms for the text fingerprinting problem," Information and Computation, volume 209, number 7, pages 10571069, July 2011. ::: 
5. 
HungI Yu, TzuChin Lin, and BiingFeng Wang, "Improved Algorithms for the MinmaxRegret 1Center and 1Median Problems," ACM Transactions of Algorithms, volume 4, number 3, pages Article 36, June 2008. ::: 
6. 
BiingFeng Wang, Shietung Peng, HongYi Yu, and ShanChyun Ku, "Efficient Algorithms for a Constrained kTree Core Problem in a Tree Network," Journal of Algorithms, volume 59, number 2, pages 107124, May 2006. ::: 


Conference Papers  
1. 
HungI Yu, TienChing Lin, and D. T. Lee, "The (11)Centroid Problem on the Plane Concerning Distance Constraints," Proceedings, 27th International Symposium on Algorithms and Computation, Dec. 1214, 2016, Sydney, Australia, Lecture Notes in Computer Science, volume 64, LIPIcs, ISBN 9783959770262,, pages 64:1  64:12, Schloss Dagstuhl  LeibnizZentrum fuer Informatik, December 2016, LIPIcs 64, Schloss Dagstuhl  LeibnizZentrum fuer Informatik 2016, ISBN 9783959770262, 64:164:12, 2016. ::: 
2. 
劉士琦，游弘毅，林添進, "在無線隨意網路上能耗拓展圖之功率最小化問題的改良貪婪演算法," 第三十二屆組合數學與計算理論研討會, pages 187196, April 2015. 
3. 
HungI Yu, ChengChung Li, "The MultiService Center Problem," Proceedings of the 23rd International Symposium, ISAAC 2012, Lecture Notes in Computer Science, 7676, KunMao Chao, Tsansheng Hsu and DerTsai Lee, editors, pages 578587, December 2012. ::: 
4. 
HungI Yu, TienChing Lin, D. T. Lee, "Finding Maximum Sum Segments in Sequences with Uncertainty," Proceedings of the 22nd International Symposium, ISAAC 2011, Lecture Notes in Computer Science, 7074, Takao Asano, ShinIchi Nakano, Yoshio Okamoto and Osamu Watanabe, editors, pages 734743, December 2011. ::: 
5. 
ChiYuan Chan, HungI Yu, WingKai Hon, and BiingFeng Wang, "A Faster Query Algorithm for the Text Fingerprinting Problem," Proceedings of the 15th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, 4698, pages 123135, October 2007. ::: 
6. 
TzuChin Lin, HungI Yu, and BiingFeng Wang, "Improved Algorithms for the Minmax Regret 1Center Problem," Proceedings of the 17th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, 4288, pages 537546, December 2006. 
7. 
HungI Yu, TzuChin Lin, and BiingFeng Wang, "Improved Algorithms for the Minmax Regret 1Median Problem," Proceedings of the 12th Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, 4112, pages 5262, August 2006. 
8. 
HongYi Yu and BiingFeng Wang, "An Improved Algorithm for Finding kcentrums on Weighted Trees," Proceedings of the 9th International Conference on Parallel and Distributed Systems, pages 222225, December 2002. 












