The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Wenan Zang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
    Approximating the Longest Cycle Problem on Graphs with Bounded Degree. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:870-884 [Conf]
  2. Wenan Zang
    Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 Is 3-Colorable. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:261-268 [Conf]
  3. Mao-cheng Cai, Xiaotie Deng, Wenan Zang
    A TDI System and its Application to Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:227-243 [Conf]
  4. Mao-cheng Cai, Xiaotie Deng, Wenan Zang
    A Min-Max Theorem on Feedback Vertex Sets. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:73-86 [Conf]
  5. Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
    A Min-Max Relation on Packing Feedback Vertex Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:126-135 [Conf]
  6. Bo Chen, Xiaotie Deng, Wenan Zang
    On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:380-389 [Conf]
  7. Xujin Chen, Wenan Zang
    An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:306-317 [Conf]
  8. Xiaotie Deng, Yi Zhou, Guojun Li, Wenan Zang
    A 2-Approximation Algorithm for Path Coloring on Trees of Rings. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:144-155 [Conf]
  9. Xujin Chen, Wenan Zang
    An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:3, pp:195-211 [Journal]
  10. Yusheng Li, Cecil C. Rousseau, Wenan Zang
    An upper bound for ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2004, v:17, n:6, pp:663-665 [Journal]
  11. Rong Luo, Wenan Zang, Cun-Quan Zhang
    Nowhere-Zero 4-Flows, Simultaneous Edge-Colorings, And Critical Partial Latin Squares. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:4, pp:641-657 [Journal]
  12. Frank K. Hwang, Wenan Zang
    Group testing and fault detection for replicated files. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:3, pp:231-242 [Journal]
  13. Guizhen Liu, Wenan Zang
    f-Factors in bipartite (mf)-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:1, pp:45-54 [Journal]
  14. Mao-cheng Cai, Xiaotie Deng, Wenan Zang
    Solution to a problem on degree sequences of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:253-257 [Journal]
  15. Yusheng Li, Xueqing Tang, Wenan Zang
    Ramsey functions involving Km, n with n large. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:120-128 [Journal]
  16. Yusheng Li, Cecil C. Rousseau, Wenan Zang
    Asymptotic Upper Bounds for Ramsey Functions. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:1, pp:123-128 [Journal]
  17. Xiaotie Deng, Guojun Li, Wenan Zang, Yi Zhou
    A 2-approximation algorithm for path coloring on a restricted class of trees of rings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:47, n:1, pp:1-13 [Journal]
  18. Yusheng Li, Wenan Zang
    The Independence Number of Graphs with a Forbidden Cycle and Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:4, pp:353-359 [Journal]
  19. Bo Chen, Xiaotie Deng, Wenan Zang
    On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:1, pp:85-95 [Journal]
  20. Xujin Chen, Zhiquan Hu, Wenan Zang
    Perfect Circular Arc Coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:3, pp:267-280 [Journal]
  21. Xueliang Li, Wenan Zang
    A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:4, pp:331-347 [Journal]
  22. Wenan Zang
    Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:2, pp:117-188 [Journal]
  23. Xiaotie Deng, Guojun Li, Wenan Zang
    Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:91, n:2, pp:301-325 [Journal]
  24. 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]. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:2, pp:352-353 [Journal]
  25. Guoli Ding, Zhenzhen Xu, Wenan Zang
    Packing cycles in graphs, II. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:244-253 [Journal]
  26. Guoli Ding, Wenan Zang
    Packing Cycles in Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:2, pp:381-407 [Journal]
  27. Yusheng Li, Wenan Zang
    Ramsey numbers involving large dense graphs and bipartite Turán numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:280-288 [Journal]
  28. Robin Thomas, Xingxing Yu, Wenan Zang
    Hamilton paths in toroidal graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:2, pp:214-236 [Journal]
  29. Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang
    The circumference of a graph with no K3, t-minor. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:822-845 [Journal]
  30. Mao-cheng Cai, Xiaotie Deng, Wenan Zang
    A Min-Max Theorem on Feedback Vertex Sets. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:2, pp:361-371 [Journal]
  31. Xiaotie Deng, Guojun Li, Wenan Zang
    Wavelength allocation on trees of rings. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:35, n:4, pp:248-252 [Journal]
  32. Mao-cheng Cai, Xiaotie Deng, Wenan Zang
    An Approximation Algorithm for Feedback Vertex Sets in Tournaments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1993-2007 [Journal]
  33. Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
    Approximating Longest Cycles in Graphs with Bounded Degrees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:635-656 [Journal]
  34. Yusheng Li, Wenan Zang
    Differential Methods for Finding Independent Sets in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:96-104 [Journal]
  35. Frank K. Hwang, Wenan Zang
    Detecting Corrupted Pages in M Replicated Large Files. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:12, pp:1241-1245 [Journal]
  36. Wenan Zang
    Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:183-192 [Journal]
  37. Wenan Zang
    Coloring graphs with no odd-K4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:184, n:1-3, pp:205-212 [Journal]
  38. Feng Tian, Wenan Zang
    The maximum number of diagonals of a cycle in a block and its extremal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:1, pp:51-63 [Journal]
  39. Wenan Zang
    Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:143, n:1-3, pp:259-268 [Journal]
  40. Xujin Chen, Xiaodong Hu, Wenan Zang
    A Min-Max Theorem on Tournaments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:3, pp:923-937 [Journal]

  41. The box-TDI system associated with 2-edge connected spanning subgraphs. [Citation Graph (, )][DBLP]


  42. Preface. [Citation Graph (, )][DBLP]


  43. Odd-K4's in stability critical graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.302secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002