An Improved Algorithm for the Maximum Agreement Subtree Problem. - Chuan-Min Lee; Ling-Ju Hung; Maw-Shang Chang; Chuan Yi Tang (BIBE, 2004)

An improved algorithm for the maximum agreement subtree problem. - Chuan-Min Lee; Ling-Ju Hung; Maw-Shang Chang; Chia-Ben Shen; Chuan Yi Tang (Inf. Process. Lett., 2005)

Trivially-Perfect Width. - Ling-Ju Hung; Ton Kloks; Chuan-Min Lee (IWOCA, 2009)

Probe Distance-Hereditary Graphs. - Maw-Shang Chang; Ling-Ju Hung; Peter Rossmanith (CATS, 2010)

Kruskalian Graphs. - Ling-Ju Hung; Ton Kloks (CATS, 2010)

Classifying Rankwidth k-DH-Graphs. - Ling-Ju Hung; Ton Kloks (CSR, 2010)

Recognition of Probe Ptolemaic Graphs - (Extended Abstract). - Maw-Shang Chang; Ling-Ju Hung (IWOCA, 2010)

On Some Simple Widths. - Ling-Ju Hung; Ton Kloks (WALCOM, 2010)

Black-and-White Threshold Graphs. - Ling-Ju Hung; Ton Kloks; Fernando Sánchez Villaamil (CATS, 2011)

k-Cographs are Kruskalian. - Ling-Ju Hung; Ton Kloks (Chic. J. Theor. Comput. Sci., 2011)

On the threshold-width of graphs. - Maw-Shang Chang; Ling-Ju Hung; Ton Kloks; Sheng-Lung Peng (J. Graph Algorithms Appl., 2011)

Block-graph width. - Maw-Shang Chang; Ling-Ju Hung; Ton Kloks; Sheng-Lung Peng (Theor. Comput. Sci., 2011)

Finding large k-clubs in undirected graphs. - Maw-Shang Chang; Ling-Ju Hung; Chih-Ren Lin; Ping-Chen Su (Computing, 2013)

Recognition of probe distance-hereditary graphs. - Maw-Shang Chang; Ling-Ju Hung; Peter Rossmanith (Discret. Appl. Math., 2013)

An efficient exact algorithm for P2-packing in cubic graphs. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung (ICS, 2014)

Exact algorithms for problems related to the densest k-set problem. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung; Peter Rossmanith; Guan-Han Wu (Inf. Process. Lett., 2014)

Moderately exponential time algorithms for the maximum induced matching problem. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung (Optim. Lett., 2015)

Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs. - Li-Hsuan Chen; Dun-Wei Cheng; Sun-Yuan Hsieh; Ling-Ju Hung; Chia-Wei Lee; Bang Ye Wu (COCOON, 2016)

Fixed-parameter algorithms for vertex cover P3. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung; Peter Rossmanith; Ping-Chen Su (Discret. Optim., 2016)

An O∗(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung (J. Comb. Optim., 2016)

On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing; Chia-Wei Lee; Bang Ye Wu (CIAC, 2017)

The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing (COCOON, 2017)

An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Peter Rossmanith (ISAAC, 2017)

Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing (IWOCA, 2018)

Moderately exponential time algorithms for the maximum bounded-degree-1 set problem. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung; Yi-Zhi Liu; Peter Rossmanith; Somnath Sikdar (Discret. Appl. Math., 2018)

Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. - Li-Hsuan Chen; Dun-Wei Cheng; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing; Chia-Wei Lee; Bang Ye Wu (J. Comput. Syst. Sci., 2018)

The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs. - Shih-Chia Chang; Li-Hsuan Chen; Ling-Ju Hung; Shih-Shun Kao; Ralf Klasing (ICS, 2020)

Further Results on Online Node- and Edge-Deletion Problems with Advice. - Li-Hsuan Chen; Ling-Ju Hung; Henri Lotze; Peter Rossmanith (IWOCA, 2020)

Heterogeneous Job Allocation Scheduler for Hadoop MapReduce Using Dynamic Grouping Integrated Neighboring Search. - Chi-Ting Chen; Ling-Ju Hung; Sun-Yuan Hsieh; Rajkumar Buyya; Albert Y. Zomaya (IEEE Trans. Cloud Comput., 2020)

Approximation algorithms for the p-hub center routing problem in parameterized metric graphs. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing (Theor. Comput. Sci., 2020)

A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks. - Shih-Shun Kao; Ralf Klasing; Ling-Ju Hung; Sun-Yuan Hsieh (AAIM, 2021)

Online Node- and Edge-Deletion Problems with Advice. - Li-Hsuan Chen; Ling-Ju Hung; Henri Lotze; Peter Rossmanith (Algorithmica, 2021)

Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms. - Ro-Yu Wu; Cheng-Chia Tseng; Ling-Ju Hung; Jou-Ming Chang (ISCO, 2022)

On the 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)

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 (Theor. Comput. Sci., 2022)

Hardness and Approximation for the Star β-Hub Routing Cost Problem in $ varDelta _ beta $-Metric Graphs. - Meng-Shiou Tsai; Sun-Yuan Hsieh; Ling-Ju Hung (COCOON (1), 2023)

A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks. - Shih-Shun Kao; Ralf Klasing; Ling-Ju Hung; Chia-Wei Lee; Sun-Yuan Hsieh (J. Parallel Distributed Comput., 2023)

Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests. - Li-Hsuan Chen; Ling-Ju Hung; Ralf Klasing (AAIM (2), 2024)

Paired restraint domination in extended supergrid graphs. - Ruo-Wei Hung; Ling-Ju Hung (J. Supercomput., 2024)