The complexity of recognizing linear systems with certain integrality properties von Ding, Guoli, Feng, Li, Zang, Wenan

Volltext

Approximating the chromatic index of multigraphs von Chen, Guantao, Yu, Xingxing, Zang, Wenan

Volltext

The Maximum-Weight Stable Matching Problem: Duality and Efficiency von Chen, Xujin, Ding, Guoli, Hu, Xiaodong, Zang, Wenan

Volltext

Packing circuits in matroids von Ding, Guoli, Zang, Wenan

Volltext

Packing Feedback Arc Sets in Tournaments Exactly von Chen, Xujin, Ding, Guoli, Zang, Wenan, Zhao, Qiulan

Volltext

Odd-K4's in stability critical graphs von ZHIBIN CHEN, WENAN ZANG

Volltext

Densities, Matchings, and Fractional Edge-Colorings von Chen, Xujin, Zang, Wenan, Zhao, Qiulan

Volltext

The box-TDI system associated with 2-edge connected spanning subgraphs von Chen, Xujin, Ding, Guoli, Zang, Wenan

Volltext

On Gupta’s Codensity Conjecture von Cao, Yan, Chen, Guantao, Ding, Guoli, Jing, Guangming, Zang, Wenan

Volltext

When Is the Matching Polytope Box-Totally Dual Integral? von Ding, Guoli, Tan, Lei, Zang, Wenan

Volltext

On box-perfect graphs von Ding, Guoli, Zang, Wenan, Zhao, Qiulan

Volltext

Coloring digraphs with forbidden cycles von Chen, Zhibin, Ma, Jie, Zang, Wenan

Volltext

Approximating Longest Cycles in Graphs with Bounded Degrees von Chen, Guantao, Gao, Zhicheng, Yu, Xingxing, Zang, Wenan

Volltext

Ranking tournaments with no errors I: Structural description von Chen, Xujin, Ding, Guoli, Zang, Wenan, Zhao, Qiulan

Volltext

Ranking tournaments with no errors II: Minimax relation von Chen, Xujin, Ding, Guoli, Zang, Wenan, Zhao, Qiulan

Volltext

An approximation algorithm for feedback vertex sets in tournaments von CAI, Mao-Cheng, XIAOTIE DENG, WENAN ZANG

Volltext

A Polyhedral Description of Kernels von Chen, Qin, Chen, Xujin, Zang, Wenan

Volltext

An efficient algorithm for finding maximum cycle packings in reducible flow graphs von Chen, Xujin, Zang, Wenan

Volltext

Approximating the Longest Cycle Problem on Graphs with Bounded Degree von Chen, Guantao, Gao, Zhicheng, Yu, Xingxing, Zang, Wenan

Volltext

Proof of Toft's conjecture : Every graph containing no fully odd K4 is 3-colorable von WENAN ZANG

Volltext