Chao Yang

According to our database, Chao Yang authored at least 30 papers between 2006 and 2026.

Collaborative distances:

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

2026

Translational Tiling with 8 Polyominoes is Undecidable.

Chao Yang, Zhujun Zhang

Discret. Comput. Geom., June, 2026

King Chasing Problem in Chinese Chess is NP-hard.

Chao Li, Zhujun Zhang, Chao Yang

CoRR, April, 2026

2025

Undecidability of Translational Tiling of the Plane with Four Tiles.

Chao Yang, Zhujun Zhang

CoRR, June, 2025

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes.

Chao Yang, Zhujun Zhang

CoRR, June, 2025

1-PushingMachine is PSPACE-complete.

Chao Yang, Zhujun Zhang

J. Inf. Process., 2025

M_ODIFY is PSPACE-complete.

Chao Yang, Zhujun Zhang

J. Inf. Process., 2025

Friends-and-strangers is PSPACE-complete.

Chao Yang, Zhujun Zhang

Inf. Process. Lett., 2025

2024

Translational Aperiodic Sets of 7 Polyominoes.

Chao Yang, Zhujun Zhang

CoRR, 2024

Undecidability of Translational Tiling of the 4-dimensional Space with a Set of 4 Polyhypercubes.

Chao Yang, Zhujun Zhang

CoRR, 2024

Undecidability of Translational Tiling of the 3-dimensional Space with a Set of 6 Polycubes.

Chao Yang, Zhujun Zhang

CoRR, 2024

NP-completeness of Tiling Finite Simply Connected Regions with a Fixed Set of Wang Tiles.

Chao Yang, Zhujun Zhang

CoRR, 2024

Undecidability of tiling the plane with a fixed number of Wang bars.

Chao Yang, Zhujun Zhang

CoRR, 2024

A proof of Ollinger's conjecture: undecidability of tiling the plane with a set of 8 polyominoes.

Chao Yang, Zhujun Zhang

CoRR, 2024

Atropos-k is PSPACE-complete.

Chao Yang, Zhujun Zhang

CoRR, 2024

2023

Tiling the Plane with a Set of Ten Polyominoes.

Chao Yang

Int. J. Comput. Geom. Appl., 2023

2022

The Spectral Distribution of Random Mixed Graphs.

Yue Guan, Bo Cheng, Minfeng Chen, Meili Liang, Jianxi Liu, Jinxun Wang, Chao Yang, Li Zeng

Axioms, 2022

On the Computational Complexity of Pushing Machine.

Chao Yang

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2022

2019

Hanano Puzzle is NP-hard.

Ziwen Liu, Chao Yang

Inf. Process. Lett., 2019

Unified extremal results of topological indices and spectral invariants of graphs.

Yuedan Yao, Muhuo Liu, Francesco Belardo, Chao Yang

Discret. Appl. Math., 2019

2018

On the Complexity of Jelly-no-Puzzle.

Chao Yang

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

2017

Snowman is PSPACE-complete.

Weihua He, Ziwen Liu, Chao Yang

Theor. Comput. Sci., 2017

2013

Connectivity of lexicographic product and direct product of graphs.

Chao Yang, Jun-Ming Xu

Ars Comb., 2013

2011

Sliding puzzles and rotating puzzles on graphs.

Chao Yang

Discret. Math., 2011

2010

Connectivity and super-connectivity of Cartesian product graphs.

Jun-Ming Xu, Chao Yang

Ars Comb., 2010

2009

Diameter vulnerability of graphs by edge deletion.

He-Xi Ye, Chao Yang, Jun-Ming Xu

Discret. Math., 2009

Forwarding index of cube-connected cycles.

Jun Yan, Jun-Ming Xu, Chao Yang

Discret. Appl. Math., 2009

2008

Reliability of interconnection networks modeled by Cartesian product digraphs.

Chao Yang, Jun-Ming Xu

Networks, 2008

2007

Fault diameter of product graphs.

Jun-Ming Xu, Chao Yang

Inf. Process. Lett., 2007

Feedback numbers of Kautz digraphs.

Jun-Ming Xu, Yezhou Wu, Jia Huang, Chao Yang

Discret. Math., 2007

2006

Connectivity of Cartesian product graphs.

Jun-Ming Xu, Chao Yang

Discret. Math., 2006