中心研究人员科研成果
2009年
  1. X.-J. Chen, J. Hu, X.-D. Hu, A polynomial solvable minimum risk spanning tree problem with interval data European Journal of Operational Research, 198 (1) (2009), 43-46.
  2. X.-J. Chen, J. Hu, X.-D. Hu, A new model for path planning with interval data Computers & Operations Research, 36 (6) (2009), 1893-1899.
  3. X.-J. Chen, B. Chen, Approximation algorithms for soft-capacitated facility location in capacitated network design, Algorithmica, 53 (3) (2009), 263-297.
  4. X.-J. Chen, G.-L. Ding, W.-A. Zang, The box-TDI system associated 2-edge-connected spanning subgraphs, Discrete Applied Mathematics, 157 (1) (2009), 118-125.
  5. X.-J. Chen, J.-M. Zhu, X.-D. Hu, Data gathering schedule for minimal aggregation time in wireless sensor networks, International Journal of Distributed Sensor Networks, 5 (4) (2009), 321-337.
  6. X.-J. Chen, B. Chen,Cost-effective designs of fault-tolerant access networks in communication networks, Networks, 53 (4) (2009), 382-391.
  7. F. J. Brandenburg, M.-C. Cai, Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains, Lecture Notes in Computer Science, Vol. 5598 (2009), 4-15.
  8. K. Gong, Z.-F. Zhang, J.-F. Wang, Equitable total coloring of Fn V Wn, Acta Math. Appl. Sin. Engl. Ser., 25 (1) (2009), 83-86.
  9. Z.-G. Cao, X.-G. Yang, A PTAS for parallel batch scheduling with rejection and dynamic job arrivals, Theoret. Comput. Sci. 410 (27-29) (2009), 2732-2745.
  10. I. Averbakh, S.-C. Fang, Y.-B. Zhao, Robust univariate cubic L2 splines: interpolating data with uncertain positions of measurements, J. Ind. Manag. Optim. 5 (2) (2009), 351-361.
  11. I. Averbakh, Y.-B. Zhao, Relaxed robust second-order-cone programming, Appl. Math. Comput. 210 (2) (2009), 387-397.
  12. E. Flandrin, H. Li, B. Wei, A sufficient condition for pancyclability of graphs, Discrete Math. 309 (1) (2009), 144-150.
  13. Z.-Q. Hu, H. Li, Removable matchings and Hamiltonian cycles, Discrete Math. 309 (5) (2009), 1020-1024.
  14. H. Li, J.-P. Li, (s,m)-radius of k-connected graphs, Discrete Math. 309 (5) (2009), 1163-1177.
  15. H. Li, M. Lu, Bi-cycle extendable through a given set in balanced bipartite graphs, Discrete Appl. Math. 157 (5) (2009), 1009-1015.
  16. Z.-Q. Hu, H. Li, Weak cycle partition involving degree sum conditions, Discrete Math. 309 (4) (2009), 647-654.
  17. G.-H. Wang, H. Li, Color degree and alternating cycles in edge-colored graphs, Discrete Math. 309 (13) (2009), 4349-4354.
  18. M.-R. Chen, X.-F. Guo, H. Li, Lower and upper orientable strong diameters of graphs satisfying the Ore condition, Appl. Math. Lett. 22 (7) (2009), 994-997.
  19. E. Flandrin, H. Li, B. Wei, A sufficient condition for pancyclability of graphs, Discrete Math. 309 (1) (2009), 144-150.
  20. M. Xu, K. Thulasiraman, X.-D. Hu, Conditional diagnosability of matching composition networks under the PMC model, IEEE Transactions on Circuits and Systems II, 56 (11) (2009), 875-879.
  21. W. Ren, G.-Y. Yan, X.-P. Liao, Simple Probabilistic Algorithm for Detecting Community Structure in Social Networks, Phys. Rev. E 79 (2009), 036111
  22. C.-H. Lai, G.-Y. Yan, On potentially Kr+1 - U-graphical Sequences, UTILITAS MATHEMATICA, 80 (2009),233-244.
  23. Y. Liu, G.-Y. Yan, Graphs Isomorphic to Their Maximum Matching Graphs, Acta Mathematica Sinica,25 (9) (2009),1507-1516
  24. X.-P. Liao, W. Ren, G.-Y. Yan, A Linear Projection Approach for resolving community structure, Lecture Notes in Operations Research, (2009), 337-344.
  25. X. Chen, G.-Y. Yan, W. Ren, J.-B. Qu, Modularized random walk with restart for disease genes prioritization, Lecture Notes in Operations Research, (2009), 353-360.
  26. D.-Z. Du, X.-D. Hu, P. M. Pardalos, Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Vol. 5573, 2009, Springer.
  27. 黄德龙、文凤华、杨晓光, 投资者情绪指数及中国股市的实证, 系统科学与数学，29 (1) (2009), 1-13.
  28. 王建方, 超图研究中的两个问题, 系统科学与数学，29(11)(2009)，1457-1459
    29.
2008年
  1. X.-D. Hu, Jie Wang, Computing and Combinatorics, Lecture Notes in Computer Science, Vol. 5092, 2008.
  2. 袁亚湘、胡晓东、刘德刚, 中国运筹学会第九次学术年会论文集, 2008.
  3. Yan Liu, Guiying Yan, Factor-critical graphs with given number of maximum matchings,Graphs and Combinatorics, 24(6) (2008), 563-569.
  4. W.-P. Shang, F. Yao, P.-J. Wan, X.-D. Hu, On minimum m-connected k-dominating set problem in unit disc graphs, Journal of Combinatorial Optimization, 16 (2) (2008), 99-106.
  5. M. Xu, K. Thulasiraman, X.-D. Hu, Identifying codes of cycles with odd orders, European Journal of Combinatorics, 29 (7) (2008), 1717-1720.
  6. T. Jing, Y. Hu, Z. Feng, X.-L. Hong, X.-D. Hu, G.-Y. Yan, A full scale solution to the rectilinear obstacle-avoiding Steiner problem, Integration, the VLSI Journal, 41 (3) (2008), 413-425.
  7. X.-J. Chen, X.-D. Hu, X.-H. Jia, Imapproximability and approximability of minimal tree routing and coloring
    Journal of Discrete Algorithms, 6 (2) (2008), 341-351.
  8. J.-M. Zhu, X.-D. Hu, Improved algorithm for minimum data aggregation time problem in wireless sensor networks，Journal of Systems Science and Complexity, 21(4) (2008), 618-628.
  9. Lan Xiao, Guiying Yan, Yuwen Wu, Wei Ren， Induced subgraph in random regular graph，Journal of Systems Science and Complexity, 21(4) (2008), 645-650.
  10. Zhong-fu Zhang, Bing Yao, Jing-wen Li, Lin-zhong Liu, Jian-fang Wang, Bao-gen Xu， On Incidence Graphs， ARS Combinatoria, 87(2008),213-223.
  11. Xujin Chen, Guoli Ding, Wenan Zang，A characterization of box-Mengerian matroid ports，Mathematics of Operations Research, 33 (2008)，497-512.
  12. Y. B. Zhao, S.C. Fang, J. Lavery ，Geometric dual formulation for first-derivative-based univariate cubic L1 splines，Journal of Global Optimization, 40 (2008), 589-62.
  13. I. Averbakh, Y. B. Zhao，Explicit reformulation for robust mathematical optimization with general ncertainty sets，SIAM Journal on Optimization, 18 (2008), 1436-1466.
  14. Mao-cheng Cai, C.W. Duin, Xiaoguang Yang, Jianzhong Zhang，The partial inverse minimum spanning tree problem when weight increase is forbidden European Journal of Operations Research, 188 (2008)(2), 348--353
  15. Huiqing Liu, Mei Lu, Feng Tian，On the Randi? index，Journal of Mathematical Chemistry, 44(2) (2008), 301-310.
  16. 陈旭瑾, 胡捷, 胡晓东，带区间数据的最小风险斯坦纳树问题，系统科学与数学, 28 (11) (2008), 1311-1322.
  17. 肖岚，闫桂英，任伟，李旭，无线网络中全调度问题的一种随机分布式算法，系统科学与数学, 28 (11) (2008), 1331-1336.
  18. Mao-cheng Cai, Xiaotie Deng，Complexity of Exchange Markets，in Detlef Seese, Christof Weinhardt, and Frank ，Schlottmann, eds, Chapter 28 of Handbook on Information Technology in Finance, Springer Berlin Heidelberg, 2008, 689-705
  19. Mao-cheng Cai, Qizhi Fang，Restricted core stability of flow games，Lecture Notes in Computer Science, 5385 (2008), 454-464.
  20. Wei Ren, Guiying Yan, Guohui Lin, Caifeng Du, Xiaofeng Han ，Detecting community structure by network vectorization
    Lecture Notes in Computer Science, 5092 (2008), 245-254.
  21. Mao-cheng Cai, Xiaotie Deng ，Arbitrage in Frictional Foreign Exchange Market，in Ming-Yang Kao (ed), Encyclopedia of Algorithms, Springer-Verlag, 2008, Entry 362, 62-65.

    22.
2007年
  1. D.-Z. Du, X.-D. Hu, Steiner Tree Problems in Computer Communication Networks,2007, World Scientific Publishing Co Pte Ltd, Singapore
  2. H. Liu, M. Lu, F. Tian, Some upper bounds for the energy of graphs, Journal of Mathematical Chemistry, 41(2007), 45-57.
  3. M. Lu, F. Tian, L. Zhang, Lower bounds for the Laplacian spectrum of graphs based on diameter, Linear Algrebra and its Applications, 420 (2007), 400-406.
  4. H. Liu, M. Lu, F. Tian, On the spectral radius of unicycltc graphs with fixed diameter, Linear Algebra and its Applications, 420 (2007), 449-457.
  5. H. Liu, M. Lu, F. Tian, Laplacian spectum bounds for clique and independence numbers of graphs, Journal of Combinatorial Theory (B), 97 (2007), 726-732.
  6. M. Lu, F. Tian, L. Zhang, Maximum randic index on trees with k-pendent vertices, Journal of Mathematical Chemistry, 41 (2007), 161-171.
  7. H. Liu, M. Lu, F. Tian, Relative length of longest paths and cycles in graphs, Graphs and Combinatorics, 23 (2007), 433-443.
  8. D.-Y. Li, Q. Liu, X.-D. Hu, X.-H. Jia, Energy efficient multicast routing in ad hoc wireless networks, Computer Communications，30 (18) (2007), 3746-3756.
  9. M. Xu, X.-J. Chen, X.-D. Hu, On restricted forwarding index problem in communication networks, Computers and Mathematics with Applications，53(11)(2007), 1633-1643.
  10. X.-J. Chen, X.-D. Hu, W.-A. Zang, A Min-Max theorem on tournaments, SIAM Journal on Computing，37(3) (2007), 923-937.
  11. W.-P. Shang, P.-J. Wan, F. Yao, X.-D. Hu, Algorithms for minimum m-connected k-tuple dominating set problem, Theoretical Computer Science，381(1-3) (2007), 241-247.
  12. M. Xu, X.-D. Hu, J.-M. Xu, Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes, Applied Mathematics and Computation，189 (2) (2007), 1393-1401.
  13. T. Jing, Z. Feng, Y. Hu, X.-L. Hong, X.-D. Hu, G.-Y. Yan, -OAT: -Geometry obstacle-avoiding tree construction with O(nlogn) complexity, IEEE Trans. on Computer-Aided Design of Circuits and Systems，26 (11) (2007), 2073-2079.
  14. Y. B. Zhao, Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions, Applied Numerical Mathematics, 57 (9) (2007), 1033-1049.
  15. I. Averbakh and Y. B. Zhao, Explicit reformulations for robust optimization problems with general uncertainty sets, SIAM Journal on Optimization, 18 (4) (2007), 1436-1466.
  16. Y.B. Zhao and J. Hu, Global bounds for the distance to solutions of co-coercive variational inequalities, Operations Research Letters, 35 (3) (2007), 409-415.
  17. Xiaoguang Yang, Jianzhong Zhang, Partial inverse assignment problems under l1 norm, Operations Research Letter, 35(1)(2007), 23-28.
  18. Xiaoguang Yang, Jianzhong Zhang, Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems, Computational Optimization and Applications, 36(1)(2007), 55-66.
  19. Xiaoguang Yang, Jianzhong Zhang, Some inverse min-max network problems under weighted l1 and l norms with bound constraints on changes, Journal of Combinatorial Optimization, 13(2)(2007), 123-135.
  20. 张忠辅、李敬文、赵传成、任志国、王建方, 若干联图的点可区别均匀边色数,数学学报,第50卷，2007，第 1期，197-204
  21. W.-P. Shang, Frances Yao, P.-J. Wan, X.-D. Hu, Algorithms for minimum m-connected k-dominating set problem, Lecture Notes in Computer Science，Vol. 4616 (2007), 182-190.
  22. X.-J. Chen, J. Hu, X.-D. Hu, The minimum risk spanning tree problem, Lecture Notes in Computer Science，Vol. 4616 (2007), 81-90.
  23. X.-J. Chen, J. Hu, X.-D. Hu, On the minimum risk-sum path problem, Lecture Notes in Computer Science，Vol. 4614 (2007), 175-185.
  24. [24] W.-P. Shang, X.-D. Hu, The Roman domination problem in unit disk graphs, Lecture Notes in Computer Science，Vol. 4489 (2007), 305-312.
  25. [25] S.-P. Shang, X.-D. Hu, T. Jing, Rotational Steiner ratio problem under uniform orientation metrics, Lecture Notes in Computer Science，Vol. 4381 (2007), 166-176.
    26.
2006年
  1. 王建方, 超图的理论基础，高教出版社，2006
  2. Yunbin Zhao, S.C. Fang, and D. Li Constructing generalized mean functions using convex functions with regularity SIAM Journal On Optimization, 17(1) (2006), 37-51.
  3. Yunbin Zhao and D. Li A new path-following algorithm for nonlinear P-complementarity problems
    Computational Optimization and Applications, 34(2) (2006), 183-214
  4. Yunbin Zhao and D. Li On KKT points of homogeneous programming Journal of Optimization Theory and Applications, 130(2) (2006), 367-374.
  5. Xujin Chen, Guoli Ding, Xiaodong Hu, and Wenan Zang A min-max relation on packing feedback vertex sets Mathematics of Operations Research, 31(4) (2006), 777-788.
  6. Xujin Chen and Wenan Zang An efficient algorithm for finding maximum cycle packing in reducible flow graphs Algorithmica, 44 (2006)，195-211.
  7. Xujin Chen, Xiaodong Hu, and Tianping Shuai Inapproximability and approximability of maximal tree routing and coloring Journal of Combinatorial Optimization，11(2) (2006)，219-229.
  8. M. Xu, Xiaodong Hu, Q. Zhu Edge-bipancyclicity of star graphs under edge-fault tolerant Applied Mathematics and Computation, 183 (2) (2006), 972-979.
  9. H.-W. Du, Xiaodong Hu, X.-H. Jia Energy efficient routing and scheduling for real-time data aggregation in WSNs Computer Communications, 29 (17) (2006), 3527-3535.
  10. D.-D. Liu, Xiaodong Hu, X.-H. Jia Energy efficient information dissemination protocols by negotiation for wireless sensor networks Computer Communications, 29 (11) (2006), 2136-2149.
  11. Y. Hu, T. Jing, Z. Feng, X.-L. Hong, Xiaodong Hu, Guiying Yan ACO-Steiner: ant colony optimization based rectilinear Steiner minimal tree algorithm Journal of Computer Science and Technology, 21 (1) (2006), 147-152.
  12. A. Yu, M. Lu, and Feng Tian A kind of graphs with minimum Hosoya indices and maximum Merrified-Simmons indices MATCH Commun. Math. Comput. Chem., 55(2006), 103-118.
  13. H. Q. Liu, M. Lu, and Feng Tian Trees of Extremal Connectivity Index Discrete Applied Mathematics, 154(2006), 106-119.
  14. M. Lu, H. Q. Liu, and Feng Tian A new upper bound for the spectral radius of graphs with girth at least 5
    Linear Algebra and its Applications, 414(2006), 512-516.
  15. H. Q. Liu, M. Lu, and Feng Tian On the ordering of trees with general Randic index of the Nordhaus-Gaddam type MATCH Commun. Math. Comput. Chem., 55(2006), 419-426.
  16. M. Lu, L. Zhang, and Feng Tian On the Randic index of Cacti MATCH Commun. Math. Comput. Chem., 56(2006), 551-556.
  17. Y. Sheng, Feng Tian, J. L Wang, B. Wei, and Y. J. Zhu Path extendability of claw-free graphs
    Discrete Mathematics, 306(2006), 2010-2016.
  18. Yao-ping Hou and Tian Feng Unicyclic graphs with exactly two main eigevalues Applied Mathematics Letter, 19(2006), 1143-1147.
  19. Mao-cheng Cai, Xiaotie Deng, and Zhongfei Li Computation of arbitrage in frictional bond markets
    Theoretical Computer Science, 363(3) (2006), 248-256.
  20. Qin Wang, Xiaoguang Yang, and Jianzhong Zhang A class of inverse dominant problems under weighted l_ norm and an improved complexity bound for Radzik's algorithm Journal of Global Optimization, 34(4) (2006), 551-567.
  21. T. T. Lee, T. Y. Lo, and Jianfang Wang An information-lossless decomposition theory of relational information systems IEEE Transactions on Information Theory, 52(5) (2006), 1890-1903.
  22. T.-P. Shuai, Xiaodong Hu Connected set cover problem and its applications Lecture Notes in Computer Science, 4041 (2006), 243-254.
  23. D.-D. Liu, Xiaodong Hu, X.-H. Jia Energy efficient protocols for information dissemination in wireless sensor networks Lecture Notes in Computer Science, 3842 (2006), 176-185.
  24. Jianming Zhu, Xujin Chen, and Xiaodong Hu Minimum multicast time problem in wireless sensor networks
    Lecture Notes in Computer Science, 4138 (2006), 490-501.
    25.
2005年
  1. Mao, Linfan and Tian, Feng, On oriented 2-factorable graphs. J. Appl. Math. Comput. 17 (2005), no. 1-2, 25-38.
  2. Li, Hao and Shu, Jinlong, The partition of a strong tournament. Discrete Math. 290 (2005), no. 2-3, 211-220.
  3. X.-D. Hu and T.-P. Shuai, Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks, Lecture Notes in Computer Science, Vol. 3521 (2005), 320-329.
  4. X.-J. Chen, X.-D. Hu, and X.-H. Jia, Complexity of Minimal Tree Routing and Coloring, Lecture Notes in Computer Science, Vol. 3521 (2005), 6-15.
  5. Lu, Mei, Liu, Huiqing and Tian, Feng,Two sufficient conditions for dominating cycles, J. of Graph Theory, 49(2005), 135-150.
  6. Yu, Aimei, Lu, Mei and Tian, Feng, New upper bounds for the energy of graphs, MATCH Commun. Math. Comput. Chem., 53(2005), 441-448.
  7. Yu, Aimei, Lu, Mei and Tian, Feng, Characterization on Graphs which Achieve a Das' Upper Bound for Laplacian Spectral Radius, Linear Algebra and its Applications, 400(2005), 271-277.
  8. Lu, Mei, Liu, Huiqing and Tian, Feng, Bounds of Laplacian Spectrum of graphs based on the domination number, Linear Algebra and its Applications, 402(2005), 390-396.
  9. Mao, Linfan, Liu,Yanpei and Tian, Feng, Automorphisms of maps with a given underlying graph and their application to enumeration, Acta Math. Sinica (English Series), (2005)
    10.
2004年
  1. Y. Hu, Z. Feng, T. Jing, X.-L. Hong, Y. Yang, G. Yu, X.-D. Hu, and G.-Y. Yan, FORst:a 3-step heuristic for obstacle-avoiding rectilinear Steiner minimal tree construction, Journal of Information and Computational Science, 1(3)(2004), 107-116.
  2. X.-H. Jia, D. Du, X.-D. Hu, and D.-Y. Li, Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks, Computer Communications. 27(9)(2004), 880-889.
  3. J. Gu, X.-D. Hu, X. Jia, and M.-H. Zhang, Routing algorithm for multicast under multi-tree model in optical Networks, Theoretical Computer Science, 314(1-2)(2004), 293-301.
  4. Y. Wang, X.-L. Hong, T. Jing, Y. Yang, X.-D. Hu, and G.-Y. Yan, An efficient low-degree RMST algorithm for VLSI/ULSI physical design, Lecture Notes in Computer Science， 3254 (2004), 442-452.
  5. Cai, Maocheng; Fang, Qizhi; Li, Yanjun, Existence of Hamiltonian k-factor. J. Syst. Sci. Complex. 17 (2004), no. 4, 464--471.
  6. Zhang, J. Z.; Yang, X. G.; Cai, M. C. A network improvement problem under different norms. Comput. Optim. Appl. 27 (2004), no. 3, 305--319.
  7. Cai, Mao-cheng; Deng, Xiaotie; Wang, Lusheng, Minimum k arborescences with bandwidth constraints. Algorithmica 38 (2004), no. 4, 529--537.
  8. Zhang, J. Z.; Yang, X. G.; Cai, M. C., Inapproximability and a polynomially solvable special case of a network improvement problem. European J. Oper. Res. 155 (2004), no. 1, 251--257.
  9. Yu, Aimei; Tian, Feng, On the spectral radius of bicyclic graphs. MATCH Commun. Math. Comput. Chem. No. 52 (2004), 91--101.
  10. Tian, Feng, A short proof of Fan's theorem. Discrete Math. 286 (2004), no. 3, 285--286.
  11. Liu, Huiqing; Lu, Mei; Tian, Feng, On the spectral radius of graphs with cut edges. Linear Algebra Appl. 389 (2004), 139--145.
  12. Yu, Aimei; Lu,Mei; Tian, Feng, On the spectral radius of graphs. Linear Algebra Appl. 387 (2004), 41--49.
  13. Liu, Huiqing; Lu, Mei; Tian, Feng, Neighborhood unions and cyclability of graphs. Discrete Appl. Math. 140 (2004), no. 1-3, 91--101.
  14. Lu, Mei; Liu, Huiqing; Tian, Feng, The connectivity index. MATCH Commun. Math. Comput. Chem. No. 51 (2004), 149--154.
  15. Yu, Aimei; Tian, Feng, On the spectral radius of unicyclic graphs. MATCH Commun. Math. Comput. Chem. No. 51 (2004), 97--109.
  16. Chang, An; Tian, Feng; Yu, Aimei, On the index of bicyclic graphs with perfect matchings. Discrete Math. 283(2004), no. 1-3, 51--59.
  17. Liu, Huiqing; Lu, Mei; Tian, Feng, On the Laplacian spectral radius of a graph. Linear Algebra Appl. 376 (2004), 135--141.
  18. Li, Zhen Ping; Yan, Gui Ying; Zhang, Xiang Sun, Isolatedtoughness and fractional k-covered graphs. (Chinese) Acta Math. Appl. Sin. 27 (2004), no. 4, 593--598.
  19. Li, Zhen Ping; Yan, Gui Ying, Some results on the graphic isolated toughness and the existence of fractional factors. Acta Math. Appl. Sin. 27 (2004), no. 2, 324--333.
  20. Yan, Gui Ying; Xu, Bao Guang; Jiri, Mu Tu, Path decomposition of 3-regular graphs. J. Systems Sci. Math. Sci. 24 (2004), no. 2, 206--209.
  21. Flandrin, Evelyne; Li, Hao; Marczyk, Antoni; Wozniak, Mariusz, A note on pancyclism of highly connected graphs. Discrete Math. 286 (2004), no. 1-2, 57--60.
  22. Li, Hao; Shu, Jinlong, Partitioning a strong tournament into k cycles. Ars Combin. 72 (2004), 203--212.
  23. Enomoto, Hikoe; Li, Hao, Partition of a graph into cycles and degenerated cycles. Discrete Math. 276 (2004), no. 1-3, 177--181.
  24. Cada, Roman; Flandrin, Evelyne; Li, Hao; Ryjácek, Zdenek, Cycles through given vertices and closures. Discrete Math. 276 (2004), no. 1-3, 65-80.
  25. Balister, P. N.; Kostochka, A.; Li, Hao; Schelp, R. H., Balanced edge colorings. J. Combin. Theory Ser. B, 90 (2004), no. 1, 3-20.
    26.
2003年
  1. An Chang and Feng Tian, On the Spectral Radius of Unicyclic Graphs with Perfect Matchings, Linear Algebra and its Applications, 370(2003), 237-250.
  2. Yaojun Chen, Feng Tian, and Bing Wei,Hamilton-connectivity of 3-domination-critical Graphs with α ≤ δ, Discrete Mathematics, 271(2003), 1-12.
  3. Yaojun Chen and Feng Tian, A New Proof of Wojcicka's Conjecture, Discrete Applied Mathematics, 127(2003), 545-554.
  4. Yaojun Chen, Feng Tian, and Bing Wei, Degree Sums and Disjoint Paths with Prescribed Orders in Graphs, Advances in Mathematics, 32(1)(2003), 81-90.
  5. Zhiquan Hu and Feng Tian, On k-ordered Involved Degree Sum, Acta Mathematics Applicatae Sinica, 19(2003), 97-106.
  6. Lianzhu Zhang and Feng Tian, Extremal Catacondensed Benzenoids, Journal of Mathematical Chemistry, 34(2003), 111-122.
  7. Lihua Chen, Xiaotie Deng, Qizhi Fang, and Feng Tian, Majority Equilibrium for Public Facility Allocation, Lecture Notes in Computer Science, 2697(2003), 435-444.
  8. Qizhi Fang, Maocheng Cai, and Xiaotie Deng, Total Balancedness Condition for Steiner Tree Games, Discrete Applied Mathematics, 127(2003), 555-563.
  9. Mao-Cheng Cai, Xiaotie Deng and Lusheng Wang, Approximate Sequencing for Variable Length Tasks, Theoretical Computer Science, 290(2003), 2037-2044.
  10. Tokuda, Taro; Xu, Baoguang; and Wang, Jianfang, Connected factors and spanning trees in graphs. Graphs and Combinatorics, 19 (2003), no. 2, 259-262.
  11. Wang, Ping; Xu, Baoguang; and Wang, Jianfang, A note on the edge-connectivity of cages. Electron. J. Combin,.10(2003), Note 2, 4 pp. (electronic).
  12. X.-H. Jia, D.-Y. Li, X.-D. Hu, W. Wu, and D.-Z. Du, Placement of web server proxies with consideration of read and update operations on the Internet, The Computer Journal, 46(4)(2003), 378-390.
  13. D.-Y. Li, X.-H. Jia, X.-D. Hu, and Z.-G. Gong, Wavelength assignment for minimizing system blocking in multifiber all-optical WDM networks, Optical Networks Magazine, 4(4) (2003), 75-82.
  14. X.-H. Jia, D.-Z. Du, X.-D. Hu, H.-J. Huang, and D.-Y. Li, On the optimal placement of wavelength converters in WDM networks, Computer Communications, 26 (9) (2003), 986-995.
  15. Egawa, Yoshimi; Enomoto, Hikoe; Faudree, Ralph J.; Li, Hao; and Schiermeyer, Ingo, Two-factors each component of which contains a specified vertex. J. Graph Theory 43 (2003), no. 3, 188--198
    16.
2002年
  1. 1. Genghua Fan and Baogang Xu, Hajos`conjecture and projective graphs, Discrete Mathematics, 252(2002), 91-101.
  2. Genghua Fan, Subgraph coverings and edge switchings, Journal of Combinatorial Theory, Series B, 84(2002),54-83.
  3. Genghua Fan, Distribution of cycle lengths in graphs, Journal of Combinatorial Theory, Series B, 84(2002),187-202.
  4. Baogang Xu, On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability, Discrete Mathematics, 248(2002), 283-291.
  5. Y. Chen, F. Tian, and B. Wei, The codiameters of 3-connected 3-domination-critical graphs, Journal of Graph Theory, 39(2002), 76-85.
  6. X. Hu, B. Wei, F. Tian, Y. Egawa, and K. Hirohata，A Fan-type theorem for path-connectivity, Journal of Graph Theory, 39(2002), 265-282.
  7. Y. Chen, F. Tian, and B. Wei，The 3-domination-critical graphs with toughness one, Utilitas Mathematica, 61(2002),239-253.
  8. Y. Chen and F. Tian, Hamilton-connectivity of 3-connected 3-domination-critical graphs with a=d+2, European Journal of Combinatorics, 23(2002), 777-784.
  9. L. Zhang and F.Tian, Independence and connectivity in 3-domination-critical graphs, Discrete Mathematics, 259(2002), 227-236.
  10. G. Chen, A. Saito, B. Wei and X. Zhang, The Hamiltonicity of bipartite graphs involving neighborhood unions, Discrete Mathematics, 249(2002), 45-56.
  11. X .Li, B. Wei, Z. Yu, and Y. Zhu，Hamiltonicity of 1-tough triangle-free graphs, Discrete Mathematics, 254(2002), 275-287.
  12. B. Wei and Y. Zhu, The Chvatal-Erdos condition for panconnectivity of triangle-free graphs, Discrete Mathematics, 252(2002), 203-214.
  13. X.-H. Jia, D.-Z. Du, X.-D. Hu, H.-J. Huang, and D.-Y. Li, Optimal placement of wavelength converters for guaranteed wavelength assignment in WDM networks, IEICE Transactions on Communications, Vol. E85-B, 9 (2002), 1731-1739.
  14. J. Gu, X.-D. Hu, and M.-H. Zhang, Algorithms for Multicast Connection under Multi-Path Routing Model, Information Processing Letters, 84 (1) (2002), 31-39.
  15. S.-X. Gao, D.-Z. Du, X.-D. Hu, and X.-H. Jia, Rivest-Vuillemin conjecture is true for monotone Boolean functions with twelve variables, Discrete Mathematics, 253 (1-3) (2002), 19-34.
  16. X.-H. Jia, X.-D. Hu, L. Ruan, and J.-H. Sun, Multicast routing, load balancing and wavelength assignment on tree of rings, IEEE Communication Letters, 6 (2) (2002), 79-81.
  17. Zhang, Zhongfu; Liu, Linzhong; Wang, Jianfang, Adjacent strong edge coloring of graphs. Applied Mathematics Letters, 15 (2002), no. 5, 623--626.
  18. Cai, Mao-Cheng; Deng, Xiaotie; Feng, Haodi; Li, Guojun; Liu, Guizhen, A PTAS for minimizing total completion time of bounded batch scheduling. 304--314, Lecture Notes in Computer Science, 2337, 2002.
  19. Wang, Jianfang; Li, Haizhu, The upper bound of essential cyclomatic numbers of hypergraphs. Discrete Mathematics, 254 (2002), no. 1-3, 555--564.
  20. Xu, Baoguang; Wang, Ping; Wang, Jianfang, On the connectivity of (4;g)-cages. Ars Combin. 64 (2002), 181--192.
  21. Yang, Xiao Guang; Zhang, Jason; Cai, Mao Cheng, Complexity of two reverse network location problems. (Chinese) J. Systems Sci. Math. Sci. 22 (2002), no. 3, 321--327.
  22. Fang, Qizhi; Zhu, Shanfeng; Cai, Maocheng; Deng, Xiaotie, On computational complexity of membership test in flow games and linear production games. International Journal of Game Theory, 31 (2002), no. 1, 39--45.
  23. Cai, Mao-Cheng; Deng, Xiaotie; Zang, Wenan, A min-max theorem on feedback vertex sets. Mathematics of Operations Research, 27 (2002), no. 2, 361--371.
  24. Kang, Li-ying; Dang, Chuangyin; Cai, Mao-cheng; Shan, Erfang, Upper bounds for the k-subdomination number of graphs. Discrete Math. 247 (2002), no. 1-3, 229--234.
  25. Li, Guojun; Chen, Chuanping; Yu, Gang, Orthogonal factorizations of graphs. Discrete Math. 245 (2002), no.1-3, 173--194.
  26. Xu, Baogang, Hajós' conjecture and connectivity of Eulerian graphs. J. Syst. Sci. Complex. 15 (2002), no. 3, 295--298.
  27. Li, Guojun; Zhu, Binhai; Chen, Chuanping, On connected $[k,k+1]$-factors in claw-free graphs. Ars Combin. 62 (2002), 207--219.
  28. Baogang Xu, Two conjectures equivalent to the perfect graph conjecture. Discrete Math. 258 (2002), no. 1-3, 347--351.
  29. Wang, Ping; Wang, Jian-fang, On the monotonicity of $(k;g,h)$-graphs. Acta Math. Appl. Sin. Engl. Ser. 18 (2002), no. 3, 477--480.
  30. Wang, Jian-fang; Li, Hai-zhu, Enumeration of maximum acyclic hypergraphs. Acta Math. Appl. Sin. Engl.Ser. 18 (2002), no. 2, 215--218.
  31. Li, Haizhu; Wang, Jianfang, On acyclicand cyclic hypergraphs. J. Syst. Sci. Complex. 15 (2002), no. 4, 353--362.
  32. X.-H. Jia, X.-D. Hu, D.-Z. Du, Multiwavelength Optical Networks, 2002, Kluwer Academic Publishers, Norwell, MA, USA.
    33.
2001年
  1. P. C. B. Lam, W.C. Shiu, and Baogang Xu, On Structure of Some Plane Graphs with Application to Choosability, Journal of Combinatorial Theory, Ser B, 82 (2001), 285-297.
  2. Dingzhu Du, Lusheng Wang and Baogang Xu, The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points, Lecture Notes in Computer Science, 2108(2001), 509-518.
  3. Baogang Xu, Plane graphs with acyclic complexes, Lecture Notes in Computer Science, 2108(2001), 395-399.
  4. Fang, Qizhi; Zhu, Shanfeng; Cai, Maocheng; and Deng, Xiaotie, Membership for core of LP games and other games, 2108 (2001), Lecture Notes in Computer Science. 247-256.
  5. F. Tian and L. Z. Zhang, Extremal hexagonal chains concerning largest eigenvalue, Sciences in China (Ser.A), 44(2001), 1089-1097.
  6. J. Li, R. Shen, and F. Tian, Cycles containing given subsets in 1-tough, Ars Combinatoria, 58(2001), 193-204.
  7. Y. Chen, F. Tian and B. Wei, Degree sums and path-factors in graphs, Graphs and Combinatorics, 17(2001), 61-71.
  8. Z. Hu, F. Tian, and B. Wei, Long cycles through a linear forest, Journal of Combinatorial Theory (Ser B), 82(2001), 67-80.
  9. Z. Sun, F. Tian, and B. Wei, Degree sum connectivity and dominating cycles in graphs, Graphs and Combinatorics, 17(2001), 555-564.
  10. Genghua Fan, Czygrinow, Hurlbert, Kierstead, and Trotter, Spanning Trees of Bounded Degree, The Electronic Journal of Combinatorics, 8(1),R33,2001.
  11. Mao-cheng Cai, Xiantie Deng, and Wenan Zang, An Approximation Algorithm for Feedback Vertex Sets in Tournaments, SIAM Journal on Computing, 30(6)(2001), 1993-2007.
  12. Mao-cheng Cai ,Evelyne Flandrin, and Hao Li, On quasifactorability in graphs, Discrete Mathematics, 233(1-3)(2001), 85-92.
  13. Fang Qizhi and Cai Maocheng, Some results on universal minimal total dominating functions, ACTA Mathematicae Applicatae Sinica, 17(2)(2001), 165-172.
  14. G. Chen, X. Zhang, and B. Wei, Degree-Light-Free Graphs and Hamiltonian Cycles, Graphs and Combinatorics, 17 (2001), 409-434.
  15. Z. Sun, F. Tian, and B. Wei, Long Cycles Passing Through a Specified Edge in 3-Connected Graphs, Graphs and Combinatorics, 17 (2001) 565-577.
  16. X. Li, B. Wei, and F. Yang, A Degree Condition of 2-Factors in Bipartite Graphs, Discrete Applied Mathematics, 113 (2001) 311-318.
  17. G. Chen, J. Hutchinson, W. Piotrowski, W. Shreve, and B. Wei, Degree Sequence with Repeated Values, Ars. Combin., 59 (2001), 33-44.
  18. Lam, Peter Che Bor; Shiu, Wai Chee; Sun, Feng; Wang, Jianfang; and Yan, Guiying, Linear vertex arboricity, independence number and clique cover number. Ars Combin. 58 (2001), 121-128.
  19. 王建方，闫桂英，超图的圈结构，科学通报，46(19)(2001), 1585-1589.
  20. Jianfang Wang，Haizhu Li, Counting acyclic hypergraphs, Science in China (Series A), 44(2)(2001), 220-224.
  21. Caixia Chi, Shiquan Wu, and Jiangfang Wang, A new routing assignment model for Internet, Science in China (Series E), 44(3) (2001),229-232.
  22. Baogang Xu, (4m,m)-choosability of plane graphs, Journal of Systems Science and Complexity,14(2)(2001),174-178.
  23. Jirimutu; and Wang, Jianfang, Hamiltonian decomposition of complete bipartite r-hypergraphs. Acta Math. Appl. Sinica (English Ser.) 17 (2001), no. 4, 563-566.
  24. Liu, Linzhong; Zhang, Zhongfu; and Wang, Jianfang, On the edge-binding number of some plane graphs. ActaMath. Appl. Sinica (English Ser.) 17 (2001), no. 4, 443-448.
  25. S.-X. Gao, X-H. Jia, X.-D. Hu, and D.-Y. Li, Wavelength requirements and routing for multicast connections in lightpath and light-tree models of WDM networks with limited drops, IEE Proceedings on Communications, 148 (6) (2001), 363-367.
  26. X.-H. Jia, D.-Y. Li, X.-D.Hu, and D.-Z. Du, Optimal placement of Web proxies for replicated Web servers in the Internet, The Computer Journal, 44 (5) (2001), 329-339.
  27. X.-D. Hu, X.-H. Jia, D.-Z. Du, D.-Y. Li, and H.-J. Huang, Placement of data replicas for optimal data availability in ring networks, Journal of Parallel and Distributed Computing, 61 (10) (2001), 1412-1424.
  28. X.-H. Jia, D.-Z. Du, and X.-D. Hu, Integrated algorithms for delay bounded multicast routing and wavelength assignment in all optical networks, Computer Communications, 24 (14) (2001), 1390-1399.
  29. X.-D. Hu, X.-H. Jia, D.-Z. Du, and F. K. Hwang, Monotone routing in multirate rearrangeable Clos networks, Journal of Parallel and Distributed Computing, 61 (9) (2001), 1382-1388.
  30. D.-H. Chen, D.-Z. Du; X.-D. Hu, G.-H. Lin, L.-S. Wang, and G.-L. Xue, Approximations for Steiner trees with minimum number of Steiner points, Theoretical Computer Science, 262 (1-2) (2001), 83-99.
  31. L. Ruan, D.-Z. Du, X.-D. Hu, X.-H. Jia, D.-Y. Li, and Z. Sun, Converter placement supporting broadcast in WDM networks, IEEE Transaction on Computers, 50 (7) (2001), 750-758.
  32. B. Lu, J. Gu, X.-D. Hu, and E. Shragowitz, Wire segmenting for buffer insertion based on RSTP-MSP, Theoretical Computer Science, 262 (1-2) (2001), 257-267.
    33. X.-H. Jia, D.-Z. Du, X.-D. Hu, M. K. Lee, and J. Gu, Optimization of wavelength assignment for Q°S multicast WDM networks, IEEE Transaction on Communications, 49 (2) (2001), 341-350.
  33. He, Dongqi, Tian, Feng and Liu, Zhenghong, An improvement of Bondy's theorem on hamilton graph condition, Advances in Math. (China), 30(2001), 37-46.
    34.
2000年
  1. 1. Mao-Cheng Cai, Yang Xiaoguang, and Li, Yanjun, Inverse Problems of Submodular Functions on Digraphs, Journal of Optimization: Theory and Applications，104(3)(2000), 559-579.
  2. Yuan Xu-dong, Kang Li-ying, and Mao-Cheng Cai, The number of vertices of degree k in a minimally k-edge-connected digraph, Journal of Graph theory, 33(2)(2000), 94-108.
  3. A. Harkat, H. Li and F. Tian, Cyclability of 3-connected graphs, Journal of Graph Theory, 34(2000), 191-203.
  4. Yuan Xu-dong and Mao-Cheng Cai, On vertices of degree k in a minimally k-edge-connected digraph, Discrete Mathematics, 218(2000), 293-298.
  5. Kang Li-ying, and Mao-Cheng Cai, Upper minus domination in regular graphs, Discrete Mathematics, 219(2000), 135-144.
  6. Mao-Cheng Cai, Deng Xiaotie, and Zang Wenan, Solution to a problem on degree sequences, Discrete Mathematics, 219(2000), 253-257.
  7. Mao-Cheng Cai and Yuan Xu-dong, Applications of matroid partition to tree decomposition, ACTA Mathematicae Applicatae Sinica, 16(2)(2000),199-204.
  8. Genghua Fan and Cunquan Zhang, Circuit Decompositions of Eulerian Graphs, Journal of Combinatorial Theory, Ser.B., 78(2000), 1-23.
  9. Haizhu Li, Jianfang Wang, and Liang Sun, Hamiltonian decomposition of cayley graphs of orders P2 and Pq, ACTA Mathematicae Applicatae Sinica, 16(1)(2000), 78-86.
  10. 迟彩霞，吴士泉，王建方，多路路由算法及其在QoS路由中的应用，计算机学报， 23(7), 2000.
  11. Guiying Yan，J. F. Pan, C. K. Wong, and Taro Tokuda, Decomposition of graphs into(ɡ,?)- factors, Graphs and Combinatorics, 16(2000), 117-126.
  12. D.-H. Chen, D.-Z. Du, X.-D. Hu, G.-H. Lin, L.-S. Wang, G.-L. Xue, Approximations for Steiner trees with minimum number of Steiner points, Journal of Global Optimization, 18 (1) (2000), 17-33.
  13. D. F. Hsu, X.-D. Hu, G.-H. Lin, On minimum-weight k-edge connected Steiner networks on metric spaces, Graphs and Combinatorics, 16 (3) (2000), 275-284.
  14. D.-Y. Li, X.-F. Du, X.-D. Hu, L. Ruan, X.-H. Jia, Minimizing number of wavelengths in multicast routing trees in WDM networks, Networks, 35 (4) (2000), 260-265.
  15. D. F. Hsu, X.-D. Hu, On shortest three edge-connected Steiner networks in Euclidean plane, Discrete Applied Mathematics, 103 (1-3) (2000), 141-152.
  16. X.-F. Du, X.-D. Hu, X.-H. Jia, On shortest k-edge-connected Steiner networks on metric spaces, Journal of Combinatorial Optimization, 4 (1) (2000), 99-107.