default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLi-Hsuan Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j17]Abdoulie Fatty
, An-Jui Li, Li-Hsuan Chen:
Recurrent Neural Network Based IOS Mobile Applications for Slope Safety Assessment. IEEE Consumer Electron. Mag. 13(4): 73-80 (2024)- 2022
- [j16]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) - [j15]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) - 2021
- [j14]Li-Hsuan Chen, Ling-Ju Hung, Henri Lotze, Peter Rossmanith:
Online Node- and Edge-Deletion Problems with Advice. Algorithmica 83(9): 2719-2753 (2021) - [j13]Hsin-Hung Chou, Ching-Tien Hsu, Li-Hsuan Chen, Yue-Cheng Lin, Sun-Yuan Hsieh:
A Novel Branch-and-Bound Algorithm for the Protein Folding Problem in the 3D HP Model. IEEE ACM Trans. Comput. Biol. Bioinform. 18(2): 455-462 (2021) - 2020
- [j12]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) - 2018
- [j11]Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil:
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. Algorithms 11(7): 98 (2018) - [j10]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) - [j9]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) - 2017
- [j8]Bang Ye Wu, Li-Hsuan Chen:
An improved parameterized algorithm for the p-cluster vertex deletion problem. J. Comb. Optim. 33(2): 373-388 (2017) - [j7]Li-Hsuan Chen, Bang Ye Wu:
Parameterized algorithms for min-max 2-cluster editing. J. Comb. Optim. 34(1): 47-63 (2017) - 2016
- [j6]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) - [j5]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) - 2015
- [j4]Bang Ye Wu, Li-Hsuan Chen:
Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions. Algorithmica 72(3): 818-835 (2015) - [j3]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
- [j2]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) - 2013
- [j1]Li-Hsuan Chen, Maw-Shang Chang, Chun-Chieh Wang, Bang Ye Wu:
On the Min-Max 2-Cluster Editing Problem. J. Inf. Sci. Eng. 29(6): 1109-1120 (2013)
Conference and Workshop Papers
- 2024
- [c13]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 - 2020
- [c12]Yung-Pin Cheng, Wei-Nien Hsiung, Yu-Shan Wu, Li-Hsuan Chen:
GeekyNote: a technical documentation tool with coverage, backtracking, traces, and couplings. ICSE (Companion Volume) 2020: 73-76 - [c11]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 - [c10]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 - 2019
- [c9]Cheng-Chen Chen, Li-Hsuan Chen, Meng-Han Guo:
Integration of building interface and smart sensor network to control indoor air pollution through internet of things. IEEA 2019: 15-20 - 2018
- [c8]Eivind Flobak, Daniel A. Jensen, Astri J. Lundervold, Tine Nordgreen, Li-Hsuan Chen, Frode Guribye:
Towards Technology-Based Interventions for Improving Emotional and Cognitive Control. CHI Extended Abstracts 2018 - [c7]Sun-Yuan Hsieh, Li-Hsuan Chen, Wei Lu:
An Approximation Algorithm for Star p-Hub Routing Cost Problem. ICS 2018: 524-531 - [c6]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
- [c5]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 - [c4]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 - [c3]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
- [c2]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 - 2014
- [c1]Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung:
An efficient exact algorithm for P2-packing in cubic graphs. ICS 2014: 11-21
Informal and Other Publications
- 2016
- [i2]Li-Hsuan Chen, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil:
Width, depth and space. CoRR abs/1607.00945 (2016) - 2013
- [i1]Bang Ye Wu, Li-Hsuan Chen:
Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions. CoRR abs/1303.6867 (2013)
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 2024-10-07 22:09 CEST 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:
