default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLing-Ju Hung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Ruo-Wei Hung, Ling-Ju Hung:
Paired restraint domination in extended supergrid graphs. J. Supercomput. 80(9): 13217-13249 (2024)- [c21]Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing:
Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests. AAIM (2) 2024: 99-110 - 2023
- [j18]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: 104731 (2023) - [c20]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: 97-111 - [e3]Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee:
Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings. Lecture Notes in Computer Science 13889, Springer 2023, ISBN 978-3-031-34346-9 [contents] - 2022
- [j17]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): 1993-2027 (2022) - [j16]Hao-Ping Yeh, Wei Lu, Li-Hsuan Chen, Ling-Ju Hung, Ralf Klasing, Sun-Yuan Hsieh:
Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs. Theor. Comput. Sci. 922: 13-24 (2022) - [c19]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: 201-211 - [e2]Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Sheng-Lung Peng:
New Trends in Computer Technologies and Applications - 25th International Computer Symposium, ICS 2022, Taoyuan, Taiwan, December 15-17, 2022, Proceedings. Communications in Computer and Information Science 1723, Springer 2022, ISBN 978-981-19-9581-1 [contents] - 2021
- [j15]Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith:
Online Node- and Edge-Deletion Problems with Advice. Algorithmica 83(9): 2719-2753 (2021) - [c18]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: 252-264 - [e1]Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee:
Computing and Combinatorics - 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings. Lecture Notes in Computer Science 13025, Springer 2021, ISBN 978-3-030-89542-6 [contents] - 2020
- [j14]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): 193-206 (2020) - [j13]Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing:
Approximation algorithms for the p-hub center routing problem in parameterized metric graphs. Theor. Comput. Sci. 806: 271-280 (2020) - [c17]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: 126-130 - [c16]Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith:
Further Results on Online Node- and Edge-Deletion Problems with Advice. IWOCA 2020: 140-153
2010 – 2019
- 2018
- [j12]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: 114-125 (2018) - [j11]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: 92-112 (2018) - [c15]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: 115-127 - 2017
- [c14]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: 152-163 - [c13]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: 112-123 - [c12]Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Peter Rossmanith:
An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. ISAAC 2017: 20:1-20:13 - 2016
- [j10]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Ping-Chen Su:
Fixed-parameter algorithms for vertex cover P3. Discret. Optim. 19: 12-22 (2016) - [j9]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
An O∗(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs. J. Comb. Optim. 32(2): 594-607 (2016) - [c11]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: 222-234 - 2015
- [j8]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
Moderately exponential time algorithms for the maximum induced matching problem. Optim. Lett. 9(5): 981-998 (2015) - 2014
- [j7]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): 510-513 (2014) - [c10]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
An efficient exact algorithm for P2-packing in cubic graphs. ICS 2014: 11-21 - 2013
- [j6]Maw-Shang Chang, Ling-Ju Hung, Chih-Ren Lin, Ping-Chen Su:
Finding large k-clubs in undirected graphs. Computing 95(9): 739-758 (2013) - [j5]Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith:
Recognition of probe distance-hereditary graphs. Discret. Appl. Math. 161(3): 336-348 (2013) - 2012
- [i2]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
On the threshold-width of graphs. CoRR abs/1210.8365 (2012) - 2011
- [j4]Ling-Ju Hung, Ton Kloks:
k-Cographs are Kruskalian. Chic. J. Theor. Comput. Sci. 2011 (2011) - [j3]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
On the threshold-width of graphs. J. Graph Algorithms Appl. 15(2): 253-268 (2011) - [j2]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
Block-graph width. Theor. Comput. Sci. 412(23): 2496-2502 (2011) - [c9]Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil:
Black-and-White Threshold Graphs. CATS 2011: 121-130 - [i1]Ling-Ju Hung, Ton Kloks, Fernando Sánchez Villaamil:
Black-and-white threshold graphs. CoRR abs/1104.3917 (2011) - 2010
- [c8]Ling-Ju Hung, Ton Kloks:
Kruskalian Graphs. CATS 2010: 49-54 - [c7]Maw-Shang Chang, Ling-Ju Hung, Peter Rossmanith:
Probe Distance-Hereditary Graphs. CATS 2010: 55-64 - [c6]Ling-Ju Hung, Ton Kloks:
Classifying Rankwidth k-DH-Graphs. CSR 2010: 195-203 - [c5]Maw-Shang Chang, Ling-Ju Hung:
Recognition of Probe Ptolemaic Graphs - (Extended Abstract). IWOCA 2010: 286-290 - [c4]Ling-Ju Hung, Ton Kloks:
On Some Simple Widths. WALCOM 2010: 204-215
2000 – 2009
- 2009
- [c3]Ling-Ju Hung, Ton Kloks, Chuan-Min Lee:
Trivially-Perfect Width. IWOCA 2009: 301-311 - [c2]Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng:
Block-Graph Width. TAMC 2009: 150-157 - 2005
- [j1]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): 211-216 (2005) - 2004
- [c1]Chuan-Min Lee, Ling-Ju Hung, Maw-Shang Chang, Chuan Yi Tang:
An Improved Algorithm for the Maximum Agreement Subtree Problem. BIBE 2004: 533-536
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
