Professor Wenan Zang

       Professor Zang's research interests encompass combinatorics and optimization; his recent works are primarily related to integral polyhedra, min-max relations, algorithm design, computational complexity, and good characterizations. By using polyhedral, linear programming, and structure-driven approaches, he has successfully resolved several important long-standing open problems in his research fields, such as the three-color conjecture (which is a counterpart of the celebrated Four-Color Theorem) made by Toft in 1974, the conjecture on recognizing TDI systems proposed by Edmonds and Giles in 1984, the conjecture on maximal cliques and stable sets formulated by Chvátal in 1992, two conjectures on graph circumferences suggested by Seymour and Thomas in 1992, the conjecture on critical partial Latin squares made by Cameron and Keedwell in 1993, the problem on perfect graphs proposed by Hsu and Nemhauser in 1984, the problem related to the traveling salesman polyhedron raised by Cornuéjols, Fonlupt and Naddef in 1985, and the problem of recognizing box-TDI systems posed by Schrijver in 1986. Through a series of papers he has also significantly advanced the theory of polyhedral combinatorics, which plays a central role in operations research and theoretical computer science. Moreover, he has discovered (jointly with his collaborators) some powerful and novel combinatorial methods for tackling various important optimization problems.

PUBLICATIONS

RESEARCH GRANTS

EDITORIAL BOARDS

AWARDS AND HONORS

PLENARY AND INVITED LECTURES

POSTGRADUATE STUDENTS