Routing Numbers of Cycles, Complete Bipartite Graphs, and Hypercubes. - Wei-Tian Li; Linyuan Lu; Yiting Yang (SIAM J. Discret. Math., 2010)

Diamond-free families. - Jerrold R. Griggs; Wei-Tian Li; Linyuan Lu (J. Comb. Theory A, 2012)

Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set. - Wei-Tian Li; Bor-Liang Chen; Kuo-Ching Huang; Ko-Wei Lih (Electron. J. Comb., 2013)

The partition method for poset-free families. - Jerrold R. Griggs; Wei-Tian Li (J. Comb. Optim., 2013)

A Note on the Largest Size of Families of Sets with a Forbidden Poset. - Hong-Bin Chen; Wei-Tian Li (Order, 2014)

Poset-free families and Lubell-boundedness. - Jerrold R. Griggs; Wei-Tian Li (J. Comb. Theory A, 2015)

Families of Subsets Without a Given Poset in Double Chains and Boolean Lattices. - Jun-Yi Guo; Fei-Huang Chang; Hong-Bin Chen; Wei-Tian Li (Order, 2018)

Some Remarks on Nestings in the Normalized Matching Posets of Rank 3. - Yu-Lun Chang; Wei-Tian Li (Order, 2019)

The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets and Chains. - Hong-Bin Chen; Yen-Jen Cheng; Wei-Tian Li; Chia-An Liu (Electron. J. Comb., 2020)

Shifted-Antimagic Labelings for Graphs. - Fei-Huang Chang; Hong-Bin Chen; Wei-Tian Li; Zhishi Pan (Graphs Comb., 2021)

Antimagic labeling of forests with sets of consecutive integers. - Eranda Dhananjaya; Wei-Tian Li (Discret. Appl. Math., 2022)

Rainbow Ramsey Problems for the Boolean Lattice. - Fei-Huang Chang; Dániel Gerbner; Wei-Tian Li; Abhishek Methuku; Dániel T. Nagy; Balázs Patkós; Máté Vizer (Order, 2022)

On k-shifted antimagic spider forests. - Fei-Huang Chang; Wei-Tian Li; Daphne Der-Fen Liu; Zhishi Pan (Discret. Appl. Math., 2024)

Ramsey properties for V-shaped posets in the Boolean lattice. - Hong-Bin Chen; Wei-Han Chen; Yen-Jen Cheng; Wei-Tian Li; Chia-An Liu (Discret. Math., 2024)

Antimagic labeling for subdivisions of graphs. - Wei-Tian Li (Discret. Appl. Math., 2025)