default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuo-Wei Hung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Ruo-Wei Hung, Ling-Ju Hung:
Paired restraint domination in extended supergrid graphs. J. Supercomput. 80(9): 13217-13249 (2024)- 2023
- [j24]Jong-Shin Chen
, Chun-Ming Kuo, Ruo-Wei Hung:
An Efficient GNSS Coordinate Recognition Algorithm for Epidemic Management. Algorithms 16(3): 132 (2023) - [j23]Ruo-Wei Hung:
Restrained domination and its variants in extended supergrid graphs. Theor. Comput. Sci. 956: 113832 (2023) - 2022
- [j22]Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung:
Finding Hamiltonian and Longest (s, t)-Paths of C-Shaped Supergrid Graphs in Linear Time. Algorithms 15(2): 61 (2022) - [j21]Jong-Shin Chen, Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi, Yung-Fa Huang:
Domination and Independent Domination in Extended Supergrid Graphs. Algorithms 15(11): 402 (2022) - [c11]Chi-Yueh Hsu, Chun-Ming Kuo, Ruo-Wei Hung, Jong-Shin Chen:
Research on KNN-Based GNSS Coordinate Classification for Epidemic Management. ICS 2022: 493-500 - 2021
- [c10]Ruo-Wei Hung, Ming-Jung Chiu:
The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs. COCOON 2021: 401-412 - [c9]Ruo-Wei Hung, Ming-Jung Chiu, Jong-Shin Chen:
The Domination and Independent Domination Problems in Supergrid Graphs. ICCSA (1) 2021: 631-646 - [c8]Ruo-Wei Hung, Ming-Jung Chiu:
The Paired Restrained-Domination Problem in Supergrid Graphs. TAAI 2021: 84-89 - 2020
- [j20]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): 54-68 (2020) - [j19]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): 4171 (2020)
2010 – 2019
- 2019
- [c7]Hung-Yu Chien, Guo-Hao Qiu, Ruo-Wei Hung, An-Tong Shih, Chunhua Su:
Hierarchical MQTT with Edge Computation. iCAST 2019: 1-5 - [c6]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: 1-8 - [i6]Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung:
The Hamiltonicity, Hamiltonian Connectivity, and Longest (s, t)-path of L-shaped Supergrid Graphs. CoRR abs/1904.02581 (2019) - [i5]Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi:
Finding Hamiltonian and Longest (s, t)-paths of C-shaped Supergrid Graphs in Linear Time. CoRR abs/1908.07447 (2019) - [i4]Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi:
The Longest (s, t)-paths of O-shaped Supergrid Graphs. CoRR abs/1911.08558 (2019) - 2018
- [c5]Hung-Yu Chien, Yuh-Min Tseng, Ruo-Wei Hung:
Some Study of Applying Infra-Red in Agriculture IoT. iCAST 2018: 1-5 - [c4]Yuh-Min Tseng, Jui-Di Wu, Ruo-Wei Hung, Hung-Yu Chien:
Leakage-Resilient Certificate-based Encryption Scheme for IoT Environments. iCAST 2018: 251-256 - 2017
- [j18]Ruo-Wei Hung, Chin-Feng Li, Jong-Shin Chen, Qing-SongSu:
The Hamiltonian connectivity of rectangular supergrid graphs. Discret. Optim. 26: 41-65 (2017) - [c3]Ruo-Wei Hung, Jun-Lin Li, Chih-Han Lin:
The Hamiltonian connectivity of some alphabet supergrid graphs. iCAST 2017: 27-34 - 2016
- [j17]Ruo-Wei Hung:
Hamiltonian cycles in linear-convex supergrid graphs. Discret. Appl. Math. 211: 99-112 (2016) - 2015
- [j16]Ruo-Wei Hung:
The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks. Discret. Appl. Math. 181: 109-122 (2015) - [j15]Ruo-Wei Hung, Chih-Chia Yao, Shang-Ju Chan:
The Hamiltonian properties of supergrid graphs. Theor. Comput. Sci. 602: 132-148 (2015) - [c2]Ruo-Wei Hung, Jun-Lin Li, Hao-Yu Chih, Chien-Hui Hou:
The Hamiltonian Property of Linear-Convex Supergrid Graphs. CANDAR 2015: 103-109 - [i3]Ruo-Wei Hung:
Hamiltonian Cycles in Linear-Convex Supergrid Graphs. CoRR abs/1506.00190 (2015) - 2013
- [j14]Ruo-Wei Hung:
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph. Theor. Comput. Sci. 498: 28-45 (2013) - 2012
- [j13]Ruo-Wei Hung:
Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs. Theory Comput. Syst. 50(4): 721-738 (2012) - 2011
- [j12]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): 648-652 (2011) - [j11]Ruo-Wei Hung, Chih-Chia Yao:
Linear-time algorithm for the matched-domination problem in cographs. Int. J. Comput. Math. 88(10): 2042-2056 (2011) - [j10]Ruo-Wei Hung:
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes. Theor. Comput. Sci. 412(35): 4747-4753 (2011) - [j9]Ruo-Wei Hung, Maw-Shang Chang:
An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs. Theor. Comput. Sci. 412(39): 5351-5373 (2011) - 2010
- [c1]Ruo-Wei Hung, Maw-Shang Chang:
Certifying Algorithms for the Path Cover and Related Problems on Interval Graphs. ICCSA (2) 2010: 314-323 - [i2]Ruo-Wei Hung:
Constructing Two Edge-Disjoint Hamiltonian Cycles and Two Equal Node-Disjoint Cycles in Twisted Cubes. CoRR abs/1006.3909 (2010) - [i1]Ruo-Wei Hung:
Constructing Two Edge-Disjoint Hamiltonian Cycles in Locally Twisted Cubes. CoRR abs/1010.2466 (2010)
2000 – 2009
- 2009
- [j8]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): 171-190 (2009) - 2008
- [j7]Ruo-Wei Hung:
Optimal vertex ranking of block graphs. Inf. Comput. 206(11): 1288-1302 (2008) - 2007
- [j6]Ruo-Wei Hung, Maw-Shang Chang:
Finding a minimum path cover of a distance-hereditary graph in polynomial time. Discret. Appl. Math. 155(17): 2242-2256 (2007) - 2006
- [j5]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): 76-105 (2006) - [j4]Ruo-Wei Hung:
Optimal edge ranking of complete bipartite graphs in polynomial time. Discuss. Math. Graph Theory 26(1): 149-159 (2006) - 2005
- [j3]Ruo-Wei Hung, Maw-Shang Chang:
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs, . Theor. Comput. Sci. 341(1-3): 411-440 (2005) - 2004
- [j2]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): 137-145 (2004) - 2003
- [j1]Ruo-Wei Hung, Shaur-Ching Wu, Maw-Shang Chang:
Hamiltonian Cycle Problem on Distance-Hereditary Graphs. J. Inf. Sci. Eng. 19(5): 827-838 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
