Shin-Shin Kao

26 papers Journal 23Unranked 3
YearRankTypeTitle / Venue / Authors
2024 — conf
Construction of cycles with various lengths in dual cube extensive networks.
ICCE-Taiwan
Shin-Shin Kao
2022 J jnl
On the 2-Vertex-Fault Hamiltonicity for Graphs Satisfying Ore's Theorem.
J. Inf. Sci. Eng.
Hsiu-Chunj Pan, Hsun Su, Shin-Shin Kao
2018 J jnl
On mutually independent hamiltonian cycles.
Ars Comb.
Hsun Su, Hsiu-Chunj Pan, Shih-Yan Chen, Shin-Shin Kao
2017 J jnl
A study on degree characterization for hamiltonian-connected graphs.
Ars Comb.
Hsun Su, Yuan-Kang Shih, Shih-Yan Chen, Shin-Shin Kao
2016 J jnl
On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance.
Discret. Math. Theor. Comput. Sci.
Shih-Yan Chen, Shin-Shin Kao, Hsun Su
2014 J jnl
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization.
Int. J. Comput. Math.
Yuan-Kang Shih, Hsun Su, Shin-Shin Kao
2013 J jnl
Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs.
Ars Comb.
Shin-Shin Kao, Hua-Min Huang, Kung-Ming Hsu, Lih-Hsing Hsu
2012 J jnl
Mutually independent Hamiltonian cycles in alternating group graphs.
J. Supercomput.
Hsun Su, Shih-Yan Chen, Shin-Shin Kao
2012 J jnl
On the 1-fault hamiltonicity for graphs satisfying Ore's theorem.
Inf. Process. Lett.
Hsun Su, Yuan-Kang Shih, Shin-Shin Kao
2012 J jnl
Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs.
Ars Comb.
Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
2011 J jnl
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even.
Comput. Electr. Eng.
Hsun Su, Jing-Ling Pan, Shin-Shin Kao
2011 J jnl
One-to-one disjoint path covers on k-ary n-cubes.
Theor. Comput. Sci.
Yuan-Kang Shih, Shin-Shin Kao
2010 J jnl
Hamiltonian connectivity and globally 3*-connectivity of dual-cube extensive networks.
Comput. Electr. Eng.
Shih-Yan Chen, Shin-Shin Kao
2010 J jnl
Mutually independent Hamiltonian cycles in dual-cubes.
J. Supercomput.
Yuan-Kang Shih, Hui-Chun Chuang, Shin-Shin Kao, Jimmy J. M. Tan
2010 J jnl
Ring embedding in faulty generalized honeycomb torus - GHT(
Int. J. Comput. Math.
Li-Yen Hsu, Feng-I Ling, Shin-Shin Kao, Hsun-Jung Cho
2009 J jnl
Globally bi-3
Discret. Math.
Shin-Shin Kao, Hong-Chun Hsu, Lih-Hsing Hsu
2008 J jnl
Hamiltonian Connectivity, Pancyclicity and 3^*-Connectivity of Matching Composition Networks.
J. Inf. Sci. Eng.
Shin-Shin Kao, Jui-Chia Wu, Yuan-Kang Shih
2008 J jnl
Vertex-bipancyclicity of the generalized honeycomb tori.
Comput. Math. Appl.
Yuan-Kang Shih, Yi-Chien Wu, Shin-Shin Kao, Jimmy J. M. Tan
2007 — conf
Extending Security/Sustainability through Pervasive Spider Web Networks in Urbanism.
Security and Management
Li-Yen Hsu, Shin-Shin Kao
2006 J jnl
Cubic planar hamiltonian graphs of various types.
Discret. Math.
Shin-Shin Kao, Kung-Ming Hsu, Lih-Hsing Hsu
2006 — conf
Developing Dual-Surveillance Based Vehicle Security Management with Generalized Honeycomb Tori.
Security and Management
Li-Yen Hsu, Shin-Shin Kao
2006 J jnl
Panpositionable Hamiltonian Graphs.
Ars Comb.
Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu
2005 J jnl
Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs.
Appl. Math. Comput.
Shin-Shin Kao, Lih-Hsing Hsu
2005 J jnl
The globally bi-3* and hyper bi-3* connectedness of the spider web networks.
Appl. Math. Comput.
Shin-Shin Kao, Lih-Hsing Hsu
2003 J jnl
Brother trees: A family of optimal 1
Inf. Process. Lett.
Shin-Shin Kao, Lih-Hsing Hsu
2003 J jnl
Super-connectivity and super-edge-connectivity for some interconnection networks.
Appl. Math. Comput.
Y-Chuang Chen, Jimmy J. M. Tan, Lih-Hsing Hsu, Shin-Shin Kao