| Finding large -clubs in undirected graphs MS Chang, LJ Hung, CR Lin, PC Su Computing 95 (9), 739-758, 2013 | 57 | 2013 |
| Fixed-parameter algorithms for vertex cover P3 MS Chang, LH Chen, LJ Hung, P Rossmanith, PC Su Discrete Optimization 19, 12-22, 2016 | 35 | 2016 |
| An improved algorithm for the maximum agreement subtree problem CM Lee, LJ Hung, MS Chang, CB Shen, CY Tang Information Processing Letters 94 (5), 211-216, 2005 | 30 | 2005 |
| Heterogeneous job allocation scheduler for hadoop mapreduce using dynamic grouping integrated neighboring search CT Chen, LJ Hung, SY Hsieh, R Buyya, AY Zomaya IEEE Transactions on Cloud Computing 8 (1), 193-206, 2020 | 29 | 2020 |
| 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 O*(1.4658 n)-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 | 22 | 2014 |
| Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs LH Chen, DW Cheng, SY Hsieh, LJ Hung, CW Lee, BY Wu Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho …, 2016 | 14 | 2016 |
| 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 | 14 | 2016 |
| 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 | 10 | 2018 |
| 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 Computing and Combinatorics: 23rd International Conference, COCOON 2017 …, 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 |
| On some simple widths LJ Hung, T Kloks WALCOM: Algorithms and Computation: 4th International Workshop, WALCOM 2010 …, 2010 | 8 | 2010 |
| 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 Algorithms and Complexity: 10th International Conference, CIAC 2017, Athens …, 2017 | 7 | 2017 |
| 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 | 6 | 2018 |
| Recognition of probe distance-hereditary graphs MS Chang, LJ Hung, P Rossmanith Discrete Applied Mathematics 161 (3), 336-348, 2013 | 6 | 2013 |
| An O ∗ (1.4786 n )-Time Algorithm for the Maximum Induced Matching Problem MS Chang, LJ Hung, CA Miau Advances in Intelligent Systems and Applications-Volume 1: Proceedings of …, 2013 | 6 | 2013 |
| Black-and-white threshold graphs LJ Hung, T Kloks, F Villaamil arXiv preprint arXiv:1104.3917, 2011 | 6 | 2011 |
| Online Node-and Edge-Deletion Problems with Advice LH Chen, LJ Hung, H Lotze, P Rossmanith Algorithmica 83 (9), 2719-2753, 2021 | 5 | 2021 |
| 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 |
