Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts. - Yandong Bai; Binlong Li; Shenggui Zhang (Discret. Math., 2012)

Complementary cycles in regular bipartite tournaments. - Yandong Bai; Hao Li 002; Weihua He (Discret. Math., 2014)

Arc colorings and cycles in digraphs. (Colorations d'arc et cycles dans les graphes orientés). - Yandong Bai (2014)

Vertex-disjoint cycles in bipartite tournaments. - Yandong Bai; Binlong Li; Hao Li 002 (Discret. Math., 2015)

Vertex-distinguishing proper arc colorings of digraphs. - Hao Li 002; Yandong Bai; Weihua He; Qiang Sun 004 (Discret. Appl. Math., 2016)

Hamiltonian cycles in spanning subgraphs of line graphs. - Hao Li 002; Weihua He; Weihua Yang; Yandong Bai (Discret. Appl. Math., 2016)

Universal arcs in tournaments. - Yandong Bai; Binlong Li; Hao Li 002; Weihua He (Discret. Math., 2016)

A Note on Edge-Disjoint Hamilton Cycles in Line Graphs. - Hao Li 002; Weihua He; Weihua Yang; Yandong Bai (Graphs Comb., 2016)

A Distributed Proactive Service Framework for Crowd-Sensing Process. - Min Huang; Yandong Bai; Yinong Chen; Bo Sun (ISADS, 2017)

Kernels by properly colored paths in arc-colored digraphs. - Yandong Bai; Shinya Fujita 001; Shenggui Zhang (Discret. Math., 2018)

On splitting digraphs. - Donglei Yang; Yandong Bai; Guanghui Wang 002; Jianliang Wu 001 (Eur. J. Comb., 2018)

Safe sets in digraphs. - Yandong Bai; Jørgen Bang-Jensen; Shinya Fujita 001; Anders Yeo (CoRR, 2019)

On the Number of Vertex-Disjoint Cycles in Digraphs. - Yandong Bai; Yannis Manoussakis (SIAM J. Discret. Math., 2019)

Kernels by rainbow paths in arc-colored tournaments. - Yandong Bai; Binlong Li; Shenggui Zhang (Discret. Appl. Math., 2020)

Edge-Colored Complete Graphs Containing No Properly Colored Odd Cycles. - Tingting Han; Shenggui Zhang; Yandong Bai; Ruonan Li (Graphs Comb., 2021)

Rainbow Triangles in Arc-Colored Tournaments. - Wei Li; Shenggui Zhang; Yandong Bai; Ruonan Li (Graphs Comb., 2021)

Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs. - Tingting Han; Hajo Broersma; Yandong Bai; Shenggui Zhang (Discret. Appl. Math., 2023)

Connected k-factors in bipartite graphs. - Yandong Bai; Binlong Li (Discret. Math., 2023)

Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. - Yuhang Bai; Zhiwei Guo; Shenggui Zhang; Yandong Bai (J. Comb. Optim., 2023)

Properly colored cycles of different lengths in edge-colored complete graphs. - Tingting Han; Shenggui Zhang; Yandong Bai (Discret. Math., 2023)

Safe sets and in-dominating sets in digraphs. - Yandong Bai; Jørgen Bang-Jensen; Shinya Fujita 001; Hirotaka Ono 001; Anders Yeo (Discret. Appl. Math., 2024)

iMOVE : Instance-Motion-Aware Video Understanding. - Jiaze Li; Yaya Shi; Zongyang Ma; Haoran Xu; Yandong Bai; Huihui Xiao; Ruiwen Kang; Fan Yang 094; Tingting Gao; Di Zhang (ACL (Findings), 2025)

Who You Are Matters: Bridging Topics and Social Roles via LLM-Enhanced Logical Recommendation. - Qing Yu; Xiaobei Wang; Shuchang Liu 006; Yandong Bai; Xiaoyu Yang; Xueliang Wang; Chang Meng; Shanshan Wu; Hailan Yang; Huihui Xiao; Xiang Li; Fan Yang 094; et al. (CoRR, 2025)