Ro-Yu Wu

According to our database¹, Ro-Yu Wu authored at least 33 papers between 2006 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting.

[BibT_eX]

[DOI]

J. Supercomput., March, 2023

2022

Improved algorithms for ranking and unranking (k, m)-ary trees in B-order.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021

A loopless algorithm for generating (k, m)-ary trees in Gray code order.

[BibT_eX]

[DOI]

Optim. Lett., 2021

2020

Three completely independent spanning trees of crossed cubes with application to secure-protection routing.

[BibT_eX]

[DOI]

Inf. Sci., 2020

2019

A two-stages tree-searching algorithm for finding three completely independent spanning trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The 4-component connectivity of alternating group networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Improved Algorithms for Ranking and Unranking (k, m)-Ary Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Two Kinds of Generalized 3-Connectivities of Alternating Group Networks.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

Constructing Independent Spanning Trees on Bubble-Sort Networks.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order.

[BibT_eX]

[DOI]

Kung-Jui Pai

Jou-Ming Chang

Ro-Yu Wu

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Corrigendum to "Incidence coloring on hypercubes" [Theoret. Comput. Sci. 557 (2014) 59-65].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs.

[BibT_eX]

[DOI]

Yu-Sheng Huang

Sheng-Lung Peng

Ro-Yu Wu

J. Interconnect. Networks, 2016

Locally exchanged twisted cubes: Connectivity and super connectivity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Gray-Code Ranking and Unranking on Left-Weight Sequences of Binary Trees.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2014

A loopless algorithm for generating multiple binary tree sequences simultaneously.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Incidence coloring on hypercubes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Queue Layouts of Toroidal Grids.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

2013

Ranking and Unranking of Non-regular Trees in Gray-Code Order.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Ranking and Unranking <i>t</i>-ary Trees in a Gray-Code Order.

[BibT_eX]

[DOI]

Comput. J., 2013

2011

Amortized efficiency of generating planar paths in convex position.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Ranking and unranking of non-regular trees with a prescribed branching sequence.

[BibT_eX]

[DOI]

Ro-Yu Wu

Jou-Ming Chang

Chir-Ho Chang

Math. Comput. Model., 2011

Ranking and Unranking of <i>t</i>-Ary Trees Using RD-Sequences.

[BibT_eX]

[DOI]

Ro-Yu Wu

Jou-Ming Chang

Yue-Li Wang

IEICE Trans. Inf. Syst., 2011

2010

Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence.

[BibT_eX]

[DOI]

Ro-Yu Wu

Jou-Ming Chang

Yue-Li Wang

Comput. J., 2010

2009

On the diameter of geometric path graphs of points in convex position.

[BibT_eX]

[DOI]

Jou-Ming Chang

Ro-Yu Wu

Inf. Process. Lett., 2009

A Developed Restricted Rotation for Binary Trees Transformation.

[BibT_eX]

[DOI]

Ro-Yu Wu

Jou-Ming Chang

Chir-Ho Chang

Proceedings of the 9th International Conference on Hybrid Intelligent Systems (HIS 2009), 2009

2006

A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations.

[BibT_eX]

[DOI]

Ro-Yu Wu

Jou-Ming Chang

Yue-Li Wang

Theor. Comput. Sci., 2006

Ro-Yu Wu

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...