Ling-Ju Hung

According to our database, Ling-Ju Hung authored at least 39 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Paired restraint domination in extended supergrid graphs.

Ruo-Wei Hung, Ling-Ju Hung

J. Supercomput., June, 2024

Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests.

Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing

Proceedings of the Algorithmic Aspects in Information and Management, 2024

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., November, 2023

Hardness and Approximation for the Star β-Hub Routing Cost Problem in $\varDelta _\beta $-Metric Graphs.

Meng-Shiou Tsai, Sun-Yuan Hsieh, Ling-Ju Hung

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Hardness and approximation for the star <i>p</i>-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

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

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

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021

Online Node- and Edge-Deletion Problems with Advice.

Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith

Algorithmica, 2021

A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks.

Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Sun-Yuan Hsieh

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020

Approximation algorithms for the <i>p</i>-hub center routing problem in parameterized metric graphs.

Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing

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

Further Results on Online Node- and Edge-Deletion Problems with Advice.

Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

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

Proceedings of the International Computer Symposium, 2020

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

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

Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs.

Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017

An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem.

Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality.

Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

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

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

An O^∗(1.4366ⁿ)-time exact algorithm for maximum P₂-packing in cubic graphs.

Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung

J. Comb. Optim., 2016

Fixed-parameter algorithms for vertex cover P₃.

Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Ping-Chen Su

Discret. Optim., 2016

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

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Moderately exponential time algorithms for the maximum induced matching problem.

Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung

Optim. Lett., 2015

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

An efficient exact algorithm for P2-packing in cubic graphs.

Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung

Proceedings of the Intelligent Systems and Applications, 2014

2013

Recognition of probe distance-hereditary graphs.

Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith

Discret. Appl. Math., 2013

Finding large k-clubs in undirected graphs.

Maw-Shang Chang, Ling-Ju Hung, Chih-Ren Lin, Ping-Chen Su

Computing, 2013

2011

Block-graph width.

Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng

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

k-Cographs are Kruskalian.

Ling-Ju Hung, Ton Kloks

Chic. J. Theor. Comput. Sci., 2011

Black-and-White Threshold Graphs.

Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

On Some Simple Widths.

Ling-Ju Hung, Ton Kloks

Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Recognition of Probe Ptolemaic Graphs - (Extended Abstract).

Maw-Shang Chang, Ling-Ju Hung

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Classifying Rankwidth k-DH-Graphs.

Ling-Ju Hung, Ton Kloks

Proceedings of the Computer Science, 2010

Kruskalian Graphs.

Ling-Ju Hung, Ton Kloks

Proceedings of the Theory of Computing 2010, 2010

Probe Distance-Hereditary Graphs.

Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith

Proceedings of the Theory of Computing 2010, 2010

2009

Trivially-Perfect Width.

Ling-Ju Hung, Ton Kloks, Chuan-Min Lee

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2005

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

2004

An Improved Algorithm for the Maximum Agreement Subtree Problem.

Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang

Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004