default search action
Chiuyuan Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j28]Chia-An Hsu
, Chung-Hsiang Tsai
Receiver-Initiated Data Collection in Wake-Up Radio Enabled mIoT Networks: Achieving Collision-Free Transmissions by Hashing and Partitioning. IEEE Trans. Green Commun. Netw. 5(2): 868-883 (2021) - 2020
- [j27]Yu-Ning Chen, Wu-Hsiung Lin, Chiuyuan Chen:
An Effective Sensor Deployment Scheme that Ensures Multilevel Coverage of Wireless Sensor Networks with Uncertain Properties. Sensors 20(7): 1831 (2020) - [c8]Chia-An Hsu, Frank Y. Li
Achieving Ultra Energy-efficient and Collision-free Data Collection in Wake-up Radio Enabled mIoT. ICC 2020: 1-6
2010 – 2019
- 2019
- [j26]Kuan-Ting Chu, Wu-Hsiung Lin, Chiuyuan Chen:
Mutual transferability for (F, B, R)-domination on strongly chordal graphs and cactus graphs. Discret. Appl. Math. 259: 41-52 (2019) - 2018
- [c7]Yu-Ning Chen, Chiuyuan Chen:
Sensor Deployment under Probabilistic Sensing Model. HPCCT 2018: 33-36 - [c6]Siyu Liu, Chiuyuan Chen, Wu-Hsiung Lin:
A Suggestion of a New Measure of Importance of Nodes in Disease-propagation Graphs. HPCCT 2018: 48-52 - 2017
- [j25]Shih-Ming Lo, Wu-Hsiung Lin, Chiuyuan Chen, Yu-Chee Tseng:
Optimal coloring for data collection in tree-based wireless sensor networks. Theor. Comput. Sci. 700: 23-36 (2017) - 2014
- [j24]Well Y. Chiu, Chiuyuan Chen, Shih-Yu Tsai:
A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon. Inf. Process. Lett. 114(10): 515-518 (2014) - 2013
- [c5]Well Y. Chiu, Chiuyuan Chen:
Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs. IWOCA 2013: 115-126 - 2011
- [j23]Yi-Jiun Liu, James K. Lan, Well Y. Chou, Chiuyuan Chen:
Constructing independent spanning trees for locally twisted cubes. Theor. Comput. Sci. 412(22): 2237-2252 (2011) - 2010
- [j22]Well Y. Chou, Chiuyuan Chen:
All-to-all personalized exchange in generalized shuffle-exchange networks. Theor. Comput. Sci. 411(16-18): 1669-1684 (2010)
2000 – 2009
- 2009
- [j21]James K. Lan, Well Y. Chou, Chiuyuan Chen:
Efficient Routing Algorithms for Generalized Shuffle-Exchange Networks. Discret. Math. Algorithms Appl. 1(2): 267-282 (2009) - [j20]James K. Lan, Victor W. Liu, Chiuyuan Chen:
Improved upper and lower bounds on the optimization of mixed chordal ring networks. Inf. Process. Lett. 109(13): 757-762 (2009) - [c4]Well Y. Chou, Richard B. Chen, Chiuyuan Chen:
All-to-All Personalized Exchange Algorithms in Generalized Shuffle-Exchange Networks. ICN 2009: 185-190 - [c3]Yi-Jiun Liu, Well Y. Chou, James K. Lan, Chiuyuan Chen:
Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes. ISPAN 2009: 17-22 - 2007
- [j19]Ken S. Hu, Shyun-Shyun Yeoh, Chiuyuan Chen, Lih-Hsing Hsu:
Node-pancyclicity and edge-pancyclicity of hypercube variants. Inf. Process. Lett. 102(1): 1-7 (2007) - [j18]Victor W. Liu, Chiuyuan Chen, Richard B. Chen:
Optimal all-to-all personalized exchange in d -nary banyan multistage interconnection networks. J. Comb. Optim. 14(2-3): 131-142 (2007) - 2006
- [j17]Chiuyuan Chen, Chih-Shin Hung, Wen-Shiang Tang:
On the existence of hyper-L triple-loop networks. Discret. Math. 306(12): 1132-1138 (2006) - [j16]Chiuyuan Chen, Jing-Kai Lou:
An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network. IEEE Commun. Lett. 10(4): 296-298 (2006) - [j15]Ju-Si Lee, James K. Lan, Chiuyuan Chen:
On Degenerate Double-loop L-shapes. J. Interconnect. Networks 7(2): 195-216 (2006) - [j14]Chiuyuan Chen, James K. Lan, Wen-Shiang Tang:
An efficient algorithm to find a double-loop network that realizes a given L-shape. Theor. Comput. Sci. 359(1-3): 69-76 (2006) - 2005
- [j13]Chiuyuan Chen, Frank K. Hwang, James K. Lan:
Equivalence of buddy networks with arbitrary number of stages. Networks 46(4): 171-176 (2005) - 2004
- [j12]Gerard J. Chang
Vertex and Tree Arboricities of Graphs. J. Comb. Optim. 8(3): 295-306 (2004) - 2003
- [j11]Chiuyuan Chen, Frank K. Hwang, J. S. Lee, S. J. Shih:
The existence of hyper-L triple-loop networks. Discret. Math. 268(1-3): 287-291 (2003) - [j10]Chiuyuan Chen:
Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian. J. Comb. Optim. 7(1): 79-86 (2003) - 2002
- [j9]Robin Chi-Feng Chan, Chiuyuan Chen, Zhi-Xin Hong:
A simple algorithm to find the steps of double-loop networks. Discret. Appl. Math. 121(1-3): 61-72 (2002) - [j8]Chiuyuan Chen:
A necessary condition for a graph to be the visibility graph of a simple polygon. Theor. Comput. Sci. 276(1-2): 417-424 (2002) - 2001
- [j7]Chiuyuan Chen, Kaiping Wu:
Disproving a conjecture on planar visibility graphs. Theor. Comput. Sci. 255(1-2): 659-665 (2001) - 2000
- [j6]Frank K. Hwang, M. M. Liao, Chiuyuan Chen:
Supermodularity in Various Partition Problems. J. Glob. Optim. 18(3): 275-282 (2000) - [j5]Chiuyuan Chen, Frank K. Hwang:
Equivalent L-Shapes of Double-Loop Networks for the Degenerate Case. J. Interconnect. Networks 1(1): 47-60 (2000) - [j4]Chiuyuan Chen, Frank K. Hwang:
The Minimum Distance Diagram of Double-Loop Networks. IEEE Trans. Computers 49(9): 977-979 (2000)
1990 – 1999
- 1997
- [j3]Chiuyuan Chen, Chin-Chen Chang, Gerard J. Chang:
Proper interval graphs and the guard problem. Discret. Math. 170(1-3): 223-230 (1997) - 1995
- [c2]Chiuyuan Chen, Chin-Chen Chang:
Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons. Combinatorics and Computer Science 1995: 39-47 - 1994
- [c1]Shiou-Yi Lin, Chiuyuan Chen:
Planar Visibility Graphs. CCCG 1994: 30-35 - 1990
- [j2]Chiuyuan Chen, Ruei-Chuan Chang:
On the Minimality of Polygon Triangualtion. BIT 30(4): 570-582 (1990)
1980 – 1989
- 1987
- [j1]Lih-Hsing Hsu, Chiuyuan Chen, En-Yih Jean:
A class of additive multiplicative graph functions. Discret. Math. 65(1): 53-63 (1987)
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 2024-08-05 20:24 CEST 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: