Ya-Chen Chen

According to our database, Ya-Chen Chen authored at least 11 papers between 2000 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2018

Development of Limited-Angle Iterative Reconstruction Algorithms with Context Encoder-Based Sinogram Completion for Micro-CT Applications.

Shih-Chun Jin, Chia-Jui Hsieh, Jyh-Cheng Chen, Shih-Huan Tu, Ya-Chen Chen, Tzu-Chien Hsiao, Angela Liu, Wen-Hsiang Chou, Woei-Chyn Chu, Chih-Wei Kuo

Sensors, 2018

Towards estimation of respiratory muscle effort with respiratory inductance plethysmography signals and complementary ensemble empirical mode decomposition.

Ya-Chen Chen, Tzu-Chien Hsiao

Medical Biol. Eng. Comput., 2018

2014

Minimum <i>K</i>_{2, 3}-Saturated Graphs.

Ya-Chen Chen

J. Graph Theory, 2014

Breathing Pattern Recognition of Abdominal Wall movement by using Ensemble Empirical mode Decomposition.

Ya-Chen Chen, Tzu-Chien Hsiao, Ju-Hsin Hsu, Jin-Long Chen

Adv. Data Sci. Adapt. Anal., 2014

2013

Recognizing thoracic breathing by ensemble empirical mode decomposition.

Jin-Long Chen, Ya-Chen Chen, Tzu-Chien Hsiao

Proceedings of the 9th International Conference on Information, 2013

2011

All minimum <i>C</i>₅-saturated graphs.

Ya-Chen Chen

J. Graph Theory, 2011

2009

Minimum <i>C</i>₅-saturated graphs.

Ya-Chen Chen

J. Graph Theory, 2009

2005

Minimum vertex-diameter-2-critical graphs.

Ya-Chen Chen, Zoltán Füredi

J. Graph Theory, 2005

2003

Triangle-free Hamiltonian Kneser graphs.

Ya-Chen Chen

J. Comb. Theory B, 2003

2002

Hamiltonian Kneser Graphs.

Ya-Chen Chen, Zoltán Füredi

Comb., 2002

2000

Kneser Graphs Are Hamiltonian For <i>n</i>ge<i>3k</i>.

Ya-Chen Chen

J. Comb. Theory B, 2000