Journal Papers

  1. The fuzzy quadratic assignment problem with penalty: New models and genetic algorithm. Applied Mathematics and Computation, 2006, 174:1229-1244.(SCI)
  2. The maximum fuzzy weighted matching models and hybrid genetic algorithm. Applied Mathematics and Computation, 2006, 174(In Press).(SCI)
  3. Some properties of Ramsey numbers. Applied Mathematics Letters, 2003, 16:1187-1193.(SCI)
  4. Adjacent strong edge coloring of graphs. Applied Mathematics Letters, 2002, 15:623-626.(SCI)
  5. On the relations between arboricity and independent number or covering number. Discrete Applied Mathematics, 1998,87:279-283.(SCI)
  6. A note on the total chromatic number of Halin graphs with maximum degree 4. Applied Mathematics Letters, 1998, 11:23-27.(SCI)
  7. The complete chromatics number of Halin-graph. Chinese Science Bulletin, 1996.(SCI)
  8. Fuzzy fixed charge solid transportation problem and algorithm. Applied Soft Computing Journal, 2006(In Press).(SCI)
  9. A note on the lower bounds of signed domination number of a graph. Discrete Mathematics, 1999,195:295-298.(SCI)
  10. On the adjacent strong edge coloring of outer plane graph with maximum degree not large than 4.  J. of China University 200, 15: 20-27.
  11. The complete chromatics of pseudo Halin-graph with maximum degree not less than 6.  J. of Mathematical Research and Exposition, 2002, 4:35-41.
  12. The adjacent strong edge coloring of Halin-graph. J. of Mathematical Research and Exposition, 2003, 23:231-235.
  13. On the complete chromatics of Halin-graphs. ACTA MATHEMATICAE APPLICATAE SINCA, 13(1),1997.
  14. On the edge-binding number of some graphs. ACTA MATHEMATICAE APPLICATAE SINCA,17(2001).
  15. On the adjacent strong edge chromatic number of 1-tree graph. J. of Mathematical Research and Exposition, 2000,  20:152-157.
  16. On the vertex strong total coloring of Halin-Graphs. J. of Mathematical Research and Exposition, 2005,  25:269-275.
  17. On the the vertex-distinguished edge coloring of outer plane graph with maximum degree not less than 5.  J. of Mathematical Research and Exposition, 2005, 25:255-266.
  18. The vertex-distinguished edge coloring of plane graph with high-degree. J. of Mathematical Research and Exposition (proof).
Conference Presentations
  1. The fuzzy weighted k-tree and its hybrid genetic algorithm. Proceedings of the Third International Conference on Fuzzy Systems and Knowledge Discovery,2006.(SCIE).
  2. The credibility-based solid transportation problems. Proceeding of 33rd International Conference on Computer and Industry Engineering, 2003.
  3. The inequalities relevant to chance measure and expected value of bi-fuzzy variables. Proceedings of the 3th International Conference on IMS, 2004, 279-283(ISTP)
  4. The fuzzy weighted multi-commodity capacitated fixed charge network design. Proceedings of the 4th International Conference on IMS, 2005, 550--555.(ISTP)
  5. The quadratic shortest path problem and its genetic algorithm. Proceedings of the 5th International Conference on Electric Business, 2005, 439--441.
  6. Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm. Proceedings of the 5th International Conference on IMS, 2006, 550--555.(ISTP)
  7. Chance-constrained programming for fuzzy quadratic minimum spanning tree problem. Proceedings of the 2004 IEEE International Conference on Fuzzy Systems, Budapest, Hungary, 2004, 983-988(EI)
Submitted Papers
  1. The fuzzy weighted equilibrium spanning tree and its genetic algorithm (AMC)
  2. The fuzzy weighted quadratic minimum spanning tree and its heuristic genetic algorithm (IS)
  3. The priority based heuristic genetic algorithm of fuzzy fixed charge transportation problem (AMM)
  4. Credibility based equilibrium multi-job assignment problem and genetic algorithm (ASCJ)
  5. The multi-job assigned assignment problem and genetic algorithm (TCS)
  6. The fuzzy weighted k-matching models and hybrid genetic algorithm (COR)
  7. The quadratic maximum fuzzy weighted matching models and hybrid genetic algorithm (EJOR)
  8. The credibility based degree-constrained spanning tree problem: model and a cycle based genetic algorithm. (ORL)
  9. The minimum diameter spanning tree problem: A leaf vertex based genetic algorithm (OR)
  10. Spanning trees with constraints on the leaf degree:  A leaf vertex based genetic algorithm (DO)
  11. Degree equilibrium spanning tree problem:  A leaf vertex based genetic algorithm (AMC)
  12. On the vertex-distinguished total coloring of the plane graph with high degree (GT)