Ling-Ju Hung
Orcid: 0000-0001-5659-5507
According to our database1,
Ling-Ju Hung
authored at least 37 papers
between 2004 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks.
J. Parallel Distributed Comput., November, 2023
Hardness and Approximation for the Star β-Hub Routing Cost Problem in $\varDelta _\beta $-Metric Graphs.
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.
Theor. Comput. Sci., 2022
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality.
Algorithmica, 2022
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022
2021
A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks.
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.
Theor. Comput. Sci., 2020
Heterogeneous Job Allocation Scheduler for Hadoop MapReduce Using Dynamic Grouping Integrated Neighboring Search.
IEEE Trans. Cloud Comput., 2020
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs.
Proceedings of the International Computer Symposium, 2020
2018
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality.
J. Comput. Syst. Sci., 2018
Discret. Appl. Math., 2018
Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018
2017
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017
2016
An O<sup>∗</sup>(1.4366<sup>n</sup>)-time exact algorithm for maximum P<sub>2</sub>-packing in cubic graphs.
J. Comb. Optim., 2016
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016
2015
Optim. Lett., 2015
2014
Inf. Process. Lett., 2014
Proceedings of the Intelligent Systems and Applications, 2014
2013
2011
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011
2010
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
2009
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
2005
Inf. Process. Lett., 2005
2004
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004