Ruo-Wei Hung

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 21

Top Topics

Top Venues

Theor. Comput. Sci.

Publications

Ruo-Wei Hung, Ling-Ju Hung
Paired restraint domination in extended supergrid graphs. J. Supercomput. 80 (9) (2024)
Jong-Shin Chen, Chun-Ming Kuo, Ruo-Wei Hung
An Efficient GNSS Coordinate Recognition Algorithm for Epidemic Management. Algorithms 16 (3) (2023)
Ruo-Wei Hung
Restrained domination and its variants in extended supergrid graphs. Theor. Comput. Sci. 956 (2023)
Chi-Yueh Hsu, Chun-Ming Kuo, Ruo-Wei Hung, Jong-Shin Chen
Research on KNN-Based GNSS Coordinate Classification for Epidemic Management. ICS (2022)
Jong-Shin Chen, Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, Yung-Fa Huang
Domination and Independent Domination in Extended Supergrid Graphs. Algorithms 15 (11) (2022)
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
Finding Hamiltonian and Longest (s, t)-Paths of C-Shaped Supergrid Graphs in Linear Time. Algorithms 15 (2) (2022)
Ruo-Wei Hung, Ming-Jung Chiu
The Paired Restrained-Domination Problem in Supergrid Graphs. TAAI (2021)
Ruo-Wei Hung, Ming-Jung Chiu
The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs. COCOON (2021)
Ruo-Wei Hung, Ming-Jung Chiu, Jong-Shin Chen
The Domination and Independent Domination Problems in Supergrid Graphs. ICCSA (1) (2021)
Hung-Yu Chien, Yi-Jui Chen, Guo-Hao Qiu, Jian Fu Liao, Ruo-Wei Hung, Pei-Chih Lin, Xi-An Kou, Mao-Lun Chiang, Chunhua Su
A MQTT-API-compatible IoT security-enhanced platform. Int. J. Sens. Networks 32 (1) (2020)
Chuan-Bi Lin, Ruo-Wei Hung, Chi-Yueh Hsu, Jong-Shin Chen
A GNSS-Based Crowd-Sensing Strategy for Specific Geographical Areas. Sensors 20 (15) (2020)
Hung-Yu Chien, Guo-Hao Qiu, Ruo-Wei Hung, An-Tong Shih, Chunhua Su
Hierarchical MQTT with Edge Computation. iCAST (2019)
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi
Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time. CoRR (2019)
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi
The Longest (s, t)-paths of O-shaped Supergrid Graphs. CoRR (2019)
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs. CoRR (2019)
Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, Yuh-Min Tseng, Guo-Hao Qiu
Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time. iCAST (2019)
Hung-Yu Chien, Yuh-Min Tseng, Ruo-Wei Hung
Some Study of Applying Infra-Red in Agriculture IoT. iCAST (2018)
Yuh-Min Tseng, Jui-Di Wu, Ruo-Wei Hung, Hung-Yu Chien
Leakage-Resilient Certificate-based Encryption Scheme for IoT Environments. iCAST (2018)
Ruo-Wei Hung, Chin-Feng Li, Jong-Shin Chen, Qing-SongSu
The Hamiltonian connectivity of rectangular supergrid graphs. Discret. Optim. 26 (2017)
Ruo-Wei Hung, Jun-Lin Li, Chih-Han Lin
The Hamiltonian connectivity of some alphabet supergrid graphs. iCAST (2017)
Ruo-Wei Hung
Hamiltonian cycles in linear-convex supergrid graphs. Discret. Appl. Math. 211 (2016)
Ruo-Wei Hung, Jun-Lin Li, Hao-Yu Chih, Chien-Hui Hou
The Hamiltonian Property of Linear-Convex Supergrid Graphs. CANDAR (2015)
Ruo-Wei Hung, Chih-Chia Yao, Shang-Ju Chan
The Hamiltonian properties of supergrid graphs. Theor. Comput. Sci. 602 (2015)
Ruo-Wei Hung
Hamiltonian Cycles in Linear-Convex Supergrid Graphs. CoRR (2015)
Ruo-Wei Hung
The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks. Discret. Appl. Math. 181 (2015)
Ruo-Wei Hung
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph. Theor. Comput. Sci. 498 (2013)
Ruo-Wei Hung
Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs. Theory Comput. Syst. 50 (4) (2012)
Ruo-Wei Hung, Chih-Chia Yao
Linear-time algorithm for the matched-domination problem in cographs. Int. J. Comput. Math. 88 (10) (2011)
Ruo-Wei Hung, Maw-Shang Chang
Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs. Appl. Math. Lett. 24 (5) (2011)
Ruo-Wei Hung
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes. Theor. Comput. Sci. 412 (35) (2011)
Ruo-Wei Hung, Maw-Shang Chang
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. Theor. Comput. Sci. 412 (39) (2011)
Ruo-Wei Hung, Maw-Shang Chang
Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. ICCSA (2) (2010)
Ruo-Wei Hung
Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes CoRR (2010)
Ruo-Wei Hung
Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes CoRR (2010)
Chih-Chia Yao, Pao-Ta Yu, Ruo-Wei Hung
Extractive Support Vector Algorithm on Support Vector Machines for Image Restoration. Fundam. Informaticae 90 (1-2) (2009)
Ruo-Wei Hung
Optimal vertex ranking of block graphs. Inf. Comput. 206 (11) (2008)
Ruo-Wei Hung, Maw-Shang Chang
Finding a minimum path cover of a distance-hereditary graph in polynomial time. Discret. Appl. Math. 155 (17) (2007)
Ruo-Wei Hung, Maw-Shang Chang
Solving the path cover problem on circular-arc graphs by using an approximation algorithm. Discret. Appl. Math. 154 (1) (2006)
Ruo-Wei Hung
Optimal edge ranking of complete bipartite graphs in polynomial time. Discuss. Math. Graph Theory 26 (1) (2006)
Ruo-Wei Hung, Maw-Shang Chang
. Theor. Comput. Sci. 341 (1-3) (2005)
Maw-Shang Chang, Ruo-Wei Hung
A simple linear algorithm for the connected domination problem in circular-arc graphs. Discuss. Math. Graph Theory 24 (1) (2004)
Ruo-Wei Hung, Shaur-Ching Wu, Maw-Shang Chang
Hamiltonian Cycle Problem on Distance-Hereditary Graphs. J. Inf. Sci. Eng. 19 (5) (2003)