Ling-Ju Hung

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 21

Top Topics

Routing Problem

Approximation Algorithms

Maximum Common Subgraph

Top Venues

Theor. Comput. Sci.

Publications

Ruo-Wei Hung, Ling-Ju Hung
Paired restraint domination in extended supergrid graphs. J. Supercomput. 80 (9) (2024)
Meng-Shiou Tsai, Sun-Yuan Hsieh, Ling-Ju Hung
Hardness and Approximation for the Star β-Hub Routing Cost Problem in $\varDelta _\beta $-Metric Graphs. COCOON (1) (2023)
Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Chia-Wei Lee, Sun-Yuan Hsieh
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks. J. Parallel Distributed Comput. 181 (2023)
Hao-Ping Yeh, Wei Lu, Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing, Sun-Yuan Hsieh
-Hub Routing Cost Problem in metric graphs. Theor. Comput. Sci. 922 (2022)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality. Algorithmica 84 (7) (2022)
Ro-Yu Wu, Cheng-Chia Tseng, Ling-Ju Hung, Jou-Ming Chang
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms. ISCO (2022)
Shih-Shun Kao, Ralf Klasing, Ling-Ju Hung, Sun-Yuan Hsieh
A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks. AAIM (2021)
Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith
Online Node- and Edge-Deletion Problems with Advice. Algorithmica 83 (9) (2021)
Chi-Ting Chen, Ling-Ju Hung, Sun-Yuan Hsieh, Rajkumar Buyya, Albert Y. Zomaya
Heterogeneous Job Allocation Scheduler for Hadoop MapReduce Using Dynamic Grouping Integrated Neighboring Search. IEEE Trans. Cloud Comput. 8 (1) (2020)
Shih-Chia Chang, Li-Hsuan Chen, Ling-Ju Hung, Shih-Shun Kao, Ralf Klasing
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs. ICS (2020)
Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith
Further Results on Online Node- and Edge-Deletion Problems with Advice. IWOCA (2020)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
-hub center routing problem in parameterized metric graphs. Theor. Comput. Sci. 806 (2020)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Yi-Zhi Liu, Peter Rossmanith, Somnath Sikdar
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem. Discret. Appl. Math. 251 (2018)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs. IWOCA (2018)
Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. J. Comput. Syst. Sci. 92 (2018)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. ISAAC (2017)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality. COCOON (2017)
Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. CIAC (2017)
Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, Bang Ye Wu
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs. COCOON (2016)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
-packing in cubic graphs. J. Comb. Optim. 32 (2) (2016)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Ping-Chen Su
. Discret. Optim. 19 (2016)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
Moderately exponential time algorithms for the maximum induced matching problem. Optim. Lett. 9 (5) (2015)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu
Exact algorithms for problems related to the densest k-set problem. Inf. Process. Lett. 114 (9) (2014)
Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
An efficient exact algorithm for P2-packing in cubic graphs. ICS (2014)
Maw-Shang Chang, Ling-Ju Hung, Chih-Ren Lin, Ping-Chen Su
Finding large k-clubs in undirected graphs. Computing 95 (9) (2013)
Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
Recognition of probe distance-hereditary graphs. Discret. Appl. Math. 161 (3) (2013)
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
On the threshold-width of graphs CoRR (2012)
Ling-Ju Hung, Ton Kloks
k-Cographs are Kruskalian. Chic. J. Theor. Comput. Sci. 2011 (2011)
Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil
Black-and-white threshold graphs. CoRR (2011)
Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil
Black-and-White Threshold Graphs. CATS (2011)
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
On the threshold-width of graphs. J. Graph Algorithms Appl. 15 (2) (2011)
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
Block-graph width. Theor. Comput. Sci. 412 (23) (2011)
Ling-Ju Hung, Ton Kloks
On Some Simple Widths. WALCOM (2010)
Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith
Probe Distance-Hereditary Graphs. CATS (2010)
Ling-Ju Hung, Ton Kloks
Classifying Rankwidth k-DH-Graphs. CSR (2010)
Maw-Shang Chang, Ling-Ju Hung
Recognition of Probe Ptolemaic Graphs - (Extended Abstract). IWOCA (2010)
Ling-Ju Hung, Ton Kloks
Kruskalian Graphs. CATS (2010)
Ling-Ju Hung, Ton Kloks, Chuan-Min Lee
Trivially-Perfect Width. IWOCA (2009)
Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng
Block-Graph Width. TAMC (2009)
Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chia-Ben Shen, Chuan Yi Tang
An improved algorithm for the maximum agreement subtree problem. Inf. Process. Lett. 94 (5) (2005)
Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang
An Improved Algorithm for the Maximum Agreement Subtree Problem. BIBE (2004)