Circulant digraphs determined by their spectra. - Qiongxiang Huang; An Chang (Discret. Math., 2001)

On the largest eigenvalue of a tree with perfect matchings. - An Chang (Discret. Math., 2003)

On the kth Eigenvalues of Trees with Perfect Matchings. - Wai Chee Shiu; An Chang (Discret. Math. Theor. Comput. Sci., 2007)

The number of spanning trees of a graph. - Jianxi Li; Wai Chee Shiu; An Chang (Appl. Math. Lett., 2010)

On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph. - Jinshan Xie; An Chang (Numer. Linear Algebra Appl., 2013)

An edge-separating theorem on the second smallest normalized Laplacian eigenvalue of a graph and its applications. - Jianxi Li; Ji-Ming Guo; Wai Chee Shiu; An Chang (Discret. Appl. Math., 2014)

Effects of free gifts with purchase on online purchase satisfaction: The moderating role of uncertainty. - Dong-Hong Zhu; Ya-Ping Chang; An Chang (Internet Res., 2015)

Spectral determination of a class of tricyclic graphs. - Bo Deng; An Chang; Haixing Zhao (Ars Comb., 2017)

The higher Balaban index on weighted matrix. - Bo Deng; An Chang (Ars Comb., 2018)

The leaf-free graphs with nullity 2c(G)-1. - Sarula Chang; An Chang; Yirong Zheng (Discret. Appl. Math., 2020)

Seeing Through the Occluders: Robust Monocular 6-DOF Object Pose Tracking via Model-Guided Video Object Segmentation. - Leisheng Zhong; Yu Zhang 026; Hao Zhao 002; An Chang; Wenhao Xiang; Shunli Zhang; Li Zhang 023 (IEEE Robotics Autom. Lett., 2020)

Diameter Three Orientability of Bipartite Graphs. - Bin Chen 020; An Chang (Electron. J. Comb., 2021)

Spectral Extremal Results for Hypergraphs. - Yuan Hou; An Chang; Joshua Cooper 002 (Electron. J. Comb., 2021)

A linear hypergraph extension of the bipartite Turán problem. - Guorong Gao; An Chang (Eur. J. Comb., 2021)

3-Free Strong Digraphs with the Maximum Size. - Bin Chen 020; An Chang (Graphs Comb., 2021)

A Linear Hypergraph Extension of Turán's Theorem. - Guorong Gao; An Chang (Electron. J. Comb., 2022)

Turán number of 3-free strong digraphs with out-degree restriction. - Bin Chen 020; An Chang (Discret. Appl. Math., 2022)

Detecting prohibited objects with physical size constraint from cluttered X-ray baggage images. - An Chang; Yu Zhang 026; Shunli Zhang; Leisheng Zhong; Li Zhang 023 (Knowl. Based Syst., 2022)

Spectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$. - Guorong Gao; An Chang; Yuan Hou (SIAM J. Discret. Math., 2022)

Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs. - Guorong Gao; An Chang; Qi Sun (Discret. Math., 2023)

Measuring distance from lowest boundary of rectal tumor to anal verge on CT images using pyramid attention pooling transformer. - Jianjun Shen; Siyi Lu; Ruize Qu; Hao Zhao 002; Yu Zhang 026; An Chang; Li Zhang 023; Wei Fu; Zhipeng Zhang (Comput. Biol. Medicine, 2023)

Oriented diameter of graphs with given girth and maximum degree. - Bin Chen 020; An Chang (Discret. Math., 2023)

A boundary-guided transformer for measuring distance from rectal tumor to anal verge on magnetic resonance images. - Jianjun Shen; Siyi Lu; Ruize Qu; Hao Zhao 002; Li Zhang 023; An Chang; Yu Zhang 026; Wei Fu; Zhipeng Zhang (Patterns, 2023)

A note on Seymour's second neighborhood conjecture. - Bin Chen 020; An Chang (Discret. Appl. Math., 2023)

Source-Free Domain Adaptation via Target Prediction Distribution Searching. - Song Tang 001; An Chang; Fabian Zhang; Xiatian Zhu; Mao Ye 001; Changshui Zhang (Int. J. Comput. Vis., 2024)

Disjoint cycles in tournaments and bipartite tournaments. - Bin Chen 020; An Chang (J. Graph Theory, 2024)