跳到主要內容區

網站導覽
相關網站

洪綾珠副教授

Photo of Ling-Ju Hung

洪綾珠 Hung, Ling-Ju

副教授 Associate Professor

Email:ljhung@ntub.edu.tw

Office:A525


Education

Ph.D. degree in Computer Science and Information Engineering, National Chung Cheng University

Employment Record

  • Assistant Professor, Department of Business Administration, College of Management, National Taipei University of Business.
  • Postdoctoral Research Fellow, College of Management, National Taipei University of Business.
  • Senior Manager, Department of Algorithms, AROBOT Innovation CO., LTD.
  • Postdoctoral Research Fellow, Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan.
  • Postdoctoral Research Fellow, HungKuang University, Taiwan

Research Interests

  • Design and analysis of Algorithms
  • Robot interactive programming
  • Digital exhibition design

Publication List

Journal Papers

  • Hao-Ping Yeh, Wei Lu, Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing, Sun-Yuan Hsieh, Hardness and approximation for the star p-hub routing cost problem in metric graphs, Theoretical Computer Science, Accepted. Corresponding author 
  • Li-Hsuan Chen. Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing (2022, Jan). On the approximability of the single allocation p-hub center problem with parameterized triangle inequality. Algorithmica. Corresponding author  (View PDF)
  • Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze and Peter Rossmanith, Further Results on Online Node- and Edge-Deletion Problems with Advice, Algorithmica 83 (2021), 2719-2753. (SCI, EI)
  • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, and Ralf Klasing, Approximation algorithms for the p-hub center routing problem in parameterized metric graphs, Theoretical Computer Science, 806 (2020), 271-280.  (SCI, EI)
  • Chi-Ting Chen, Ling-Ju Hung, Sun-Yuan Hsieh, Rajkumar Buyya, and Albert Y. Zomaya, Heterogeneous job allocation scheduler for Hadoop mapreduce using dynamic grouping integrated neighboring search, IEEE Transactions on Cloud Computing, 8 (2020), pp. 193-206.
  • Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, and Somnath Sikdar, Moderately exponential time algorithms for the maximum bounded-degree-1 set problem, Discrete Applied Mathematics, 251 (2018), pp. 114-125. (SCI, EI) Corresponding author
  • Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, and Bang Ye Wu, Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality, Journal of Computer and System Sciences, 92 (2018), pp. 92-112. (SCI, EI) Corresponding author
  • 謝孫源、李佳衛、洪綾珠, 通俗演算法, 527期, 2016年11月, pp. 6-11, 科學發展月刊
  • Maw-Shang Chang, Li-Hsuan Chen, and Ling-Ju Hung, An O*(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs, Journal of Combinatorial Optimization, 32 (2016), pp. 594-607. (SCI, EI) Corresponding author
  • Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, and Ping-Chen Su, Fixed-parameter algorithms for vertex cover P3, Discrete Optimization, 19 (2016), 12-22. (SCI, EI) Corresponding author
  • Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Moderately exponential time algorithms for the maximum induced matching problem, Optimization Letters, 9 (2015), 981-998. (SCI, EI) Corresponding author
  • Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu, Exact algorithms for problems related to the densest k-set problem, Information Processing Letters, 114 (2014), pp. 510-513. (SCI, EI) Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, Chih-Ren Lin, Ping-Chen Su, Finding large k-clubs in undirected graphs, Computing, 95 (2013), 739-758. (SCI, EI) Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, and Peter Rossmanith, Recognition of probe distance-hereditary graphs, Discrete Applied Mathematics, 161 (2013), 336-348. (SCI, EI) Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, Ton Kloks and Sheng-Lung Peng, Block-graph width, Theoretical Computer Science, 412 (2011), 2496-2502. (SCI, EI)
  • Ling-Ju Hung and Ton Kloks, k-Cographs are Kruskalian, Chicago Journal of Theoretical Computer Science, 2 (2011), 1-11. Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, Ton Kloks and Sheng-Lung Peng, On the threshold-width of graphs, Journal of Graph Algorithms and Applications, 15 (2011), 253-268. Corresponding author
  • Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chia-Ben Shen, and Chuan-Yi Tang, An Improved algorithm for the maximum agreement subtree problem, Information Processing Letters, 94 (2005), 211-216. (SCI, EI)

Conference Papers

  • Hao-Ping Yeh, Wei Lu, Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing and Sun-Yuan Hsieh. Approximation Algorithms for the Star p-Hub Center Routing Problem,Proceedings of the he 14th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC), Tainan, Taiwan, October 22-24, 2021.
  • Shih-Chia Chang, Li-Hsuan Chen, Ling-Ju Hung, Shih-Shun Kao and Ralf Klasing, The hardness and approximation of the densest k-subgraph problem in parameterized metric graphs, 2020 International Computer Symposium (ICS), Tainan, Taiwan, 2020, pp. 126-130, doi: 10.1109/ICS51289.2020.00034. Corresponding author
  • Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, and Peter Rossmanith, Further Results on Online Node- and Edge-Deletion Problems with Advice, Proceedings of The 31st International Workshop on Combinatorial Algorithms (IWOCA 2020), LNCS 12126, pp.140-153, 2020.
  • Li-Hsuan Chen, Chieh-Kuo Hu, Ling-Ju Hung, and Chen-Wan Lin, Towards a Robust Taiwanese Mandarin Automatic Speech Recognition with Kaldi Toolkit, Formosa Speech Recognition Challenge (FSR 2018). Corresponding author, Excellent Industrial System Award
  • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, and Ralf Klasing, Approximation algorithms for the p-hub center routing problem in parameterized metric graphs, Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA 2018), LNCS 10979, pp.115-127, 2018. Corresponding author
  • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, and Peter Rossmanith, An efficient fixed-parameter algorithm for the 2-plex bipartition problem, Proceeding of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), Article No.20; pp.20:1-20:13.
  • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, and Ralf Klasing, The approximability of the p-hub center problem with parameterized triangle inequality, Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON 2017), LNCS 10392, pp.112-123.
  • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, and Bang Ye Wu, An approximation algorithm for single allocation k-hub routing problem,  Proceedings of the 34th Workshop on Combinatorial Mathematics and Computation Theory (CMCT 2017). Best Paper Award
  • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, and Bang Ye Wu, On the complexity of the star p-hub center problem with parameterized triangle inequality, The 10th International Conference on Algorithms and Complexity (CIAC 2017), LNCS 10236, pp. 152-163, 2017. Corresponding author
  • Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, and Bang Ye Wu, Approximation algorithms for the star k-hub center problem in metric graphs, Proceedings of the 22nd Annual International Computing and Combinatorics Conference (COCOON 2016), LNCS 9797, pp. 222-234,2016. Corresponding author
  • Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, and Bang Ye Wu, Approximation algorithms for single allocation k-hub center problem, Proceedings of the 33rd Workshop on Combinatorial Mathematics and Computation Theory (CMCT 2016), pp.13-18, 2016. Best Paper Award Candidate, Corresponding author
  • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, and Peter Rossmanith, Fixed-parameter algorithms for a class of generalized vertex cover problems, The 9th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2016), accepted. Corresponding author
  • Maw-Shang Chang and Ling-Ju Hung, Moderately exponential time approximation algorithms for the maximum bounded-degree-d set problem, Proceedings of the 32nd Workshop on Combinatorial Mathematics and Computation Theory, pp. 1-7, 2015. Best Paper Award, Corresponding author
  • Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, An efficient exact algorithm for P2-packing in cubic graphs, Proceedings of ICS 2014, W.C.-C. Chu et al. (Eds.): Intelligent Systems and Applications, pp. 11-21, IOS Press, 2015. (EI) Corresponding author
  • Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, A 5k kernel for P2-packing in net-free graphs, Proceedings of 2014 International Computer Science and Engineering Conference: ICSEC 2014 iTAG Workshop}, pp. 12-17.  (EI) Corresponding author
  • Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar, An O*(1.4658n)-time exact algorithm for the maximum bounded-degree-1 set problem, Proceedings of the 31st Workshop on Combinatorial Mathematics and Computation Theory, pp. 9-18, 2014. Corresponding author
  • Maw-Shang Chang, Li-Hsuan Chen, and Ling-Ju Hung, An O*(1.4658n)-time algorithm for the maximum induced matching problem, accepted to present in NCS 2013. Workshop Best Paper Award, Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, Moderately exponential time approximation algorithms for the maximum bounded-degree-1 set problem, Proceedings of the 30th Workshop on Combinatorial Mathematics and Computation Theory, pp. 23-30, 2013. Best Paper Award, Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, and Chau-An Miau, An O*(1.4786n)-time algorithm for the maximum induced matching problem, Proceedings of ICS 2012: Algorithms and Bioinformatics Workshop, R. S. Chang, L. C. Jain, and S.-L. Peng (Eds.): Advances in Intelligent Systems & Application}, SIST 20, pp.49-58, 2013. (EI) Corresponding author
  • Maw-Shang Chang and Ling-Ju Hung, A polynomial time algorithm for the composition problem, Proceedings of ICSEC 2012, pp. 71-76, 2012. Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, Ping-Chen Su, Measure and conquer: analysis of a branch-and-reduce algorithm for the maximum bounded-degree-1 set problem, Proceedings of the 29th Workshop on Combinatorial Mathematics and Computation Theory,pp. 136-145, 2012. Corresponding author
  • Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, and Guan-Han Woo, Exact Algorithms for Problems Related to the Densest k-Set Problem, Proceedings of NCS 2011: Algorithms and Bioinformatics Workshop, pp. 1-9, 2011. Best Paper Award, Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, Ping-Chen Su, Exact and fixed-parameter algorithms for problems related to 2-plex, Proceedings of ICSEC 2011, pp. 203-208, 2011. Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, Chih-Ren Lin, Ping-Chen Su, Finding large k-clubs in undirected graphs, Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory, pp. 1-10, 2011. Best Paper Award, Corresponding author
  • Ling-Ju Hung, Ton Kloks, and Fernando S. Villaamil, Black-and-White Threshold Graphs, Proceedings of CATS 2011, CRPIT 119 (2011), pp. 121-130. (EI) Corresponding author
  • Maw-Shang Chang and Ling-Ju Hung, Recognition of probe ptolemaic graphs, Proceedings of IWOCA 2010, LNCS 6460 (2011), pp. 286-290. (EI) Corresponding author
  • Ling-Ju Hung and Ton Kloks, Classifying Rankwidth; k-DH-Graphs, Proceedings of CSR 2010, LNCS 6072 (2010), pp. 195-203. (EI) Corresponding author
  • Ling-Ju Hung and Ton Kloks, On some simple widths, Proceedings of WALCOM 2010, LNCS 5942 (2010), pp. 204-215. (EI) Corresponding author
  • Ling-Ju Hung and Ton Kloks, Kruskalian graphs; k-Cographs, Proceedings of CATS 2010}, CRPIT 109 (2010), pp. 49-53. Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, and Peter Rossmanith, Probe distance-hereditary graphs, Proceedings of CATS 2010, CRPIT 109 (2010), pp. 55-64. Corresponding author 
  • Ling-Ju Hung, Ton Kloks, and Chuan Min Lee, Trivially-Perfect Width, Proceedings of IWOCA 2009, LNCS 5874 (2009), pp. 301-311. (EI) Corresponding author
  • Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, and Sheng-Lung Peng, Block-graph Width, Proceedings of TAMC 2009, LNCS 5532 (2009), pp. 150-157. (EI)
  • Maw-Shang Chang, Ling-Ju Hung, and Peter Rossmanith, Probe bipartite distance-hereditary graphs, Proceedings of NCS 2009, pp. 16-27. Best Paper Award, Corresponding author
  • Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang: An Improved Algorithm for the Maximum Agreement Subtree Problem, Proceedings of BIBE 2004, pp. 533-536. (EI)

Book Edit

  • Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee: Computing and Combinatorics-27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings. Lecture Notes in Computer Science 13025, Springer 2021, ISBN 978-3-030-89542-6
  • J.W.Nienhuys, de Bruijn's combinatorics. Ling-Ju Hung and Ton Kloks (eds.) On-line version available: http://vixra.org/pdf/1208.0223v1.pdf

Honor & Awards

  • Algorithmica: COCOON 2021 Special Issue Guest Editor
  • Theoretical Computer Science: COCOON 2021 Special Issue Guest Editor
  • Journal of Combinatorial Optimization: COCOON 2021 Special Issue Guest Editor
  • COCOON 2021 PC co-chair
  • IWOCA 2020 Program Committee Member
  • 2020/1 法國LaBRI– University of Bordeaux訪問學者
  • 法國LaBRI– University of Bordeaux 邀請演講 (講題 : Approximation algorithms for the p-hub center routing problem in parameterized metric graphs), 2020年1月31日
  • 擔任108、109、110學年度普通型高級中等學校資訊學科能力競賽評審
  • 擔任2020 ICPC Asia Regional Taipei-Hsinchu Contest程式競賽教練
  • 擔任108、109、110學年度普通型高級中等學校資訊學科能力競賽評審
  • 擔任2019 ICPC Asia Regional Taipei-Hsinchu Contest程式競賽教練
  • 第二屆尤努斯東亞年會邀請與談人(2019/11/19)
  • 2017 全國計算機會議Program Committee Member
  • Workshop on Algorithms and Computation Theory Program Committee Member
  • I-SPAN 2017: Track 2: Graphs and Interconnection Networks Program Committee Member
  • ICS 2016: Workshop on Algorithms, Bioinformatics, and Computation Program Committee Member
  • Formosa Speech Recognition Challenge (FSR 2018) Excellent Industrial System Award
  • 32nd Workshop on Combinatorial Mathematics and Computation Theory Best Paper Award
  • 30th Workshop on Combinatorial Mathematics and Computation Theory Best Paper Award
  • NCS 2013. Workshop Best Paper Award
  • NCS 2011: Best Paper Award
  • 28th Workshop on Combinatorial Mathematics and Computation Theory Best Paper Award
  • NCS 2009: Best Paper Award

Projects

  • 勞動部產業新尖兵計畫「互動程式設計人才培訓班」(2021/7/12~2021/8/20,共240小時課程) 獲補助金額NTD 1,841,500,計畫協同主持人
  • 昇恆昌股份有限公司智慧商店行動商務代訓計畫協同主持人
  • 行政院農委會「美人腿友善耕作-食農教育暨餐桌感恩文化傳承的數位推廣」計畫協同主持人
  • 大學社會責任—臺北寧夏夜市環保典範移轉共創雙城街夜市綠色消費環境」計畫協同主持人
  • 計程車駕駛員服務轉型與職能培訓講習班成果展示活動計畫協同主持人 (臺北市計程車客運商業同業公會
  • 計程車駕駛員服務轉型與職能培訓講習班第2期成果展示活動計畫協同主持人 (臺北市計程車客運商業同業公會)
  • 計程車駕駛員智慧服務轉型及職能培訓成果展示活動計畫協同主持人 (新北市計程車客運商業同業公會)