On the Min-Max 2-Cluster Editing Problem. - Li-Hsuan Chen; Maw-Shang Chang; Chun-Chieh Wang; Bang Ye Wu (J. Inf. Sci. Eng., 2013)

An efficient exact algorithm for P2-packing in cubic graphs. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung (ICS, 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)

Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions. - Bang Ye Wu; Li-Hsuan Chen (Algorithmica, 2015)

Moderately exponential time algorithms for the maximum induced matching problem. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung (Optim. Lett., 2015)

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 (COCOON, 2016)

Width, depth and space. - Li-Hsuan Chen; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil (CoRR, 2016)

Fixed-parameter algorithms for vertex cover P3. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung; Peter Rossmanith; Ping-Chen Su (Discret. Optim., 2016)

An O∗(1.4366n)-time exact algorithm for maximum P2-packing in cubic graphs. - Maw-Shang Chang; Li-Hsuan Chen; Ling-Ju Hung (J. Comb. Optim., 2016)

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 (CIAC, 2017)

The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing (COCOON, 2017)

An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Peter Rossmanith (ISAAC, 2017)

Parameterized algorithms for min-max 2-cluster editing. - Li-Hsuan Chen; Bang Ye Wu (J. Comb. Optim., 2017)

An improved parameterized algorithm for the p-cluster vertex deletion problem. - Bang Ye Wu; Li-Hsuan Chen (J. Comb. Optim., 2017)

Towards Technology-Based Interventions for Improving Emotional and Cognitive Control. - Eivind Flobak; Daniel A. Jensen; Astri J. Lundervold; Tine Nordgreen; Li-Hsuan Chen; Frode Guribye (CHI Extended Abstracts, 2018)

An Approximation Algorithm for Star p-Hub Routing Cost Problem. - Sun-Yuan Hsieh; Li-Hsuan Chen; Wei Lu (ICS, 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 (IWOCA, 2018)

Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming. - Li-Hsuan Chen; Felix Reidl; Peter Rossmanith; Fernando Sánchez Villaamil (Algorithms, 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)

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)

Integration of building interface and smart sensor network to control indoor air pollution through internet of things. - Cheng-Chen Chen; Li-Hsuan Chen; Meng-Han Guo (IEEA, 2019)

GeekyNote: a technical documentation tool with coverage, backtracking, traces, and couplings. - Yung-Pin Cheng; Wei-Nien Hsiung; Yu-Shan Wu; Li-Hsuan Chen (ICSE (Companion Volume), 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 (ICS, 2020)

Further Results on Online Node- and Edge-Deletion Problems with Advice. - Li-Hsuan Chen; Ling-Ju Hung; Henri Lotze; Peter Rossmanith (IWOCA, 2020)

Approximation algorithms for the p-hub center routing problem in parameterized metric graphs. - Li-Hsuan Chen; Sun-Yuan Hsieh; Ling-Ju Hung; Ralf Klasing (Theor. Comput. Sci., 2020)

Online Node- and Edge-Deletion Problems with Advice. - Li-Hsuan Chen; Ling-Ju Hung; Henri Lotze; Peter Rossmanith (Algorithmica, 2021)

A Novel Branch-and-Bound Algorithm for the Protein Folding Problem in the 3D HP Model. - Hsin-Hung Chou; Ching-Tien Hsu; Li-Hsuan Chen; Yue-Cheng Lin; Sun-Yuan Hsieh (IEEE ACM Trans. Comput. Biol. Bioinform., 2021)

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)

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

Improved Approximation Algorithms for Patrol-Scheduling with Min-Max Latency Using Multiclass Minimum Spanning Forests. - Li-Hsuan Chen; Ling-Ju Hung; Ralf Klasing (AAIM (2), 2024)

Recurrent Neural Network Based IOS Mobile Applications for Slope Safety Assessment. - Abdoulie Fatty; An-Jui Li; Li-Hsuan Chen (IEEE Consumer Electron. Mag., 2024)