| Fixed-parameter algorithms for vertex cover P3 MS Chang, LH Chen, LJ Hung, P Rossmanith, PC Su Discrete Optimization 19, 12-22, 2016 | 38 | 2016 |
| Exact algorithms for problems related to the densest k-set problem MS Chang, LH Chen, LJ Hung, P Rossmanith, GH Wu Information Processing Letters 114 (9), 510-513, 2014 | 27 | 2014 |
| An-time exact algorithm for the maximum bounded-degree-1 set problem MS Chang, LH Chen, LJ Hung, YZ Liu, P Rossmanith, S Sikdar Proceedings of the 31st Workshop on Combinatorial Mathematics and …, 2014 | 23 | 2014 |
| Approximation algorithms for single allocation k-hub center problem LH Chen, DW Cheng, SY Hsieh, LJ Hung, CW Lee, BY Wu Proceedings of the 33rd Workshop on Combinatorial Mathematics and …, 2016 | 15 | 2016 |
| Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs LH Chen, DW Cheng, SY Hsieh, LJ Hung, CW Lee, BY Wu International Computing and Combinatorics Conference, 222-234, 2016 | 14 | 2016 |
| Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming LH Chen, F Reidl, P Rossmanith, F Sánchez Villaamil Algorithms 11 (7), 98, 2018 | 12 | 2018 |
| Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality LH Chen, DW Cheng, SY Hsieh, LJ Hung, R Klasing, CW Lee, BY Wu Journal of Computer and System Sciences 92, 92-112, 2018 | 11 | 2018 |
| Online Node-and Edge-Deletion Problems with Advice LH Chen, LJ Hung, H Lotze, P Rossmanith Algorithmica 83 (9), 2719-2753, 2021 | 9 | 2021 |
| Approximation algorithms for the p-hub center routing problem in parameterized metric graphs LH Chen, SY Hsieh, LJ Hung, R Klasing Theoretical Computer Science 806, 271-280, 2020 | 9 | 2020 |
| The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality LH Chen, SY Hsieh, LJ Hung, R Klasing International Computing and Combinatorics Conference, 112-123, 2017 | 8 | 2017 |
| On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality LH Chen, SY Hsieh, LJ Hung, R Klasing, CW Lee, BY Wu International Conference on Algorithms and Complexity, 152-163, 2017 | 8 | 2017 |
| Moderately exponential time algorithms for the maximum induced matching problem MS Chang, LH Chen, LJ Hung Optimization Letters 9, 981-998, 2015 | 8 | 2015 |
| Moderately exponential time algorithms for the maximum bounded-degree-1 set problem MS Chang, LH Chen, LJ Hung, YZ Liu, P Rossmanith, S Sikdar Discrete Applied Mathematics 251, 114-125, 2018 | 7 | 2018 |
| On the min-max 2-cluster editing problem LH Chen, MS Chang, CC Wang, BY Wu Advances in Intelligent Systems and Applications-Volume 1: Proceedings of …, 2013 | 6 | 2013 |
| Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions BY Wu, LH Chen Algorithmica 72, 818-835, 2015 | 5 | 2015 |
| A 5k kernel for P2-packing in net-free graphs MS Chang, LH Chen, LJ Hung 2014 International Computer Science and Engineering Conference (ICSEC), 12-17, 2014 | 5 | 2014 |
| On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality LH Chen, SY Hsieh, LJ Hung, R Klasing Algorithmica 84 (7), 1993-2027, 2022 | 4 | 2022 |
| The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs SC Chang, LH Chen, LJ Hung, SS Kao, R Klasing 2020 International Computer Symposium (ICS), 126-130, 2020 | 4 | 2020 |
| Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs HP Yeh, W Lu, LH Chen, LJ Hung, R Klasing, SY Hsieh Theoretical Computer Science 922, 13-24, 2022 | 2 | 2022 |
| Further results on online node-and edge-deletion problems with advice LH Chen, LJ Hung, H Lotze, P Rossmanith Combinatorial Algorithms: 31st International Workshop, IWOCA 2020, Bordeaux …, 2020 | 2 | 2020 |
Ling-Ju HungNational Taipei University of Business在 ntub.edu.tw 的电子邮件经过验证
