Chia-Wei Lee
Orcid: 0000-0002-5337-0473
According to our database1,
Chia-Wei Lee
authored at least 38 papers
between 2005 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
2025
0
1
2
3
4
5
6
1
1
1
2
3
2
3
4
2
1
2
1
1
2
1
1
1
2
1
1
2
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Evaluating the reliability of complete Josephus cubes under extra link fault with the optimal solution of the edge isoperimetric problem.
Theor. Comput. Sci., 2025
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
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
Proceedings of the Security and Privacy in Social Networks and Big Data, 2021
2020
Theor. Comput. Sci., 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
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
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks.
Inf. Comput., 2016
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016
2015
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
IEEE Trans. Parallel Distributed Syst., 2014
ACM Trans. Design Autom. Electr. Syst., 2014
Int. J. Mob. Commun., 2014
Big Data Res., 2014
Proceedings of the Intelligent Systems and Applications, 2014
2013
IEEE Trans. Parallel Distributed Syst., 2013
2012
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
IEEE Trans. Parallel Distributed Syst., 2009
Proceedings of the Algorithms and Architectures for Parallel Processing, 2009
2008
Proceedings of the Theory and Applications of Models of Computation, 2008
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
Proceedings of the IEEE Congress on Evolutionary Computation, 2005