研發領域
經歷
助理教授，國際貿易學院商業管理學系，國立台北商業大學
博士後研究員，國際貿易學院，國立台北商業大學
高級經理，算法部門，AROBOX創新有限公司
博士後研究員，國立成功大學資訊工程學系，台灣
博士後研究員，弘光大學，台灣
學歷
國立中正大學資訊工程學博士
書籍製作
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
專利資料
| # | 核准編號 | 發明人 | 專利名稱 | 國別 | 類型 |
|---|
論文資料
| # | 論文名稱 | 檔案下載 |
|---|---|---|
| 1 | Chen, L.-H., & Hung, L.-J., & Klasing, R. (2024). "Paired restraint domination in extended supergrid graphs." The Journal of Supercomputing. | |
| 2 | Yeh, H.-P., & Lu, W., & Chen, L.-H., & Hung, L.-J., & Klasing, R., & Hsieh, S.-Y. (2022). "Hardness and approximation for the star p-hub routing cost problem in metric graphs." Theoretical Computer Science. | |
| 3 | Chen, L.-H., & Hsieh, S.-Y., & Hung, L.-J., & Klasing, R. (2022). "On the approximability of the single allocation p-hub center problem with parameterized triangle inequality." Algorithmica. | |
| 4 | Chen, L.-H., & Hung, L.-J., & Lotze, H., & Rossmanith, P. (2021). "Online Node- and Edge-Deletion Problems with Advice." Algorithmica. | |
| 5 | Chen, C.-T., & Hung, L.-J., & Hsieh, S.-Y., & Buyya, R., & Zomaya, A. Y. (2020). "Heterogeneous job allocation scheduler for Hadoop mapreduce using dynamic grouping integrated neighboring search." IEEE Transactions on Cloud Computing. | |
| 6 | Chen, L.-H., & Hsieh, S.-Y., & Hung, L.-J., & Klasing, R. (2020). "Approximation algorithms for the p-hub center routing problem in parameterized metric graphs." Theoretical Computer Science. | |
| 7 | Chang, M.-S., & Chen, L.-H., & Hung, L.-J., & Liu, Y.-Z., & Rossmanith, P., & Sikdar, S. (2018). "Moderately exponential time algorithms for the maximum bounded-degree-1 set problem." Discrete Applied Mathematics. | |
| 8 | Chen, L.-H., & Cheng, D.-W., & Hsieh, S.-Y., & Hung, L.-J., & Klasing, R., & Lee, C.-W., & Wu, B. Y. (2018). "Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality." Journal of Computer and System Sciences. | |
| 9 | Chang, M.-S., & Chen, L.-H., & Hung, L.-J. (2015). "Moderately exponential time algorithms for the maximum induced matching problem." Optimization Letters. | |
| 10 | Chang, M.-S., & Chen, L.-H., & Hung, L.-J., & Rossmanith, P., & Wu, G.-H. (2014). "Exact algorithms for problems related to the densest k-set problem." Information Processing Letters. | |
| 11 | Chang, M.-S., & Hung, L.-J., & Lin, C.-R., & Su, P.-C. (2013). "Finding large k-clubs in undirected graphs." Computing. | |
| 12 | Chang, M.-S., & Hung, L.-J., & Rossmanith, P. (2013). "Recognition of probe distance-hereditary graphs." Discrete Applied Mathematics. | |
| 13 | Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "On the threshold-width of graphs." Journal of Graph Algorithms and Applications. | |
| 14 | Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science.Chang, M.-S., & Hung, L.-J., & Kloks, T., & Peng, S.-L. (2011). "Block-graph width." Theoretical Computer Science. | |
| 15 | Hung, L.-J., & Kloks, T. (2011). "k-Cographs are Kruskalian." Chicago Journal of Theoretical Computer Science. | |
| 16 | Lee, C.-M., & Hung, L.-J., & Chang, M.-S., & Shen, C.-B., & Tang, C.-Y. (2005). "An Improved algorithm for the maximum agreement subtree problem." Information Processing Letters. |
計畫資料
| # | 簽訂年度 | 計畫名稱 | 合作單位 | 計畫金額 |
|---|---|---|---|---|
| 1 | 2025 | 一些網路設計最佳化問題之擬多項式時間近似演算法研究(2/2) | 國科會 | 240000 |
| 2 | 2024 | 一些網路設計最佳化問題之擬多項式時間近似演算法研究(1/2) | 國科會 | 240000 |
| 3 | 2023 | 網路擴充設計之固定參數近似演算法研究 | 國科會 | 2116000 |
| 4 | 2022 | 一些網路擴充問題之近似穩定度研究 | 國科會 | 808000 |
| 5 | 2022 | 利用圖形分割解決災害逃生問題之研究 | 國科會 | 700000 |
| 6 | 2017 | The 10th International Conference on Algorithms and Complexity （CIAC 2017） | 國科會 | 70000 |
| 7 | 2016 | The 22nd International Computing and Combinatorics Conference (COCOON 2016) | 國科會 | 61610 |
| 8 | 2009 | 第16屆計算機：澳大拉西亞理論研討會 | 國科會 | 35000 |
技轉資料
| # | 簽訂年度 | 計畫名稱 | 合作單位 | 計畫金額 |
|---|