Chiuyuan Chen

Orcid: 0000-0002-3716-3810

According to our database1, Chiuyuan Chen authored at least 36 papers between 1987 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Receiver-Initiated Data Collection in Wake-Up Radio Enabled mIoT Networks: Achieving Collision-Free Transmissions by Hashing and Partitioning.
IEEE Trans. Green Commun. Netw., 2021

2020
An Effective Sensor Deployment Scheme that Ensures Multilevel Coverage of Wireless Sensor Networks with Uncertain Properties.
Sensors, 2020

Achieving Ultra Energy-efficient and Collision-free Data Collection in Wake-up Radio Enabled mIoT.
Proceedings of the 2020 IEEE International Conference on Communications, 2020

2019
Mutual transferability for (F, B, R)-domination on strongly chordal graphs and cactus graphs.
Discret. Appl. Math., 2019

2018
A Suggestion of a New Measure of Importance of Nodes in Disease-propagation Graphs.
Proceedings of the 2nd High Performance Computing and Cluster Technologies Conference, 2018

Sensor Deployment under Probabilistic Sensing Model.
Proceedings of the 2nd High Performance Computing and Cluster Technologies Conference, 2018

2017
Optimal coloring for data collection in tree-based wireless sensor networks.
Theor. Comput. Sci., 2017

2014
A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon.
Inf. Process. Lett., 2014

2013
Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2011
Constructing independent spanning trees for locally twisted cubes.
Theor. Comput. Sci., 2011

2010
All-to-all personalized exchange in generalized shuffle-exchange networks.
Theor. Comput. Sci., 2010

2009
Improved upper and lower bounds on the optimization of mixed chordal ring networks.
Inf. Process. Lett., 2009

Efficient Routing Algorithms for Generalized Shuffle-Exchange Networks.
Discret. Math. Algorithms Appl., 2009

Constructing Independent Spanning Trees for Hypercubes and Locally Twisted Cubes.
Proceedings of the 10th International Symposium on Pervasive Systems, 2009

All-to-All Personalized Exchange Algorithms in Generalized Shuffle-Exchange Networks.
Proceedings of the Eighth International Conference on Networks, 2009

2007
Optimal all-to-all personalized exchange in <i>d</i> -nary banyan multistage interconnection networks.
J. Comb. Optim., 2007

Node-pancyclicity and edge-pancyclicity of hypercube variants.
Inf. Process. Lett., 2007

2006
An efficient algorithm to find a double-loop network that realizes a given L-shape.
Theor. Comput. Sci., 2006

On Degenerate Double-loop L-shapes.
J. Interconnect. Networks, 2006

An efficient tag-based routing algorithm for the backward network of a bidirectional general shuffle-exchange network.
IEEE Commun. Lett., 2006

On the existence of hyper-L triple-loop networks.
Discret. Math., 2006

2005
Equivalence of buddy networks with arbitrary number of stages.
Networks, 2005

2004
Vertex and Tree Arboricities of Graphs.
J. Comb. Optim., 2004

2003
Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian.
J. Comb. Optim., 2003

The existence of hyper-L triple-loop networks.
Discret. Math., 2003

2002
A necessary condition for a graph to be the visibility graph of a simple polygon.
Theor. Comput. Sci., 2002

A simple algorithm to find the steps of double-loop networks.
Discret. Appl. Math., 2002

2001
Disproving a conjecture on planar visibility graphs.
Theor. Comput. Sci., 2001

2000
The Minimum Distance Diagram of Double-Loop Networks.
IEEE Trans. Computers, 2000

Equivalent L-Shapes of Double-Loop Networks for the Degenerate Case.
J. Interconnect. Networks, 2000

Supermodularity in Various Partition Problems.
J. Glob. Optim., 2000

1997
Proper interval graphs and the guard problem.
Discret. Math., 1997

1995
Connected Proper Interval Graphs and the Guard Problem in Spiral Polygons.
Proceedings of the Combinatorics and Computer Science, 1995

1994
Planar Visibility Graphs.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1990
On the Minimality of Polygon Triangualtion.
BIT, 1990

1987
A class of additive multiplicative graph functions.
Discret. Math., 1987


  Loading...