default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWenan Zang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j60]Xujin Chen
, Guoli Ding, Wenan Zang, Qiulan Zhao:
Packing Feedback Arc Sets in Tournaments Exactly. Math. Oper. Res. 49(1): 151-170 (2024)- 2023
- [j59]Yan Cao, Guantao Chen, Guoli Ding, Guangming Jing, Wenan Zang:
On Gupta's Codensity Conjecture. SIAM J. Discret. Math. 37(3): 1666-1673 (2023) - 2020
- [j58]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors I: Structural description. J. Comb. Theory B 141: 264-294 (2020) - [j57]Xujin Chen, Guoli Ding, Wenan Zang, Qiulan Zhao:
Ranking tournaments with no errors II: Minimax relation. J. Comb. Theory B 142: 244-275 (2020)
2010 – 2019
- 2019
- [j56]Xujin Chen, Wenan Zang, Qiulan Zhao:
Densities, Matchings, and Fractional Edge-Colorings. SIAM J. Optim. 29(1): 240-261 (2019) - 2018
- [j55]Guoli Ding, Wenan Zang, Qiulan Zhao:
On box-perfect graphs. J. Comb. Theory B 128: 17-46 (2018) - [j54]Guoli Ding, Lei Tan, Wenan Zang:
When Is the Matching Polytope Box-Totally Dual Integral? Math. Oper. Res. 43(1): 64-99 (2018) - 2016
- [j53]Qin Chen, Xujin Chen, Wenan Zang:
A Polyhedral Description of Kernels. Math. Oper. Res. 41(3): 969-990 (2016) - 2015
- [j52]Zhibin Chen, Jie Ma, Wenan Zang:
Coloring digraphs with forbidden cycles. J. Comb. Theory B 115: 210-223 (2015) - 2014
- [j51]Yezhou Wu, Dong Ye, Wenan Zang, Cun-Quan Zhang:
Nowhere-Zero 3-Flows in Signed Graphs. SIAM J. Discret. Math. 28(3): 1628-1637 (2014) - 2013
- [j50]Jie Ma, Xingxing Yu, Wenan Zang:
Approximate min-max relations on plane graphs. J. Comb. Optim. 26(1): 127-134 (2013) - [j49]Zhiquan Hu, Ka Ho Law, Wenan Zang:
An Optimal Binding Number Condition for Bipancyclism. SIAM J. Discret. Math. 27(2): 597-618 (2013) - 2012
- [j48]Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang:
Bonds with parity constraints. J. Comb. Theory B 102(3): 588-609 (2012) - [j47]Guantao Chen, Xingxing Yu, Wenan Zang:
The circumference of a graph with no K3, t-minor, II. J. Comb. Theory B 102(6): 1211-1240 (2012) - [j46]Xujin Chen, Zhibin Chen, Wenan Zang:
Total Dual Integrality in Some Facility Location Problems. SIAM J. Discret. Math. 26(3): 1022-1030 (2012) - [j45]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
The Maximum-Weight Stable Matching Problem: Duality and Efficiency. SIAM J. Discret. Math. 26(3): 1346-1360 (2012) - 2011
- [j44]Guantao Chen, Xingxing Yu, Wenan Zang:
Approximating the chromatic index of multigraphs. J. Comb. Optim. 21(2): 219-246 (2011) - 2010
- [j43]Xujin Chen, Zhibin Chen, Wenan Zang:
A Unified Approach to Box-Mengerian Hypergraphs. Math. Oper. Res. 35(3): 655-668 (2010)
2000 – 2009
- 2009
- [j42]Xujin Chen, Guoli Ding, Wenan Zang:
The box-TDI system associated with 2-edge connected spanning subgraphs. Discret. Appl. Math. 157(1): 118-125 (2009) - [j41]Guantao Chen, Xingxing Yu, Wenan Zang:
Preface. Discret. Math. 309(5): 1019 (2009) - [j40]Zhibin Chen, Wenan Zang:
Odd-K4's in stability critical graphs. Discret. Math. 309(20): 5982-5985 (2009) - [j39]Guoli Ding, Wenan Zang:
Packing circuits in matroids. Math. Program. 119(1): 137-168 (2009) - [j38]Yezhou Wu, Wenan Zang, Cun-Quan Zhang:
A Characterization of Almost CIS Graphs. SIAM J. Discret. Math. 23(2): 749-753 (2009) - 2008
- [j37]Xujin Chen, Guoli Ding, Wenan Zang:
A Characterization of Box-Mengerian Matroid Ports. Math. Oper. Res. 33(2): 497-512 (2008) - [j36]Guoli Ding, Li Feng, Wenan Zang:
The complexity of recognizing linear systems with certain integrality properties. Math. Program. 114(2): 321-334 (2008) - [j35]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): 500-519 (2008) - 2007
- [j34]Xujin Chen, Xiaodong Hu, Wenan Zang:
A Min-Max Theorem on Tournaments. SIAM J. Comput. 37(3): 923-937 (2007) - 2006
- [j33]Xujin Chen, Wenan Zang:
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. Algorithmica 44(3): 195-211 (2006) - [j32]Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang:
The circumference of a graph with no K3, t-minor. J. Comb. Theory B 96(6): 822-845 (2006) - [j31]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) - [j30]Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang:
Approximating Longest Cycles in Graphs with Bounded Degrees. SIAM J. Comput. 36(3): 635-656 (2006) - [j29]Yusheng Li, Wenan Zang:
Differential Methods for Finding Independent Sets in Hypergraphs. SIAM J. Discret. Math. 20(1): 96-104 (2006) - 2005
- [j28]Yusheng Li, Xueqing Tang, Wenan Zang:
Ramsey functions involving Km, n with n large. Discret. Math. 300(1-3): 120-128 (2005) - [j27]Xujin Chen, Zhiquan Hu, Wenan Zang:
Perfect Circular Arc Coloring. J. Comb. Optim. 9(3): 267-280 (2005) - [j26]Xueliang Li, Wenan Zang:
A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. J. Comb. Optim. 9(4): 331-347 (2005) - [j25]Robin Thomas, Xingxing Yu, Wenan Zang:
Hamilton paths in toroidal graphs. J. Comb. Theory B 94(2): 214-236 (2005) - [j24]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 B 94(2): 352-353 (2005) - [c8]Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang:
Approximating the Longest Cycle Problem on Graphs with Bounded Degree. COCOON 2005: 870-884 - [c7]Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang:
A Min-Max Relation on Packing Feedback Vertex Sets. ISAAC 2005: 126-135 - 2004
- [j23]Yusheng Li, Cecil C. Rousseau, Wenan Zang:
An upper bound for ramsey numbers. Appl. Math. Lett. 17(6): 663-665 (2004) - [j22]Rong Luo, Wenan Zang, Cun-Quan Zhang:
Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. Comb. 24(4): 641-657 (2004) - [j21]Guizhen Liu, Wenan Zang:
f-Factors in bipartite (mf)-graphs. Discret. Appl. Math. 136(1): 45-54 (2004) - [j20]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) - [j19]Xiaotie Deng, Guojun Li, Wenan Zang:
Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs. J. Comb. Theory B 91(2): 301-325 (2004) - [c6]Xujin Chen, Wenan Zang:
An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. ISAAC 2004: 306-317 - 2003
- [j18]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) - [j17]Yusheng Li, Wenan Zang:
The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers. J. Comb. Optim. 7(4): 353-359 (2003) - [j16]Guoli Ding, Zhenzhen Xu, Wenan Zang:
Packing cycles in graphs, II. J. Comb. Theory B 87(2): 244-253 (2003) - [j15]Yusheng Li, Wenan Zang:
Ramsey numbers involving large dense graphs and bipartite Turán numbers. J. Comb. Theory B 87(2): 280-288 (2003) - 2002
- [j14]Frank K. Hwang, Wenan Zang:
Group testing and fault detection for replicated files. Discret. Appl. Math. 116(3): 231-242 (2002) - [j13]Guoli Ding, Wenan Zang:
Packing Cycles in Graphs. J. Comb. Theory B 86(2): 381-407 (2002) - [j12]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
A Min-Max Theorem on Feedback Vertex Sets. Math. Oper. Res. 27(2): 361-371 (2002) - 2001
- [j11]Yusheng Li, Cecil C. Rousseau, Wenan Zang:
Asymptotic Upper Bounds for Ramsey Functions. Graphs Comb. 17(1): 123-128 (2001) - [c5]Bo Chen, Xiaotie Deng, Wenan Zang:
On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. ISAAC 2001: 380-389 - 2000
- [j10]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
Solution to a problem on degree sequences of graphs. Discret. Math. 219(1-3): 253-257 (2000) - [j9]Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang:
Totally balanced combinatorial optimization games. Math. Program. 87(3): 441-452 (2000) - [j8]Xiaotie Deng, Guojun Li, Wenan Zang:
Wavelength allocation on trees of rings. Networks 35(4): 248-252 (2000) - [j7]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
An Approximation Algorithm for Feedback Vertex Sets in Tournaments. SIAM J. Comput. 30(6): 1993-2007 (2000) - [c4]Xiaotie Deng, Yi Zhou, Guojun Li, Wenan Zang:
A 2-Approximation Algorithm for Path Coloring on Trees of Rings. ISAAC 2000: 144-155
1990 – 1999
- 1999
- [j6]Wenan Zang:
Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers. Discret. Math. 199(1-3): 183-192 (1999) - [c3]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
A Min-Max Theorem on Feedback Vertex Sets. IPCO 1999: 73-86 - 1998
- [j5]Wenan Zang:
Coloring graphs with no odd-K4. Discret. Math. 184(1-3): 205-212 (1998) - [j4]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) - [c2]Wenan Zang:
Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. COCOON 1998: 261-268 - [c1]Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
A TDI System and its Application to Approximation Algorithms. FOCS 1998: 227-243 - 1997
- [j3]Frank K. Hwang, Wenan Zang:
Detecting Corrupted Pages in M Replicated Large Files. IEEE Trans. Parallel Distributed Syst. 8(12): 1241-1245 (1997) - 1995
- [j2]Wenan Zang:
Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs. Discret. Math. 143(1-3): 259-268 (1995) - 1991
- [j1]Feng Tian, Wenan Zang:
The maximum number of diagonals of a cycle in a block and its extremal graphs. Discret. Math. 89(1): 51-63 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
