Hon-Chan Chen
Orcid: 0000-0003-0342-6317
According to our database1,
Hon-Chan Chen
authored at least 25 papers
between 1995 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2021
Three Types of Two-Disjoint-Cycle-Cover Pancyclicity and Their Applications to Cycle Embedding in Locally Twisted Cubes.
Comput. J., 2021
2019
On the Study of Shortest-path Problem on Coal-transportation Networks using Dijkstra's Algorithm.
Proceedings of the IEEE International Conference on Consumer Electronics - Taiwan, 2019
2018
IEICE Trans. Inf. Syst., 2018
Appl. Math. Comput., 2018
2017
Inf. Process. Lett., 2017
2016
A Slack Reclamation Method for Reducing the Speed Fluctuations on the DVFS Real-Time Scheduling.
IEICE Trans. Electron., 2016
2015
Complete Cycle Embedding in Crossed Cubes with Two-Disjoint-Cycle-Cover Pancyclicity.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
IEICE Trans. Inf. Syst., 2015
2014
Int. J. Comput. Math., 2014
Proceedings of the Intelligent Systems and Applications, 2014
2012
Identifying Restricted-Faults in Multiprocessor Meshes under the PMC Diagnostic Model.
Proceedings of the Sixth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2012
2011
Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions.
Appl. Math. Comput., 2011
2010
An Improved Securer and Efficient Nonce-Based Authentication Scheme with Token-Update.
Informatica, 2010
2009
Informatica (Slovenia), 2009
2008
2004
Optimal Sequential and Parallel Algorithms for Cut Vertices and Bridges on Trapezoid Graphs.
Discret. Math. Theor. Comput. Sci., 2004
2002
Proceedings of the International Symposium on Parallel Architectures, 2002
1997
IEEE Trans. Parallel Distributed Syst., 1997
Inf. Process. Lett., 1997
1995
An O(log n) Parallel Algorithm for Constructing a Spanning Tree on Permutation Graphs.
Inf. Process. Lett., 1995