Hamiltonian Cycle Problem on Distance-Hereditary Graphs. - Ruo-Wei Hung; Shaur-Ching Wu; Maw-Shang Chang (J. Inf. Sci. Eng., 2003)

A simple linear algorithm for the connected domination problem in circular-arc graphs. - Maw-Shang Chang; Ruo-Wei Hung (Discuss. Math. Graph Theory, 2004)

Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, . - Ruo-Wei Hung; Maw-Shang Chang (Theor. Comput. Sci., 2005)

Solving the path cover problem on circular-arc graphs by using an approximation algorithm. - Ruo-Wei Hung; Maw-Shang Chang (Discret. Appl. Math., 2006)

Optimal edge ranking of complete bipartite graphs in polynomial time. - Ruo-Wei Hung (Discuss. Math. Graph Theory, 2006)

Finding a minimum path cover of a distance-hereditary graph in polynomial time. - Ruo-Wei Hung; Maw-Shang Chang (Discret. Appl. Math., 2007)

Optimal vertex ranking of block graphs. - Ruo-Wei Hung (Inf. Comput., 2008)

Extractive Support Vector Algorithm on Support Vector Machines for Image Restoration. - Chih-Chia Yao; Pao-Ta Yu; Ruo-Wei Hung (Fundam. Informaticae, 2009)

Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. - Ruo-Wei Hung; Maw-Shang Chang (ICCSA (2), 2010)

Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes - Ruo-Wei Hung (CoRR, 2010)

Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes - Ruo-Wei Hung (CoRR, 2010)

Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs. - Ruo-Wei Hung; Maw-Shang Chang (Appl. Math. Lett., 2011)

Linear-time algorithm for the matched-domination problem in cographs. - Ruo-Wei Hung; Chih-Chia Yao (Int. J. Comput. Math., 2011)

Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes. - Ruo-Wei Hung (Theor. Comput. Sci., 2011)

An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. - Ruo-Wei Hung; Maw-Shang Chang (Theor. Comput. Sci., 2011)

Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs. - Ruo-Wei Hung (Theory Comput. Syst., 2012)

DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph. - Ruo-Wei Hung (Theor. Comput. Sci., 2013)

The Hamiltonian Property of Linear-Convex Supergrid Graphs. - Ruo-Wei Hung; Jun-Lin Li; Hao-Yu Chih; Chien-Hui Hou (CANDAR, 2015)

The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks. - Ruo-Wei Hung (Discret. Appl. Math., 2015)

The Hamiltonian properties of supergrid graphs. - Ruo-Wei Hung; Chih-Chia Yao; Shang-Ju Chan (Theor. Comput. Sci., 2015)

Hamiltonian cycles in linear-convex supergrid graphs. - Ruo-Wei Hung (Discret. Appl. Math., 2016)

The Hamiltonian connectivity of some alphabet supergrid graphs. - Ruo-Wei Hung; Jun-Lin Li; Chih-Han Lin (iCAST, 2017)

The Hamiltonian connectivity of rectangular supergrid graphs. - Ruo-Wei Hung; Chin-Feng Li; Jong-Shin Chen; Qing-SongSu (Discret. Optim., 2017)

Some Study of Applying Infra-Red in Agriculture IoT. - Hung-Yu Chien; Yuh-Min Tseng; Ruo-Wei Hung (iCAST, 2018)

Leakage-Resilient Certificate-based Encryption Scheme for IoT Environments. - Yuh-Min Tseng; Jui-Di Wu; Ruo-Wei Hung; Hung-Yu Chien (iCAST, 2018)

Hierarchical MQTT with Edge Computation. - Hung-Yu Chien; Guo-Hao Qiu; Ruo-Wei Hung; An-Tong Shih; Chunhua Su (iCAST, 2019)

Finding Longest (s, t)-paths of O-shaped Supergrid Graphs in Linear Time. - Ruo-Wei Hung; Fatemeh Keshavarz-Kohjerdi; Yuh-Min Tseng; Guo-Hao Qiu (iCAST, 2019)

The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs. - Fatemeh Keshavarz-Kohjerdi; Ruo-Wei Hung (CoRR, 2019)

The Longest (s, t)-paths of O-shaped Supergrid Graphs. - Ruo-Wei Hung; Fatemeh Keshavarz-Kohjerdi (CoRR, 2019)

A MQTT-API-compatible IoT security-enhanced platform. - 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 (Int. J. Sens. Networks, 2020)

A GNSS-Based Crowd-Sensing Strategy for Specific Geographical Areas. - Chuan-Bi Lin; Ruo-Wei Hung; Chi-Yueh Hsu; Jong-Shin Chen (Sensors, 2020)

The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs. - Ruo-Wei Hung; Ming-Jung Chiu (COCOON, 2021)

The Domination and Independent Domination Problems in Supergrid Graphs. - Ruo-Wei Hung; Ming-Jung Chiu; Jong-Shin Chen (ICCSA (1), 2021)

The Paired Restrained-Domination Problem in Supergrid Graphs. - Ruo-Wei Hung; Ming-Jung Chiu (TAAI, 2021)

Research on KNN-Based GNSS Coordinate Classification for Epidemic Management. - Chi-Yueh Hsu; Chun-Ming Kuo; Ruo-Wei Hung; Jong-Shin Chen (ICS, 2022)

Domination and Independent Domination in Extended Supergrid Graphs. - Jong-Shin Chen; Ruo-Wei Hung; Fatemeh Keshavarz-Kohjerdi; Yung-Fa Huang (Algorithms, 2022)

Finding Hamiltonian and Longest (s, t)-Paths of C-Shaped Supergrid Graphs in Linear Time. - Fatemeh Keshavarz-Kohjerdi; Ruo-Wei Hung (Algorithms, 2022)

An Efficient GNSS Coordinate Recognition Algorithm for Epidemic Management. - Jong-Shin Chen; Chun-Ming Kuo; Ruo-Wei Hung (Algorithms, 2023)

Restrained domination and its variants in extended supergrid graphs. - Ruo-Wei Hung (Theor. Comput. Sci., 2023)

Paired restraint domination in extended supergrid graphs. - Ruo-Wei Hung; Ling-Ju Hung (J. Supercomput., 2024)