Wenan Zang

	2009
45		Xujin Chen, Guoli Ding, Wenan Zang: The box-TDI system associated with 2-edge connected spanning subgraphs. Discrete Applied Mathematics 157(1): 118-125 (2009)
	2008
44		Xujin Chen, Guoli Ding, Wenan Zang: A Characterization of Box-Mengerian Matroid Ports. Math. Oper. Res. 33(2): 497-512 (2008)
43		Guoli Ding, Li Feng, Wenan Zang: The complexity of recognizing linear systems with certain integrality properties. Math. Program. 114(2): 321-334 (2008)
42		Rong Luo, Rui Xu, Wenan Zang, Cun-Quan Zhang: Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows. SIAM J. Discrete Math. 22(2): 500-519 (2008)
	2007
41		Xujin Chen, Xiaodong Hu, Wenan Zang: A Min-Max Theorem on Tournaments. SIAM J. Comput. 37(3): 923-937 (2007)
	2006
40		Xujin Chen, Wenan Zang: An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. Algorithmica 44(3): 195-211 (2006)
39		Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang: The circumference of a graph with no K3, t-minor. J. Comb. Theory, Ser. B 96(6): 822-845 (2006)
38		Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang: A Min-Max Relation on Packing Feedback Vertex Sets. Math. Oper. Res. 31(4): 777-788 (2006)
37		Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang: Approximating Longest Cycles in Graphs with Bounded Degrees. SIAM J. Comput. 36(3): 635-656 (2006)
36		Yusheng Li, Wenan Zang: Differential Methods for Finding Independent Sets in Hypergraphs. SIAM J. Discrete Math. 20(1): 96-104 (2006)
	2005
35		Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang: Approximating the Longest Cycle Problem on Graphs with Bounded Degree. COCOON 2005: 870-884
34		Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang: A Min-Max Relation on Packing Feedback Vertex Sets. ISAAC 2005: 126-135
33		Yusheng Li, Xueqing Tang, Wenan Zang: Ramsey functions involving Km, n with n large. Discrete Mathematics 300(1-3): 120-128 (2005)
32		Xujin Chen, Zhiquan Hu, Wenan Zang: Perfect Circular Arc Coloring. J. Comb. Optim. 9(3): 267-280 (2005)
31		Xueliang Li, Wenan Zang: A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. J. Comb. Optim. 9(4): 331-347 (2005)
30		Robin Thomas, Xingxing Yu, Wenan Zang: Hamilton paths in toroidal graphs. J. Comb. Theory, Ser. B 94(2): 214-236 (2005)
29		Xiaotie Deng, Guojun Li, Wenan Zang: Corrigendum to Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs: [J. Combin. Theory Ser. B 91 (2004) 301-325]. J. Comb. Theory, Ser. B 94(2): 352-353 (2005)
	2004
28		Xujin Chen, Wenan Zang: An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. ISAAC 2004: 306-317
27		Yusheng Li, Cecil C. Rousseau, Wenan Zang: An upper bound for ramsey numbers. Appl. Math. Lett. 17(6): 663-665 (2004)
26		Rong Luo, Wenan Zang, Cun-Quan Zhang: Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. Combinatorica 24(4): 641-657 (2004)
25		Guizhen Liu, Wenan Zang: f-Factors in bipartite (mf)-graphs. Discrete Applied Mathematics 136(1): 45-54 (2004)
24		Bo Chen, Xiaotie Deng, Wenan Zang: On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. J. Comb. Optim. 8(1): 85-95 (2004)
23		Xiaotie Deng, Guojun Li, Wenan Zang: Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs. J. Comb. Theory, Ser. B 91(2): 301-325 (2004)
	2003
22		Xiaotie Deng, Guojun Li, Wenan Zang, Yi Zhou: A 2-approximation algorithm for path coloring on a restricted class of trees of rings. J. Algorithms 47(1): 1-13 (2003)
21		Yusheng Li, Wenan Zang: The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers. J. Comb. Optim. 7(4): 353-359 (2003)
20		Guoli Ding, Zhenzhen Xu, Wenan Zang: Packing cycles in graphs, II. J. Comb. Theory, Ser. B 87(2): 244-253 (2003)
19		Yusheng Li, Wenan Zang: Ramsey numbers involving large dense graphs and bipartite Turán numbers. J. Comb. Theory, Ser. B 87(2): 280-288 (2003)
	2002
18		Frank K. Hwang, Wenan Zang: Group testing and fault detection for replicated files. Discrete Applied Mathematics 116(3): 231-242 (2002)
17		Guoli Ding, Wenan Zang: Packing Cycles in Graphs. J. Comb. Theory, Ser. B 86(2): 381-407 (2002)
16		Mao-cheng Cai, Xiaotie Deng, Wenan Zang: A Min-Max Theorem on Feedback Vertex Sets. Math. Oper. Res. 27(2): 361-371 (2002)
	2001
15		Bo Chen, Xiaotie Deng, Wenan Zang: On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. ISAAC 2001: 380-389
14		Yusheng Li, Cecil C. Rousseau, Wenan Zang: Asymptotic Upper Bounds for Ramsey Functions. Graphs and Combinatorics 17(1): 123-128 (2001)
	2000
13		Xiaotie Deng, Yi Zhou, Guojun Li, Wenan Zang: A 2-Approximation Algorithm for Path Coloring on Trees of Rings. ISAAC 2000: 144-155
12		Mao-cheng Cai, Xiaotie Deng, Wenan Zang: Solution to a problem on degree sequences of graphs. Discrete Mathematics 219(1-3): 253-257 (2000)
11		Xiaotie Deng, Guojun Li, Wenan Zang: Wavelength allocation on trees of rings. Networks 35(4): 248-252 (2000)
10		Mao-cheng Cai, Xiaotie Deng, Wenan Zang: An Approximation Algorithm for Feedback Vertex Sets in Tournaments. SIAM J. Comput. 30(6): 1993-2007 (2000)
	1999
9		Mao-cheng Cai, Xiaotie Deng, Wenan Zang: A Min-Max Theorem on Feedback Vertex Sets. IPCO 1999: 73-86
8		Wenan Zang: Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers. Discrete Mathematics 199(1-3): 183-192 (1999)
	1998
7		Wenan Zang: Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. COCOON 1998: 261-268
6		Mao-cheng Cai, Xiaotie Deng, Wenan Zang: A TDI System and its Application to Approximation Algorithms. FOCS 1998: 227-243
5		Wenan Zang: Coloring graphs with no odd-K4. Discrete Mathematics 184(1-3): 205-212 (1998)
4		Wenan Zang: Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable. J. Comb. Optim. 2(2): 117-188 (1998)
	1997
3		Frank K. Hwang, Wenan Zang: Detecting Corrupted Pages in M Replicated Large Files. IEEE Trans. Parallel Distrib. Syst. 8(12): 1241-1245 (1997)
	1995
2		Wenan Zang: Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs. Discrete Mathematics 143(1-3): 259-268 (1995)
	1991
1		Feng Tian, Wenan Zang: The maximum number of diagonals of a cycle in a block and its extremal graphs. Discrete Mathematics 89(1): 51-63 (1991)

Coauthor Index

1	Mao-cheng Cai	[6] [9] [10] [12] [16]
2	Bo Chen	[15] [24]
3	Guantao Chen	[35] [37] [39]
4	Xujin Chen	[28] [32] [34] [38] [40] [41] [44] [45]
5	Xiaotie Deng	[6] [9] [10] [11] [12] [13] [15] [16] [22] [23] [24] [29]
6	Guoli Ding	[17] [20] [34] [38] [43] [44] [45]
7	Li Feng	[43]
8	Zhicheng Gao	[35] [37]
9	Xiao-Dong Hu (Xiaodong Hu)	[34] [38] [41]
10	Zhiquan Hu	[32]
11	Frank K. Hwang (Frank Kwang-Ming Hwang)	[3] [18]
12	Guojun Li	[11] [13] [22] [23] [29]
13	Xueliang Li	[31]
14	Yusheng Li	[14] [19] [21] [27] [33] [36]
15	Guizhen Liu	[25]
16	Rong Luo	[26] [42]
17	Cecil C. Rousseau	[14] [27]
18	Laura Sheppardson	[39]
19	Xueqing Tang	[33]
20	Robin Thomas	[30]
21	Feng Tian	[1]
22	Rui Xu	[42]
23	Zhenzhen Xu	[20]
24	Xingxing Yu	[30] [35] [37] [39]
25	Cun-Quan Zhang	[26] [42]
26	Yi Zhou	[13] [22]

Colors in the list of coauthors