Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs. - William Y. C. Chen; Xueliang Li 001; Chao Wang 020; Xiaoyan Zhang 001 (Electron. Notes Discret. Math., 2004)

The Minimum All-Ones Problem for Trees. - William Y. C. Chen; Xueliang Li 001; Chao Wang 020; Xiaoyan Zhang 001 (SIAM J. Comput., 2004)

The general sigma all-ones problem for trees. - Xueliang Li 001; Chao Wang 020; Xiaoyan Zhang 001 (Discret. Appl. Math., 2008)

Note on the degree sequences of k-hypertournaments. - Chao Wang 020; Guofei Zhou (Discret. Math., 2008)

Reversibility of general 1D linear cellular automata over the binary field Z2 under null boundary conditions. - Bin Yang 007; Chao Wang 020; Aiyun Xiang (Inf. Sci., 2015)

Perception-based energy functions in seam-cutting. - Nan Li 013; Tianli Liao; Chao Wang 020 (CoRR, 2017)

Perception-based seam cutting for image stitching. - Nan Li 013; Tianli Liao; Chao Wang 020 (Signal Image Video Process., 2018)

Quasi-Homography Warps in Image Stitching. - Nan Li 013; Yifang Xu; Chao Wang 020 (IEEE Trans. Multim., 2018)

Solutions to All-Colors Problem on Graph Cellular Automata. - Xiaoyan Zhang 001; Chao Wang 020 (Complex., 2019)

Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity. - Xinyu Du; Chao Wang 020; Tianze Wang; Zeyu Gao (CoRR, 2019)

Low Light Image Enhancement Algorithm Based on Retinex and Dehazing Model. - Zijun Guo; Chao Wang 020 (ICRAI, 2020)

The r-Hamming gap and distance-gap-preserving mappings from binary vectors to permutations. - Chao Wang 020; Hua Wang 003; Yuzhi Zhang (Appl. Math. Comput., 2020)

A Novel Low-light Image Enhancement Algorithm Based On Information Assistance. - Jiacen Guo; Xin Jin; Weilin Chen; Chao Wang 020 (ICPR, 2022)

Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over Zp. - Xinyu Du; Chao Wang 020; Tianze Wang; Zeyu Gao (Inf. Sci., 2022)

STATE-OF-ART Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Cellular Automata. - Chen Wang 051; Junchi Ma; Defu Lin; Weilin Chen 006; Chao Wang 020 (CoRR, 2023)

Patterns Induce Injectivity: A New Thinking in Constructing Injective Local Rules of 1D Cellular Automata over F2. - Defu Lin; Weilin Chen 006; Chen Wang 051; Junchi Ma; Chao Wang 020 (CoRR, 2023)

The Computation for Reversibility of Arbitrary One-dimensional Finite Cellular Automata Becomes Efficient. - Chen Wang 051; Junchi Ma; Chao Wang 020; Defu Lin; Weilin Chen 006 (CoRR, 2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs. - Chen Wang 051; Chao Wang 020; Gregory Z. Gutin; Xiaoyan Zhang 001 (CoRR, 2024)

Decision algorithms for reversibility of one-dimensional non-linear cellular automata under null boundary conditions. - Junchi Ma; Weilin Chen 006; Chen Wang 051; Defu Lin; Chao Wang 020 (CoRR, 2024)

Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions. - Junchi Ma; Chen Wang 051; Weilin Chen 006; Defu Lin; Chao Wang 020 (Theor. Comput. Sci., 2024)

Two graphs: Resolving the periodic reversibility of one-dimensional finite cellular automata. - Chen Wang 051; Junchi Ma; Chao Wang 020; Defu Lin; Weilin Chen 006 (Appl. Math. Comput., 2025)