Wenan Zang - RankMe

71 papers A* 1B 5Misc 2Journal 63

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