Chia-Wei Lee

Orcid: 0000-0002-5337-0473

According to our database1, Chia-Wei Lee authored at least 37 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks.
J. Parallel Distributed Comput., November, 2023

2022
Information spreading in mobile social networks: identifying the influential nodes using FPSO algorithm.
Proceedings of the 2022 10th International Conference on Information Technology: IoT and Smart City, 2022

The Study of 60 GHz Wideband Conductor-Backed Coplanar Waveguide on a TGV Substrate.
Proceedings of the 11th IEEE Global Conference on Consumer Electronics, 2022

2021
Dynamic Flow Scheduling Technique for Load Balancing in Fat-Tree Data Center Networks.
Int. J. Perform. Eng., 2021

Social Distance Detection Using Wireless Signal in Social Networks.
Proceedings of the Security and Privacy in Social Networks and Big Data, 2021

2020
Conditional diagnosability of component-composition graphs under the PMC model.
Theor. Comput. Sci., 2020

R3-connectivity of folded hypercubes.
Discret. Appl. Math., 2020

2018
The Relationship Between g-Restricted Connectivity and g-Good-Neighbor Fault Diagnosability of General Regular Networks.
IEEE Trans. Reliab., 2018

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

Classifying Protein Specific Residue Structures Based on Graph Mining.
IEEE Access, 2018

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
{2, 3}-Restricted connectivity of locally twisted cubes.
Theor. Comput. Sci., 2016

Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks.
Inf. Comput., 2016

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

2015
An Improved Approximation Ratio to the Partial-Terminal Steiner Tree Problem.
IEEE Trans. Computers, 2015

An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2.
J. Discrete Algorithms, 2015

Weight-constrained and density-constrained paths in a tree: Enumerating, counting, and k-maximum density paths.
Discret. Appl. Math., 2015

An Enhanced Algorithm for Reconstructing a Phylogenetic Tree Based on the Tree Rearrangement and Maximum Likelihood Method.
Proceedings of the Intelligent Computing Theories and Methodologies, 2015

A Novel Algorithm for Classifying Protein Structure Familiar by Using the Graph Mining Approach.
Proceedings of the Intelligent Computing Theories and Methodologies, 2015

2014
Hamiltonicity of Product Networks with Faulty Elements.
IEEE Trans. Parallel Distributed Syst., 2014

Diagnosability of Component-Composition Graphs in the MM* Model.
ACM Trans. Design Autom. Electr. Syst., 2014

Extended fault-tolerant bipanconnectivity and panconnectivity of folded hypercubes.
Int. J. Mob. Commun., 2014

A Dynamic Data Placement Strategy for Hadoop in Heterogeneous Environments.
Big Data Res., 2014

IDP: An Innovative Data Placement Algorithm for Hadoop Systems.
Proceedings of the Intelligent Systems and Applications, 2014

2013
Conditional Edge-Fault Hamiltonicity of Cartesian Product Graphs.
IEEE Trans. Parallel Distributed Syst., 2013

The internal Steiner tree problem: Hardness and approximations.
J. Complex., 2013

2012
Pancyclicity of Matching Composition Networks under the Conditional Fault Model.
IEEE Trans. Computers, 2012

2011
Determining the Diagnosability of (1, 2)-Matching Composition Networks and Its Applications.
IEEE Trans. Dependable Secur. Comput., 2011

Diagnosability of Two-Matching Composition Networks under the MM<sup>ast</sup> Model.
IEEE Trans. Dependable Secur. Comput., 2011

2010
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model.
SIAM J. Discret. Math., 2010

2009
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks.
IEEE Trans. Parallel Distributed Syst., 2009

An On-Line Parallel Algorithm for Node Ranking of Trees.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2009

2008
Hamiltonicity of Matching Composition Networks with Conditional Edge Faults.
Proceedings of the Theory and Applications of Models of Computation, 2008

Diagnosability of Two-Matching Composition Networks.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Fault-free Hamiltonian cycles in locally twisted cubes under conditional edge faults.
Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007

2005
On-line Ranking Algorithms for Trees.
Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005

Agent-based modeling of lottery markets with the expected-utility paradigm.
Proceedings of the IEEE Congress on Evolutionary Computation, 2005


  Loading...