Curriculum Vitae

Li-Hsuan Chen 陳立軒

E-mail: lhchen@cs.ccu.edu.tw

Experience

02/2024∼ Assistant Professor National Chung Cheng University, Taiwan
02/2023∼01/2024 Assistant Professor National Taipei University of Business, Taiwan
10/2020∼ 07/2022 Technical Manager Pro Brand Technology(TW) INC., Taiwan
Design and implement beamforming algorithms for 5G communication phased array antenna module.
06/2019∼ 04/2020 Technical Manager Kenkone Medical Co., Ltd., Taiwan
Build a speech recognition system to fill in medical report orally.
04/2018∼ 03/2019 Deputy Technical Manager AROBOT Innovation Co., Ltd., Taiwan
Build a Chinese speech recognition system for Children accompany Robot.
09/2016∼ 07/2017 Postdoctoral Research Fellow National Cheng Kung University,Taiwan.
09/2014∼ 08/2015 Visiting PhD student in RWTH Aachen University Germany, supported by MOST-DAAD Sandwich Program under grant no. 103-2911-I-194-506.

Expertise

  1. Graph algorithms:
    Fixed-parameter algorithms, approximation algorithms, exponential time exact algorithms

  2. Voice recognition:
    Mandaring voice recognition, Medical English voice recognition

  3. Antenna array beamforming algorithms:
    Beamforming algorithm for 5G phased array antenna

Honor

  1. Excellent Industrial System Award,
    Formosa Speech Recognition Challenge, Taipei, Taiwan, 2018

  2. Best Ph.D. Thesis Award,
    Associtaion for Algorithms and Computation Theory, Taiwan, 2016

  3. Best Paper Award,
    Associtaion for Algorithms and Computation Theory, Taiwan, 2015

  4. Scholarship for visiting Germany for one yesr,
    MOST-DAAD Sandwich Program, 2014

  5. TOEIC 935

  6. Best Paper Award,
    34th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, 2017

  7. Best Paper Award Candidate,
    31th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, 2014

  8. Workshop Best Paper Award,
    National Computer Symposium, Taiwan, 2013

  9. Best Paper Award,
    National Computer Symposium, Taiwan, 2011

Education

09/2011∼01/2016 Ph.D degree in Computer Science, National Chung Cheng University, Chia-Yi, Taiwan, R.O.C.
09/2005∼07/2009 M.Sc. degree in Physics, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.
09/2001∼06/2005 B.S. degree in Physics, National Tsing Hua University, Hsinchu, Taiwan, R.O.C.

Teaching Experience

Lecturer(part time) Department of Computer Science and Information Engineering, National Chung Cheng University, Taiwan, R.O.C.
09/2015∼ 01/2016 Introduction to Computer Science
Teacher Assistant Department of Computer Science and Information Engineering, National Chung Cheng University, Taiwan, R.O.C.
02/2013∼ 06/2013 Course: Discrete Mathematics
Level: Undergraduate students
09/2011∼ 01/2012 Course: Computer Algorithms
Level: Graduate students

Publication List

Journal Paper

  1. 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, in Theoretical Computer Science -Volume 922, pp. 13–24, 2022.

  2. Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality, in Algorithmica -Volume 84, pp. 1993–2027, 2022.

  3. Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze and Peter Rossmanith, Online Node-and Edge-Deletion Problems with Advice, in Algorithmica, -Volume 83, pp. 2719–2753, 2021.

  4. Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Approximation algorithms for the p-hub center routing problem in parameterized metric graphs, in Theoretical Computer Science, -Volume 806, pp. 271–280, 2020.

  5. Hsin-Hung Chou, Ching-Tien Hsu, Li-Hsuan Chen, Yue-Cheng Lin, Sun-Yuan Hsieh, A Novel Branch-and-Bound Algorithm for the Protein Folding Problem in the 3D HP Model, in IEEE ACM Trans. Comput. Biol. Bioinform. -Volume 18, pp. 455–462, 2019.

  6. 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, in Discrete Applied Mathematics, -Volume 251, pp. 114–125, 2018.

  7. Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming, in Algorithms, -Volume 11, -Issue 7, -Article 98, 2018.

  8. Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu, Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality, in Journal of Computer and System Sciences, -Volume 92, pp. 92–112, 2018.

  9. Li-Hsuan Chen, and Bang Ye Wu, Parameterized algorithms for min-max 2-cluster editing, in Journal of Combinatorial Optimization, -Volume 34, -Issue 1, pp. 47–63, 2017.

  10. Bang Ye Wu, and Li-Hsuan Chen, An improved parameterized algorithm for the p-cluster vertex deletion problem, in Journal of Combinatorial Optimization, -Volume 33, -Issue 2, pp. 373–388, 2017.

  11. Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, and Ping-Chen Su, Fixed-parameter algorithms for vertex cover P3, in Discrete Optimization, -Volume 19, pp. 12–22, 2016.

  12. Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, An O*(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs, in Journal of Combinatorial Optimization, -Volume 32, -Issue 2, pp. 594–607, 2016.

  13. Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Moderately exponential time algorithms for the maximum induced matching problem, in Optimization Letters, -Volume 9, pp. 981–998, 2015.

  14. Bang Ye Wu, and Li-Hsuan Chen, Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions, in Algorithmica, -Volume 72, pp. 818–835 , 2015.

  15. Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, and Guan-Han Wu, Exact algorithms for problems related to the densest k-set problem, in Information Processing Letters, -Volume 114, pp. 387–391 , 2014.

  16. Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, and Bang Ye Wu, On the min-max 2-cluster editing problem, in Journal of Information Science and Engineering, -Volume 29, pp. 1109–1120 , 2013.

Conference Paper

  1. Shih-Chia Chang, Li-Hsuan Chen, Ling-Ju Hung, Shih-Shun Kao, Ralf Klasing, The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs, in proceedings of ICS 2020, pp 126–130, 2020.

  2. Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith, Further Results on Online Node- and Edge-Deletion Problems with Advice, in proceedings of IWOCA 2020 pp. 140–153, 2020.

  3. Li-Hsuan Chen, Chieh-Kuo Hu, Ling-Ju Hung, Chen-Wan Lin, Towards a Robust Taiwanese Mandarin Automatic Speech Recognition System with Kaldi Toolkit, in Proceeding of Formosa Speech Recognition-2018 Workshop Excellent Industrial System Award

  4. Sun-Yuan Hsieh, Li-Hsuan Chen, Wei Lu: An Approximation Algorithm for Star p-Hub Routing Cost Problem, Proceedings of ICS 2018 pp. 524–531, 2018

  5. 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, in proceedings of IWOCA 2018 pp. 115–127, 2018.

  6. Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung and Peter Rossmanith. An efficient fixed-parameter algorithm for the 2-plex bipartition problem, in proceedings of ISSAAC 2017 pp. 20:1–20:13, 2017.

  7. Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, The approximability of the p-hub center problem with parameterized triangle inequality, in proceedings of COCOON 2017 pp. 112–123, 2017.

  8. Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung and Bang Ye Wu, An approximation algorithm for single allocation k-hub routing problem, in proceedings of the 34th Workshop on Combinatorial Mathematics and Computation Theory, paper 20, 2017. Best Paper Award

  9. 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, in proceedings of CIAC 2017, pp. 152–163, 2017.

  10. 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, in proceedings of COCOON 2016, pp. 222–234, 2016.

  11. 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, in proceedings of the 33th Workshop on Combinatorial Mathematics and Computation Theory, pp. 13–18, 2016. Best Paper Award Candidate

  12. 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.

  13. Maw-Shang Chang, Li-Hsuan Chen,Ling-Ju Hung, A 5k kernel for P2-packing in net-free graphs, in proceedings of 2014 International Computer Science and Engineering Conference: ICSEC 2014 iTAG Workshop, pp. 513–518.

  14. Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, and Somnath Sikdar, An O*(1.4658n)-time algorithm for the bounded-degree-1 set problem, in proceedings of the 31th Workshop on Combinatorial Mathematics and Computation Theory, pp. 9–18, 2014. Best Paper Award Candidate

  15. Bang Ye Wu, Chen-Wan Lin, and Li-Hsuan Chen, The Steiner ratio of the clustered Steiner tree problem is three, in proceedings of the 31th Workshop on Combinatorial Mathematics and Computation Theory, pp. 44–50, 2014. Best Paper Award Candidate

  16. Li-Hsuan Chen, and Bang Ye Wu, A kernelization algorithm for the min max p cluster editing problem, in proceedings of the 31th Workshop on Combinatorial Mathematics and Computation Theory, pp. 73–77, 2014. Best Paper Award Candidate

  17. Maw-Shang Chang, Li-Hsuan Chen, and Ling-Ju Hung, An O*(1.4658n)-time algorithm for the maximum induced matching problem, to appear in Proceedings of NCS 2013. Best Paper Award

  18. Bang Ye Wu, Li-Hsuan Chen, Chen-Wan Lin, and Chun-Chieh Wang, An Exact Algorithm for Correlation Clustering on Labelled Items, in proceedings of the 30th Workshop on Combinatorial Mathematics and Computation Theory, pp. 143–149, 2013.

  19. Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, and Bang Ye Wu, On the min-max 2-cluster editing problem, in 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. 133–142 , 2013.

  20. 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, in Proceedings of NCS 2011: Algorithms and Bioinformatics Workshop, pp. 1–9, 2011. Best Paper Award