default search action
Ro-Yu Wu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j24]Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang
:
Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting. J. Supercomput. 79(4): 4126-4145 (2023) - 2022
- [j23]Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
Improved algorithms for ranking and unranking (k, m)-ary trees in B-order. J. Comb. Optim. 44(3): 1495-1510 (2022) - [c13]Ro-Yu Wu, Cheng-Chia Tseng, Ling-Ju Hung
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms. ISCO 2022: 201-211 - 2021
- [j22]Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang
A loopless algorithm for generating (k, m)-ary trees in Gray code order. Optim. Lett. 15(4): 1133-1154 (2021) - [c12]Kung-Jui Pai, Ro-Yu Wu, Sheng-Lung Peng, Jou-Ming Chang:
Three Edge-Disjoint Hamiltonian Cycles in Crossed Cubes with Applications to Fault-Tolerant Data Broadcasting. HPCC/DSS/SmartCity/DependSys 2021: 377-383 - 2020
- [j21]Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
Three completely independent spanning trees of crossed cubes with application to secure-protection routing. Inf. Sci. 541: 516-530 (2020) - [c11]Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang:
A Loopless Algorithm for Generating (k, m)-ary Trees in Gray-Code Order. FAW 2020: 121-132
2010 – 2019
- 2019
- [j20]Kung-Jui Pai
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order. Discret. Appl. Math. 268: 223-236 (2019) - [j19]Shih-Shun Kao
Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J. Comb. Optim. 38(3): 972-986 (2019) - [j18]Jou-Ming Chang
The 4-component connectivity of alternating group networks. Theor. Comput. Sci. 766: 38-45 (2019) - [j17]Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theor. Comput. Sci. 784: 65-74 (2019) - [c10]Yu-Hsuan Chang, Ro-Yu Wu, Ruay-Shiung Chang, Jou-Ming Chang
Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees. AAIM 2019: 16-28 - [c9]Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang
Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes. FAW 2019: 88-99 - [c8]Kung-Jui Pai, Ruay-Shiung Chang, Ro-Yu Wu, Jou-Ming Chang
Three Completely Independent Spanning Trees of Crossed Cubes with Application to Secure-Protection Routing. HPCC/SmartCity/DSS 2019: 1358-1365 - 2018
- [c7]Shih-Shun Kao
Constructing Independent Spanning Trees on Bubble-Sort Networks. COCOON 2018: 1-13 - [c6]Jou-Ming Chang
Two Kinds of Generalized 3-Connectivities of Alternating Group Networks. FAW 2018: 3-14 - [i1]Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Jinn-Shyong Yang:
The 4-Component Connectivity of Alternating Group Networks. CoRR abs/1808.06160 (2018) - 2017
- [c5]Shih-Shun Kao
A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks. COCOA (1) 2017: 41-55 - [c4]Kung-Jui Pai, Jou-Ming Chang
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order. FAW 2017: 221-232 - 2016
- [j16]Ro-Yu Wu, Jou-Ming Chang
Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1067-1074 (2016) - [j15]Jou-Ming Chang
Locally exchanged twisted cubes: Connectivity and super connectivity. Inf. Process. Lett. 116(7): 460-466 (2016) - [j14]Yu-Sheng Huang, Sheng-Lung Peng, Ro-Yu Wu:
An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs. J. Interconnect. Networks 16(3-4): 1650006:1-1650006:18 (2016) - [j13]Kung-Jui Pai, Jou-Ming Chang
Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65]. Theor. Comput. Sci. 651: 87-88 (2016) - [c3]Kung-Jui Pai, Ro-Yu Wu, Jou-Ming Chang
Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order. COCOA 2016: 505-518 - 2014
- [j12]Kung-Jui Pai, Jou-Ming Chang
Queue Layouts of Toroidal Grids. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1180-1186 (2014) - [j11]Wen-Yin Huang, Jia Jie Liu, Jou-Ming Chang
Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1187-1191 (2014) - [j10]Ro-Yu Wu, Jou-Ming Chang
A loopless algorithm for generating multiple binary tree sequences simultaneously. Theor. Comput. Sci. 556: 25-33 (2014) - [j9]Kung-Jui Pai, Jou-Ming Chang
Incidence coloring on hypercubes. Theor. Comput. Sci. 557: 59-65 (2014) - 2013
- [j8]Ro-Yu Wu, Jou-Ming Chang
Ranking and Unranking t-ary Trees in a Gray-Code Order. Comput. J. 56(11): 1388-1395 (2013) - [j7]Ro-Yu Wu, Jou-Ming Chang
Ranking and Unranking of Non-regular Trees in Gray-Code Order. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1059-1065 (2013) - [c2]Ro-Yu Wu, Jou-Ming Chang
A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously. COCOA 2013: 340-350 - 2011
- [j6]Ro-Yu Wu, Jou-Ming Chang
Ranking and Unranking of t-Ary Trees Using RD-Sequences. IEICE Trans. Inf. Syst. 94-D(2): 226-232 (2011) - [j5]Ro-Yu Wu, Jou-Ming Chang
Ranking and unranking of non-regular trees with a prescribed branching sequence. Math. Comput. Model. 53(5-6): 1331-1335 (2011) - [j4]Ro-Yu Wu, Jou-Ming Chang
Amortized efficiency of generating planar paths in convex position. Theor. Comput. Sci. 412(35): 4504-4512 (2011) - 2010
- [j3]Ro-Yu Wu, Jou-Ming Chang
Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence. Comput. J. 53(6): 661-666 (2010)
2000 – 2009
- 2009
- [j2]Jou-Ming Chang
On the diameter of geometric path graphs of points in convex position. Inf. Process. Lett. 109(8): 409-413 (2009) - [c1]Ro-Yu Wu, Jou-Ming Chang
A Developed Restricted Rotation for Binary Trees Transformation. HIS (1) 2009: 78-83 - 2006
- [j1]Ro-Yu Wu, Jou-Ming Chang
A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations. Theor. Comput. Sci. 355(3): 303-314 (2006)
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-04-24 23:11 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: