Ruo-Wei Hung

Theor. Comput. Sci., May, 2023

An Efficient GNSS Coordinate Recognition Algorithm for Epidemic Management.

[BibT_eX]

[DOI]

Jong-Shin Chen

Chun-Ming Kuo

Algorithms, March, 2023

2022

Finding Hamiltonian and Longest (s, t)-Paths of C-Shaped Supergrid Graphs in Linear Time.

[BibT_eX]

[DOI]

Algorithms, 2022

Domination and Independent Domination in Extended Supergrid Graphs.

[BibT_eX]

[DOI]

Jong-Shin Chen

Yung-Fa Huang

Algorithms, 2022

Research on KNN-Based GNSS Coordinate Classification for Epidemic Management.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Computer Technologies and Applications, 2022

2021

The Paired Restrained-Domination Problem in Supergrid Graphs.

[BibT_eX]

[DOI]

Ming-Jung Chiu

Proceedings of the 2021 International Conference on Technologies and Applications of Artificial Intelligence, 2021

The Domination and Independent Domination Problems in Supergrid Graphs.

[BibT_eX]

[DOI]

Ming-Jung Chiu

Jong-Shin Chen

Proceedings of the Computational Science and Its Applications - ICCSA 2021, 2021

The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs.

[BibT_eX]

[DOI]

Ming-Jung Chiu

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

A GNSS-Based Crowd-Sensing Strategy for Specific Geographical Areas.

[BibT_eX]

[DOI]

Sensors, 2020

A MQTT-API-compatible IoT security-enhanced platform.

[BibT_eX]

[DOI]

Int. J. Sens. Networks, 2020

2019

The Longest (s, t)-paths of O-shaped Supergrid Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time.

[BibT_eX]

[DOI]

Yuh-Min Tseng

Guo-Hao Qiu

Proceedings of the IEEE 10th International Conference on Awareness Science and Technology, 2019

Hierarchical MQTT with Edge Computation.

[BibT_eX]

[DOI]

Proceedings of the IEEE 10th International Conference on Awareness Science and Technology, 2019

2018

Leakage-Resilient Certificate-based Encryption Scheme for IoT Environments.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Awareness Science and Technology, 2018

Some Study of Applying Infra-Red in Agriculture IoT.

[BibT_eX]

[DOI]

Hung-Yu Chien

Yuh-Min Tseng

Proceedings of the 9th International Conference on Awareness Science and Technology, 2018

2017

The Hamiltonian connectivity of rectangular supergrid graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2017

The Hamiltonian connectivity of some alphabet supergrid graphs.

[BibT_eX]

[DOI]

Jun-Lin Li

Chih-Han Lin

Proceedings of the IEEE 8th International Conference on Awareness Science and Technology, 2017

2016

Hamiltonian cycles in linear-convex supergrid graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

The Hamiltonian properties of supergrid graphs.

[BibT_eX]

[DOI]

Chih-Chia Yao

Shang-Ju Chan

Theor. Comput. Sci., 2015

The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

The Hamiltonian Property of Linear-Convex Supergrid Graphs.

[BibT_eX]

[DOI]

Proceedings of the Third International Symposium on Computing and Networking, 2015

2013

DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

2012

Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

2011

An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Linear-time algorithm for the matched-domination problem in cographs.

[BibT_eX]

[DOI]

Chih-Chia Yao

Int. J. Comput. Math., 2011

Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

2010

Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes

[BibT_eX]

[DOI]

CoRR, 2010

Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes

[BibT_eX]

[DOI]

CoRR, 2010

Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2010

2009

Extractive Support Vector Algorithm on Support Vector Machines for Image Restoration.

[BibT_eX]

[DOI]

Chih-Chia Yao

Pao-Ta Yu

Fundam. Informaticae, 2009

2008

Optimal vertex ranking of block graphs.

[BibT_eX]

[DOI]

Inf. Comput., 2008

2007

Finding a minimum path cover of a distance-hereditary graph in polynomial time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Optimal edge ranking of complete bipartite graphs in polynomial time.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2006

Solving the path cover problem on circular-arc graphs by using an approximation algorithm.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs<sup>, </sup>.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

A simple linear algorithm for the connected domination problem in circular-arc graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

2003

Hamiltonian Cycle Problem on Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Shaur-Ching Wu