Chinese
English
Postdoctoral Fellow  |  Yu, Hung-I  
 
contact
vita
education
interests
publications
 
 
 
 
 
Publications
 
Journal Articles
 
1. Hung-I Yu, Tien-Ching Lin, and D. T. Lee, "The (1|1)-Centroid Problem in the Plane with Distance Constraints," to appear in International Journal of Computational Geometry and Applications.
2. Hung-I Yu, Cheng-Chung Li, and D.T. Lee, "The multi-service center problem," to appear in Theoretical Computer Science.
3. Cheng-Hsiao Tsou, Gen-Huey Chen, Hung-I Yu, Ching-Chi Lin, "The broadcast median problem in heterogeneous postal model," Journal of Combinatorial Optimization, volume 25, number 4, pages 602-616, January 2013. :::icon
4. Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang, "Faster query algorithms for the text fingerprinting problem," Information and Computation, volume 209, number 7, pages 1057-1069, July 2011. :::icon
5. Hung-I Yu, Tzu-Chin Lin, and Biing-Feng Wang, "Improved Algorithms for the Minmax-Regret 1-Center and 1-Median Problems," ACM Transactions of Algorithms, volume 4, number 3, pages Article 36, June 2008. :::icon
6. Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, and Shan-Chyun Ku, "Efficient Algorithms for a Constrained k-Tree Core Problem in a Tree Network," Journal of Algorithms, volume 59, number 2, pages 107-124, May 2006. :::icon
 
 
Conference Papers
 
1. Hung-I Yu, Tien-Ching Lin, and D. T. Lee, "The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints," Proceedings, 27th International Symposium on Algorithms and Computation, Dec. 12-14, 2016, Sydney, Australia, Lecture Notes in Computer Science, volume 64, LIPIcs, ISBN 978-3-95977-026-2,, pages 64:1 - 64:12, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, December 2016, LIPIcs 64, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2016, ISBN 978-3-95977-026-2, 64:1-64:12, 2016. :::icon
2. 劉士琦,游弘毅,林添進, "在無線隨意網路上能耗拓展圖之功率最小化問題的改良貪婪演算法," 第三十二屆組合數學與計算理論研討會, pages 187-196, April 2015.
3. Hung-I Yu, Cheng-Chung Li, "The Multi-Service Center Problem," Proceedings of the 23rd International Symposium, ISAAC 2012, Lecture Notes in Computer Science, 7676, Kun-Mao Chao, Tsan-sheng Hsu and Der-Tsai Lee, editors, pages 578-587, December 2012. :::icon
4. Hung-I Yu, Tien-Ching 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, Shin-Ichi Nakano, Yoshio Okamoto and Osamu Watanabe, editors, pages 734-743, December 2011. :::icon
5. Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, and Biing-Feng 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 123-135, October 2007. :::icon
6. Tzu-Chin Lin, Hung-I Yu, and Biing-Feng Wang, "Improved Algorithms for the Minmax Regret 1-Center Problem," Proceedings of the 17th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, 4288, pages 537-546, December 2006.
7. Hung-I Yu, Tzu-Chin Lin, and Biing-Feng Wang, "Improved Algorithms for the Minmax Regret 1-Median Problem," Proceedings of the 12th Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, 4112, pages 52-62, August 2006.
8. Hong-Yi Yu and Biing-Feng Wang, "An Improved Algorithm for Finding k-centrums on Weighted Trees," Proceedings of the 9th International Conference on Parallel and Distributed Systems, pages 222-225, December 2002.
 
 
 
bg