Scopus
Conference Paper
1
Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests
Chen L.H., Hung L.J., Klasing R.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2024, 15180 LNCS , 99-110
Article
2
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality
Chen L.H., Hsieh S.Y., Hung L.J., Klasing R.
Algorithmica
2022, 84 (7) , 1993-2027
Article
3
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs
Yeh H.P., Lu W., Chen L.H., Hung L.J., Klasing R., Hsieh S.Y.
Theoretical Computer Science
2022, 922 , 13-24
Article
4
Online Node- and Edge-Deletion Problems with Advice
Chen L.H., Hung L.J., Lotze H., Rossmanith P.
Algorithmica
2021, 83 (9) , 2719-2753
Article
5
A Novel Branch-and-Bound Algorithm for the Protein Folding Problem in the 3D HP Model
Chou H.H., Hsu C.T., Chen L.H., Lin Y.C., Hsieh S.Y.
IEEE/ACM Transactions on Computational Biology and Bioinformatics
2021, 18 (2) , 455-462
Conference Paper
6
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs
Chang S.C., Chen L.H., Hung L.J., Kao S.S., Klasing R.
Proceedings - 2020 International Computer Symposium, ICS 2020
2020 , 126-130
Article
7
Approximation algorithms for the p-hub center routing problem in parameterized metric graphs
Chen L.H., Hsieh S.Y., Hung L.J., Klasing R.
Theoretical Computer Science
2020, 806 , 271-280
Conference Paper
8
Further Results on Online Node- and Edge-Deletion Problems with Advice
Chen L.H., Hung L.J., Lotze H., Rossmanith P.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2020, 12126 LNCS , 140-153
Conference Paper
9
An Approximation Algorithm for Star p-Hub Routing Cost Problem
Hsieh S.Y., Chen L.H., Lu W.
Communications in Computer and Information Science
2019, 1013 , 524-531
Article
10
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
Chang M.S., Chen L.H., Hung L.J., Liu Y.Z., Rossmanith P., Sikdar S.
Discrete Applied Mathematics
2018, 251 , 114-125
學術著作
1
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs
Hao-Ping Yeh; Wei Lu; Li-Hsuan Chen; Ling-Ju Hung; Ralf Klasing; Sun-Yuan Hsieh
Theoretical Computer Science
2022 年
4 月
Theoretical Computer Science
期刊論文
2
Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality
Li-Hsuan Chen;Sun-Yuan Hsieh;Ling-Ju Hung;Ralf Klasing
Algorithmica
2022 年
2 月
Algorithmica
期刊論文
3
A Novel Branch-and-Bound Algorithm for the Protein Folding Problem in the 3D HP Model
Hsin-Hung Chou;Ching-Tien Hsu;Li-Hsuan Chen;Yue-Cheng Lin;Sun-Yuan Hsieh
IEEE/ACM Transactions on Computational Biology and Bioinformatics
2021 年
3 月
IEEE/ACM Transactions on Computational Biology and Bioinformatics
期刊論文
4
Online Node-and Edge-Deletion Problems with Advice
Li-Hsuan Chen; Ling-Ju Hung; Henri Lotze;Peter Rossmanith
Algorithmica
2021 年
9 月
Algorithmica
期刊論文
5
Approximation algorithms for the p-hub center routing problem in parameterized metric graphs
Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing
Theoretical Computer Science
2020 年
2 月
Theoretical Computer Science
期刊論文
共 5 筆資料，第 1/1 頁，每頁顯示
筆，到第 頁