Li-Hsuan Chen

Orcid: 0000-0003-1426-2629

According to our database1, Li-Hsuan Chen authored at least 29 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2021
A Novel Branch-and-Bound Algorithm for the Protein Folding Problem in the 3D HP Model.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Online Node- and Edge-Deletion Problems with Advice.
Algorithmica, 2021

2020
Approximation algorithms for the <i>p</i>-hub center routing problem in parameterized metric graphs.
Theor. Comput. Sci., 2020

Further Results on Online Node- and Edge-Deletion Problems with Advice.
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

GeekyNote: a technical documentation tool with coverage, backtracking, traces, and couplings.
Proceedings of the ICSE '20: 42nd International Conference on Software Engineering, Companion Volume, Seoul, South Korea, 27 June, 2020

2019
Integration of building interface and smart sensor network to control indoor air pollution through internet of things.
Proceedings of the 8th International Conference on Informatics, 2019

2018
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality.
J. Comput. Syst. Sci., 2018

Moderately exponential time algorithms for the maximum bounded-degree-1 set problem.
Discret. Appl. Math., 2018

Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming.
Algorithms, 2018

Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

An Approximation Algorithm for Star p-Hub Routing Cost Problem.
Proceedings of the New Trends in Computer Technologies and Applications, 2018

Towards Technology-Based Interventions for Improving Emotional and Cognitive Control.
Proceedings of the Extended Abstracts of the 2018 CHI Conference on Human Factors in Computing Systems, 2018

2017
An improved parameterized algorithm for the p-cluster vertex deletion problem.
J. Comb. Optim., 2017

Parameterized algorithms for min-max 2-cluster editing.
J. Comb. Optim., 2017

An Efficient Fixed-Parameter Algorithm for the 2-Plex Bipartition Problem.
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

Fixed-parameter algorithms for vertex cover P<sub>3</sub>.
Discret. Optim., 2016

Width, depth and space.
CoRR, 2016

Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
Moderately exponential time algorithms for the maximum induced matching problem.
Optim. Lett., 2015

Parameterized Algorithms for the 2-Clustering Problem with Minimum Sum and Minimum Sum of Squares Objective Functions.
Algorithmica, 2015

2014
Exact algorithms for problems related to the densest k-set problem.
Inf. Process. Lett., 2014

An efficient exact algorithm for P2-packing in cubic graphs.
Proceedings of the Intelligent Systems and Applications, 2014

2013
On the Min-Max 2-Cluster Editing Problem.
J. Inf. Sci. Eng., 2013


  Loading...