Wenan Zang

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 9

Top Topics

Structural Descriptions

Top Venues

J. Comb. Theory, Ser. B

Math. Oper. Res.

SIAM J. Discret. Math.

Publications

Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao
Packing Feedback Arc Sets in Tournaments Exactly. Math. Oper. Res. 49 (1) (2024)
Yan Cao, Guantao Chen, Guoli Ding, Guangming Jing, Wenan Zang
On Gupta's Codensity Conjecture. SIAM J. Discret. Math. 37 (3) (2023)
Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao
Ranking tournaments with no errors I: Structural description. J. Comb. Theory, Ser. B 141 (2020)
Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao
Ranking tournaments with no errors II: Minimax relation. J. Comb. Theory, Ser. B 142 (2020)
Xujin Chen, Wenan Zang, Qiulan Zhao
Densities, Matchings, and Fractional Edge-Colorings. SIAM J. Optim. 29 (1) (2019)
Guoli Ding, Lei Tan, Wenan Zang
When Is the Matching Polytope Box-Totally Dual Integral? Math. Oper. Res. 43 (1) (2018)
Guoli Ding, Wenan Zang, Qiulan Zhao
On box-perfect graphs. J. Comb. Theory, Ser. B 128 (2018)
Qin Chen, Xujin Chen, Wenan Zang
A Polyhedral Description of Kernels. Math. Oper. Res. 41 (3) (2016)
Zhibin Chen, Jie Ma, Wenan Zang
Coloring digraphs with forbidden cycles. J. Comb. Theory, Ser. B 115 (2015)
Yezhou Wu, Dong Ye, Wenan Zang, Cun-Quan Zhang
Nowhere-Zero 3-Flows in Signed Graphs. SIAM J. Discret. Math. 28 (3) (2014)
Jie Ma, Xingxing Yu, Wenan Zang
Approximate min-max relations on plane graphs. J. Comb. Optim. 26 (1) (2013)
Zhiquan Hu, Ka Ho Law, Wenan Zang
An Optimal Binding Number Condition for Bipancyclism. SIAM J. Discret. Math. 27 (2) (2013)
Guantao Chen, Xingxing Yu, Wenan Zang
-minor, II. J. Comb. Theory, Ser. B 102 (6) (2012)
Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang
Bonds with parity constraints. J. Comb. Theory, Ser. B 102 (3) (2012)
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
The Maximum-Weight Stable Matching Problem: Duality and Efficiency. SIAM J. Discret. Math. 26 (3) (2012)
Xujin Chen, Zhibin Chen, Wenan Zang
Total Dual Integrality in Some Facility Location Problems. SIAM J. Discret. Math. 26 (3) (2012)
Guantao Chen, Xingxing Yu, Wenan Zang
Approximating the chromatic index of multigraphs. J. Comb. Optim. 21 (2) (2011)
Xujin Chen, Zhibin Chen, Wenan Zang
A Unified Approach to Box-Mengerian Hypergraphs. Math. Oper. Res. 35 (3) (2010)
Xujin Chen, Guoli Ding, Wenan Zang
The box-TDI system associated with 2-edge connected spanning subgraphs. Discret. Appl. Math. 157 (1) (2009)
Guoli Ding, Wenan Zang
Packing circuits in matroids. Math. Program. 119 (1) (2009)
Yezhou Wu, Wenan Zang, Cun-Quan Zhang
A Characterization of Almost CIS Graphs. SIAM J. Discret. Math. 23 (2) (2009)
Guantao Chen, Xingxing Yu, Wenan Zang
Preface. Discret. Math. 309 (5) (2009)
Zhibin Chen, Wenan Zang
's in stability critical graphs. Discret. Math. 309 (20) (2009)
Rong Luo, Rui Xu, Wenan Zang, Cun-Quan Zhang
Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows. SIAM J. Discret. Math. 22 (2) (2008)
Guoli Ding, Li Feng, Wenan Zang
The complexity of recognizing linear systems with certain integrality properties. Math. Program. 114 (2) (2008)
Xujin Chen, Guoli Ding, Wenan Zang
A Characterization of Box-Mengerian Matroid Ports. Math. Oper. Res. 33 (2) (2008)
Xujin Chen, Xiaodong Hu, Wenan Zang
A Min-Max Theorem on Tournaments. SIAM J. Comput. 37 (3) (2007)
Yusheng Li, Wenan Zang
Differential Methods for Finding Independent Sets in Hypergraphs. SIAM J. Discret. Math. 20 (1) (2006)
Xujin Chen, Wenan Zang
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. Algorithmica 44 (3) (2006)
Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
Approximating Longest Cycles in Graphs with Bounded Degrees. SIAM J. Comput. 36 (3) (2006)
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
A Min-Max Relation on Packing Feedback Vertex Sets. Math. Oper. Res. 31 (4) (2006)
Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang
-minor. J. Comb. Theory, Ser. B 96 (6) (2006)
Xujin Chen, Zhiquan Hu, Wenan Zang
Perfect Circular Arc Coloring. J. Comb. Optim. 9 (3) (2005)
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) (2005)
Yusheng Li, Xueqing Tang, Wenan Zang
large. Discret. Math. 300 (1-3) (2005)
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
A Min-Max Relation on Packing Feedback Vertex Sets. ISAAC (2005)
Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
Approximating the Longest Cycle Problem on Graphs with Bounded Degree. COCOON (2005)
Xueliang Li, Wenan Zang
A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. J. Comb. Optim. 9 (4) (2005)
Robin Thomas, Xingxing Yu, Wenan Zang
Hamilton paths in toroidal graphs. J. Comb. Theory, Ser. B 94 (2) (2005)
Guizhen Liu, Wenan Zang
f-Factors in bipartite (mf)-graphs. Discret. Appl. Math. 136 (1) (2004)
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) (2004)
Rong Luo, Wenan Zang, Cun-Quan Zhang
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. Comb. 24 (4) (2004)
Yusheng Li, Cecil C. Rousseau, Wenan Zang
An upper bound for ramsey numbers. Appl. Math. Lett. 17 (6) (2004)
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) (2004)
Xujin Chen, Wenan Zang
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. ISAAC (2004)
Yusheng Li, Wenan Zang
The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers. J. Comb. Optim. 7 (4) (2003)
Yusheng Li, Wenan Zang
Ramsey numbers involving large dense graphs and bipartite Turán numbers. J. Comb. Theory, Ser. B 87 (2) (2003)
Guoli Ding, Zhenzhen Xu, Wenan Zang
Packing cycles in graphs, II. J. Comb. Theory, Ser. B 87 (2) (2003)
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) (2003)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
A Min-Max Theorem on Feedback Vertex Sets. Math. Oper. Res. 27 (2) (2002)
Guoli Ding, Wenan Zang
Packing Cycles in Graphs. J. Comb. Theory, Ser. B 86 (2) (2002)
Frank K. Hwang, Wenan Zang
Group testing and fault detection for replicated files. Discret. Appl. Math. 116 (3) (2002)
Bo Chen, Xiaotie Deng, Wenan Zang
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. ISAAC (2001)
Yusheng Li, Cecil C. Rousseau, Wenan Zang
Asymptotic Upper Bounds for Ramsey Functions. Graphs Comb. 17 (1) (2001)
Xiaotie Deng, Yi Zhou, Guojun Li, Wenan Zang
A 2-Approximation Algorithm for Path Coloring on Trees of Rings. ISAAC (2000)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
Solution to a problem on degree sequences of graphs. Discret. Math. 219 (1-3) (2000)
Xiaotie Deng, Guojun Li, Wenan Zang
Wavelength allocation on trees of rings. Networks 35 (4) (2000)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
An Approximation Algorithm for Feedback Vertex Sets in Tournaments. SIAM J. Comput. 30 (6) (2000)
Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang
Totally balanced combinatorial optimization games. Math. Program. 87 (3) (2000)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
A Min-Max Theorem on Feedback Vertex Sets. IPCO (1999)
Wenan Zang
Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers. Discret. Math. 199 (1-3) (1999)
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
A TDI System and its Application to Approximation Algorithms. FOCS (1998)
Wenan Zang
Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable. J. Comb. Optim. 2 (2) (1998)
Wenan Zang
. Discret. Math. 184 (1-3) (1998)
Wenan Zang
Is 3-Colorable. COCOON (1998)
Frank K. Hwang, Wenan Zang
Replicated Large Files. IEEE Trans. Parallel Distributed Syst. 8 (12) (1997)
Wenan Zang
Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs. Discret. Math. 143 (1-3) (1995)
Feng Tian, Wenan Zang
The maximum number of diagonals of a cycle in a block and its extremal graphs. Discret. Math. 89 (1) (1991)