default search action
Yen Hung Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j9]Yen Hung Chen:
Approximability results for the $p$-centdian and the converse centdian problems. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j8]Yen Hung Chen
:
The Clustered Selected-Internal Steiner Tree Problem. Int. J. Found. Comput. Sci. 33(1): 55-66 (2022) - 2020
- [i2]Yen Hung Chen:
Approximability results for the p-centdian and the converse centdian problems. CoRR abs/2011.00130 (2020) - [i1]Yen Hung Chen:
Approximating the clustered selected-internal Steiner tree problem. CoRR abs/2011.00131 (2020)
2010 – 2019
- 2018
- [c10]Chih-Yang Huang
A Measure and Conquer Algorithm for the Minimum User Spatial-Aware Interest Group Query Problem. ICS 2018: 440-448 - 2016
- [j7]Yen Hung Chen:
Approximability results for the converse connected p-centre problem. Int. J. Comput. Math. 93(11): 1860-1868 (2016) - [j6]Yen Hung Chen:
The bottleneck selected-internal and partial terminal Steiner tree problems. Networks 68(4): 331-339 (2016) - 2014
- [c9]Yen Hung Chen:
The Dominated Coloring Problem and Its Application. ICCSA (6) 2014: 132-145 - 2012
- [j5]Yen Hung Chen:
Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem. J. Appl. Math. 2012: 394721:1-394721:8 (2012) - [j4]Yen Hung Chen:
The k Partition-Distance Problem. J. Comput. Biol. 19(4): 404-417 (2012) - [c8]Yen Hung Chen:
Approximation Hardness of the Mixed Dominating Set Problem. CTW 2012: 71-75 - 2011
- [c7]Yen Hung Chen:
An Improved Approximation Algorithm for the Terminal Steiner Tree Problem. ICCSA (3) 2011: 141-151 - 2010
- [j3]Yen Hung Chen, Chuan Yi Tang:
On the bottleneck tree alignment problems. Inf. Sci. 180(11): 2134-2141 (2010)
2000 – 2009
- 2009
- [j2]Gwo-Liang Liao
Optimal economic production quantity policy for imperfect process with imperfect repair and maintenance. Eur. J. Oper. Res. 195(2): 348-357 (2009) - [c6]Yen Hung Chen:
A Fast Approximation Algorithm for the k Partition-Distance Problem. ICCSA (2) 2009: 537-546 - 2007
- [c5]Yen Hung Chen, Gwo-Liang Liao, Chuan Yi Tang:
Approximation Algorithms for 2-Source Minimum Routing Cost k -Tree Problems. ICCSA (3) 2007: 520-533 - 2006
- [j1]Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang:
Approximation algorithms for some k-source shortest paths spanning tree problems. Networks 47(3): 147-156 (2006) - [c4]Yen Hung Chen, Chuan Yi Tang:
The Bottleneck Tree Alignment Problems. ICCSA (3) 2006: 631-637 - 2005
- [c3]Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang:
Disjoint Segments with Maximum Density. International Conference on Computational Science (2) 2005: 845-850 - 2004
- [c2]Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang:
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. ICCSA (3) 2004: 355-366 - 2003
- [c1]Yen Hung Chen, Chin Lung Lu, Chuan Yi Tang:
On the Full and Bottleneck Full Steiner Tree Problems. COCOON 2003: 122-129
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-04-25 05:53 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: