Maximal IM-unextendable graphs. - Qin Wang 001; Jinjiang Yuan (Discret. Math., 2001)

Partition the vertices of a graph into induced matchings. - Jinjiang Yuan; Qin Wang 001 (Discret. Math., 2003)

4-regular claw-free IM-extendable graphs. - Qin Wang 001; Jinjiang Yuan (Discret. Math., 2005)

An inverse model for the most uniform problem. - Qin Wang 001; Jinjiang Yuan; Jianzhong Zhang 001 (Oper. Res. Lett., 2008)

Degree conditions of nearly induced matching extendable graphs. - Longshu Wu; Qin Wang 001 (Contributions Discret. Math., 2021)

General restricted inverse assignment problems under l1 and l∞ norms. - Qin Wang 001; Tianyu Yang; Longshu Wu (J. Comb. Optim., 2022)