default search action
Chia-Wei Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j23]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) - [e4]Sun-Yuan Hsieh
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
- [c14]C. L. Chiu, Ting-Rong Chen, Chia-Wei Lee, Jau-Ji Jou:
The Study of 60 GHz Wideband Conductor-Backed Coplanar Waveguide on a TGV Substrate. GCCE 2022: 816-817 - [c13]Xinxin Zhang
Information spreading in mobile social networks: identifying the influential nodes using FPSO algorithm. ICIT 2022: 41-46 - [e3]Sun-Yuan Hsieh
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
- [j22]Wen-Hsuan Liang, Dun-Wei Cheng, Chih-Wei Hsu, Chia-Wei Lee, Chih-Heng Ke, Albert Y. Zomaya, Sun-Yuan Hsieh:
Dynamic Flow Scheduling Technique for Load Balancing in Fat-Tree Data Center Networks. Int. J. Perform. Eng. 17(6): 491 (2021) - [c12]Chi-Yu Liu, Chia-Wei Lee
Social Distance Detection Using Wireless Signal in Social Networks. SocialSec 2021: 37-41 - [e2]Chi-Yeh Chen
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] - [e1]Limei Lin
Security and Privacy in Social Networks and Big Data - 7th International Symposium, SocialSec 2021, Fuzhou, China, November 19-21, 2021, Proceedings. Communications in Computer and Information Science 1495, Springer 2021, ISBN 978-981-16-7912-4 [contents] - 2020
- [j21]Chia-Wei Lee
R3-connectivity of folded hypercubes. Discret. Appl. Math. 285: 261-273 (2020) - [j20]Chia-Wei Lee:
Conditional diagnosability of component-composition graphs under the PMC model. Theor. Comput. Sci. 836: 16-28 (2020)
2010 – 2019
- 2018
- [j19]Sun-Yuan Hsieh
Classifying Protein Specific Residue Structures Based on Graph Mining. IEEE Access 6: 55828-55837 (2018) - [j18]Li-Hsuan Chen
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. J. Comput. Syst. Sci. 92: 92-112 (2018) - [j17]Limei Lin
The Relationship Between g-Restricted Connectivity and g-Good-Neighbor Fault Diagnosability of General Regular Networks. IEEE Trans. Reliab. 67(1): 285-296 (2018) - 2017
- [c11]Li-Hsuan Chen
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality. CIAC 2017: 152-163 - 2016
- [j16]Sun-Yuan Hsieh, Chia-Wei Lee, Chien-Hsiang Huang:
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks. Inf. Comput. 251: 314-334 (2016) - [j15]Sun-Yuan Hsieh, Hong-Wen Huang, Chia-Wei Lee:
{2, 3}-Restricted connectivity of locally twisted cubes. Theor. Comput. Sci. 615: 78-90 (2016) - [c10]Li-Hsuan Chen
Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs. COCOON 2016: 222-234 - 2015
- [j14]Chia-Wei Lee
Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k-maximum density paths. Discret. Appl. Math. 180: 126-134 (2015) - [j13]Chia-Chen Wei, Sun-Yuan Hsieh, Chia-Wei Lee, Sheng-Lung Peng:
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2. J. Discrete Algorithms 35: 62-71 (2015) - [j12]Chia-Wei Lee
An Improved Approximation Ratio to the Partial-Terminal Steiner Tree Problem. IEEE Trans. Computers 64(1): 274-279 (2015) - [c9]Sun-Yuan Hsieh, I-Pien Tsai, Hao-Che Hung, Yi-Chun Chen, Hsin-Hung Chou, Chia-Wei Lee:
An Enhanced Algorithm for Reconstructing a Phylogenetic Tree Based on the Tree Rearrangement and Maximum Likelihood Method. ICIC (2) 2015: 530-541 - [c8]Sun-Yuan Hsieh, Chia-Wei Lee, Zong-Ying Yang, Heng-Wei Wang, Jun-Han Yu:
A Novel Algorithm for Classifying Protein Structure Familiar by Using the Graph Mining Approach. ICIC (1) 2015: 723-729 - 2014
- [j11]Chia-Wei Lee, Kuang-Yu Hsieh, Sun-Yuan Hsieh, Hung-Chang Hsiao:
A Dynamic Data Placement Strategy for Hadoop in Heterogeneous Environments. Big Data Res. 1: 14-22 (2014) - [j10]Che-Nan Kuo, Chia-Wei Lee
Extended fault-tolerant bipanconnectivity and panconnectivity of folded hypercubes. Int. J. Mob. Commun. 12(4): 397-410 (2014) - [j9]Chia-Wei Lee
Diagnosability of Component-Composition Graphs in the MM* Model. ACM Trans. Design Autom. Electr. Syst. 19(3): 27:1-27:14 (2014) - [j8]Chia-Wei Lee
Hamiltonicity of Product Networks with Faulty Elements. IEEE Trans. Parallel Distributed Syst. 25(9): 2318-2331 (2014) - [c7]Chia-Wei Lee, Horng-Chyau Huang, Sun-Yuan Hsieh:
IDP: An Innovative Data Placement Algorithm for Hadoop Systems. ICS 2014: 49-58 - 2013
- [j7]Chao-Wen Huang, Chia-Wei Lee
The internal Steiner tree problem: Hardness and approximations. J. Complex. 29(1): 27-43 (2013) - [j6]Chia-Wen Cheng, Chia-Wei Lee
Conditional Edge-Fault Hamiltonicity of Cartesian Product Graphs. IEEE Trans. Parallel Distributed Syst. 24(10): 1951-1960 (2013) - 2012
- [j5]Chia-Wei Lee
Pancyclicity of Matching Composition Networks under the Conditional Fault Model. IEEE Trans. Computers 61(2): 278-183 (2012) - 2011
- [j4]Sun-Yuan Hsieh, Chia-Wei Lee
Diagnosability of Two-Matching Composition Networks under the MMast Model. IEEE Trans. Dependable Secur. Comput. 8(2): 246-255 (2011) - [j3]Chia-Wei Lee
Determining the Diagnosability of (1, 2)-Matching Composition Networks and Its Applications. IEEE Trans. Dependable Secur. Comput. 8(3): 353-362 (2011) - 2010
- [j2]Sun-Yuan Hsieh, Chia-Wei Lee
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model. SIAM J. Discret. Math. 23(4): 2100-2119 (2010)
2000 – 2009
- 2009
- [j1]Sun-Yuan Hsieh, Chia-Wei Lee
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks. IEEE Trans. Parallel Distributed Syst. 20(4): 581-592 (2009) - [c6]Chia-Wei Lee, Justie Su-tzu Juan
An On-Line Parallel Algorithm for Node Ranking of Trees. ICA3PP 2009: 384-395 - 2008
- [c5]Sun-Yuan Hsieh, Chia-Wei Lee:
Diagnosability of Two-Matching Composition Networks. COCOON 2008: 478-486 - [c4]Sun-Yuan Hsieh, Chia-Wei Lee:
Hamiltonicity of Matching Composition Networks with Conditional Edge Faults. TAMC 2008: 160-169 - 2007
- [c3]Sun-Yuan Hsieh, Chang-Yu Wu, Chia-Wei Lee:
Fault-free Hamiltonian cycles in locally twisted cubes under conditional edge faults. ICPADS 2007: 1-8 - 2005
- [c2]Shu-Heng Chen, Bin-Tzong Chie, Chia-Wei Lee:
Agent-based modeling of lottery markets with the expected-utility paradigm. Congress on Evolutionary Computation 2005: 366-373 - [c1]Chia-Wei Lee, Justie Su-tzu Juan:
On-line Ranking Algorithms for Trees. FCS 2005: 46-51
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 21:25 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: