|
Publication
|
1. Zuosong Liang, Erfang Shan, Liying Kang, The clique-transversal set problem in {claw, K4}-free planar graphs, Information Processing Letters 118 (2017), 64–68.
2. Wei Zhang, Lele Liu, Liying Kang, Yanqin Bai, Some properties of the spectral radius for general hypergraphs, Linear Algebra and its Applications 513 (2017), 103–119.
3. Zuosong Liang, Erfang Shan, Liying Kang, Clique-Perfectness of Claw-Free Planar Graphs, Graphs and Combinatorics 32(2016), 2551–2562.
4. Lele Liu, Liying Kang, Xiying Yuan, On the principal eigenvectors of uniform hypergraphs, Linear Algebra and its Applications 511(2016), 430-446.
5. Chun-song Bai, Li-ying Kang, The Pos/neg-weighted 2-medians in Balanced Trees with Subtree-shaped Customers, Acta Mathematicae Applicatae Sinica, English Series, 32(4) (2016), 1–8.
6. Er Fang Shan, Li Ying Kang, The General Facility Location Problem with Connectivity on Trees, Acta Mathematica Sinica, English Series 32 (9)(2016), 1106–1112.
7. Zuosong Liang, Erfang Shan, Liying Kang, Clique-Coloring Claw-Free Graphs, Graphs and Combinatorics 32(2016), 1473–1488.
8. Qi Wei, Liying Kang, Erfang Shan, Batching scheduling in a two-level supply chain with earliness and tardiness penalties, Journal of Systems Science and Complexity (2016) 29(2), 478-498.
9. Na Yin, Liying Kang, Minimizing makespan in permutation flow shop scheduling with proportional deterioration, Asia-Pacific Journal of Operational Research 32(6) (2015), 1-12.
10. Hongzhuan Wang, Liying Kang, Further properties on the degree distance of graphs, Journal of Combinatorial Optimization 31 (2016), 427-446.
11. Liying Kang, Jianjie Zhou, Erfang Shan, The Connected p-Centdian Problem on Block Graphs, COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), Lecture Notes in Computer Science 9486, 510-520.
12. Jianjie Zhou, Liying Kang, Erfang Shan, Two Paths Location of a Tree with Positive or Negative Weights, Theoretical Computer Science 607 (2015), 296-305.
13. Yanmei Hong, Liying Kang, Xingxing Yu, Nonseparating Cycles Avoiding Specific Vertices, Journal of Graph Theory 80 (2015), 253–267.
14. Liying Kang, Erfang Shan, Clique-transversal sets in line graphs of cubic graphs and triangle-free graphs, Bulletin of the Korean Mathematical Society 52(2015), 1423–1431.
15. Yanxia Dong, Erfang Shan, Liying Kang, Constructing the minimum dominating sets of generalized de Bruijn digraphs, Discrete Mathematics 338 (2015), 1501–1508.
16. L. Kang, V. Nikiforovb, X.Yuan, The p-spectral radius of k-partite and k-chromatic uniform hypergraphs, Linear Algebra and its Applications 478 (2015), 81–107.
17. Hongzhuan Wang, Liying Kang, On the Harary index of cacti, Utilitas Mathematica, 96(2015),149-163.
18. Erfang Shan, Liying Kang, Coloring clique-hypergraphs of graphs with no subdivision of K5, Theoretical Computer Science 592(2015), 166-175.
19. Wang Hongzhuan, Kang Liying, Shan Erfang (2014). "On the Estrada index of cacti", Electronic Journal of Linear Algebra 27(2014), 798-808.
20. Na Yin, Liying Kang, Tian-Chuan Sun, Chao Yue, Xue-Ru Wang, Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times, Applied Mathematical Modelling, 38 (19-20) (2014), 4747-4755.
21. Na Yin, Liying Kang, Xiao-Yuan Wang, Single-machine group scheduling with processing times dependent on position, starting time and allotted resource, Applied Mathematical Modelling, 38 (19-20) (2014), 4602-4613.
22. Liying Kang, Dingguo Wang, Erfang Shan, Independent sets in {claw, K4}-free 4-regular graphs, Discrete Mathematics 332 (2014), 40-44.
23. Liying Kang, Vladimir Nikiforov, Extremal problems for the p-spectral radius of graphs, The Electronic Journal of Combinatorics 21(3) (2014), #P3.
24. Erfang Shan,Lu Kong,Liying Kang, The Alcuin numbers of graphs with maximum degree at most five (Chinese), Science in China A: Mathematics 44 (6),719-728.
25. Liying Kang, Chunsong Bai, Erfang Shan, Kien Nguyen, The 2-maxian problem on cactus graphs, Discrete Optimization 13 (2014), 16–22.
26. Yukun Cheng, Liying Kang, Hong Yan, The Backup 2-median problem on block graphs, Acta Mathematicae Applicatae Sinica (English Series) 30 (2) (2014), 309-320.
27. Erfang Shan, Zuosong Liang, Liying Kang, Clique-transversal sets and clique-coloring in planar graphs, European Journal of Combinatorics 36 (2014), 367-376.
28. Qi Wei, Erfang Shan, Liying Kang, A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs, Theoretical Computer Science 524 (2014) , 78-89.
29. Na Yin, Liying Kang, Ping Ji, Ji-Bo Wang, Single machine scheduling with sum-of-logarithm-processing-times based deterioration, Information Sciences 274 (2014), 303–309.
30. Shouwei Guo, Liying Kang, Online scheduling of parallel jobs with preemption on two identical machines, Operations Research Letters 41(2) (2013), 207-209.
31. Hongzhuan Wang, Liying Kang, More on the Harary index of cacti, Journal of Applied Mathematics and Computing 43(1-2)(2013), 369-386.
32. Shenwei Huang, Liying Kang, Erfang Shan, Paired-domination in claw-free graphs, Graphs and Combinatorics 29 (6) (2013), 1777-1794.
33. Liying Kang, Dingguo Wang, Erfang Shan, The independence number of connected (claw, K4)-free 4-regular graphs, Taiwanese Journal of Mathematics 17(1) (2013), 275-285.
34. Liying Kang, Variations of Dominating Set Problem, in Handbook of Combinatorial Optimization，2013, 3363-3394.
35. Yanmei Hong, Liying Kang, Backup 2-center on interval graphs, Theoretical Computer Science 445 (2012), 25–35.
36. Li-ying Hou, Liying Kang, Online scheduling on uniform machines with two hierarchies, Journal of Combinatorial Optimization 24(2012), 593-612.
37. Shenwei Huang, Erfang Shan, Liying Kang, Perfect matchings in paired domination vertex critical graphs, Journal of Combinatorial Optimization 23 (2012), 507–518.
38. Guangjun Xu, Liying Kang, On the power domination number of the generalized Petersen graphs, Journal of Combinatorial Optimization 22(2) (2011), 282-291.
39. Erfang Shan, Liying Kang, Clique-transversal sets in 4-regular claw-free graphs, Acta Mathematica Sinica, English Series 27(5) (2011), 883-890.
40. Yancai Zhao; Liying Kang, Moo Young Sohn, The algorithmic complexity of mixed domination in graphs, Theoretical Computer Science 412 (2011), 2387–2392.
41. Li-ying Hou, Liying Kang, Online and semi-online hierarchical scheduling for load balancing on uniform machines, Theoretical Computer Science 412 (2011), 1092–1098.
42. Hongxing Jiang, Liying Kang, Inequality of Nordhaus-Gaddum type for total outer-connected domination in graphs, Acta Mathematica Sinica 27 (3) (2011), 607-616.
43. Shouwei Guo, Liying Kang, Online scheduling of malleable parallel jobs on identical machines, European Journal of Operational Research 206(3) (2010), 555–561.
44. Yukun Cheng, Liying Kang，The p-maxian problem on interval graphs，Discrete Applied Mathematics 158 (2010) 1986-1993.
45. C. Liu, S. Fujimura, L. Y. Kang, Arriving Time Control Algorithm for Dynamic Flexible Flow Shop Problem, Proceedings of 2010 IEEE the 17th International Conference on Industrial Engineering and Engineering Management. 1 (2010), 737-741.
46. Liying Kang, Yukun Cheng, The p-maxian problem on block graphs, Journal of Combinatorial Optimization 20(2) (2010), 131-141.
47. Haichao Wang, Liying Kang, Erfang Shan, Signed clique-transversal functions in graphs, International Journal of Computer Mathematics 87 (11) (2010), 2398-2407.
48. Hongxing Jiang, Liying Kang, Erfang Shan, Graphs with large total restrained domination number, Utilitas Mathematica 81 (2010), 53-63.
49. Xiaoqin Zhang, Liying Kang, Yukun Cheng, The pos/neg-weighted median problem on block graphs with subgraph-shaped customers, Computing 88(2010), 97-110.
50. Wei Shi, Liying Kang, Suichao Wu, Bounds on Laplacian eigenvalues related to total and signed domination of graphs, Czechoslovak Mathematical Journal 60 (135) (2010), 315–325.
51. Wen-Huan Wang, Li-Ying Kang, Ordering of the trees by minimal energies, Journal of Mathematical Chemistry 47(3) (2010), 937-958.
52. Yukun Cheng, Liying Kang, Changhong Lu, The pos/neg-weighted median problems on tree graphs with subtree-shaped customers, Theoretical Computer Science 411 (7-9) (2010), 1038-1044.
53. Hongxing Jiang, Liying Kang, Total restrained domination in claw-free graphs, Journal of Combinatorial Optimization 19 (1) (2010), 60-68.
54. Haichao Wang, Liying Kang, Matching properties in double domination edge critical graphs, Discrete Mathematics, Algorithms and Applications, 2 (2)(2010), 151-160.
55. Haichao Wang, Liying Kang, Erfang Shan, Matching properties in total domination vertex critical graphs, Graphs and Combinatorics. 25(6) (2009), 851-861.
56. Hongxing Jiang, Liying Kang，Erfang Shan，Total restrained domination in cubic graphs, Graphs and Combinatorics 25 (3) (2009), 341–350.
57. Wen-Huan Wang, Li-Ying Kang, Ordering of the trees with a perfect matching by minimal energies, Linear Algebra and its Applications 431 (2009) 9,46–961.
58. Hong Yan，Liying Kang, Guangjun Xu, The exact domination number of the generalized Petersen graphs, Discrete Mathematics 309(2009), 2596-2607.
59. T.C.E. Cheng, Liying Kang, Erfang Shan, A polynomial-time algorithm for the paired-domination problem on permutation graphs, Discrete Applied Mathematics 157 (2009), 262-271.
60. Erfang Shan, T.C.E. Cheng, Liying Kang, An application of the Turan theorem to domination in graphs, Discrete Applied Mathematics 156 (2008), 2712-2718.
61. Erfang Shan, T.C.E. Cheng, Liying Kang, Bounds on the clique-transversal number of regular graphs, Science in China A: Mathematics 51 (5) (2008), 851-863.
62. M. A. Henning, Liying Kang, Erfang Shan, Anders Yeo, On matching and total domination in graphs, Discrete Mathematics 308(2008), 2313-2318.
63. Guangjun Xu, Liying Kang, Erfang Shan, Hong Yan, Proof of a conjecture on k-tuple domination in graphs, Applied Mathematics Letters 21 (2008), 287-290.
64. T.C.E. Cheng, Liying Kang, C.T. Ng, An improved algorithm for the p-center problem on interval graphs with unit lengths, Computers & Operations Research 34 (2007), 2215-2222.
65. T.C.E. Cheng, Liying Kang, C.T. Ng, Due-date assignment and parallel-machine scheduling with deteriorating jobs, Journal of the Operational Research Society 58 (2007), 1103-1108.
66. Erfang Shan, Liying Kang, M.A. Henning, Erratum to: A linear Vizing-like relation relating the size and total domination number of a graph, Journal of Graph Theory 54 (2007), 350-353.
67. T.C.E. Cheng, Liying Kang, C.T. Ng, Paired domination on interval and circular-arc graphs, Discrete Applied Mathematics 155(2007), 2077-2086.
68. Liying Kang, C.T. Ng, A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs, International Journal of Production Economics 109 (2007), 180-184.
69. Erfang Shan, T.C.E. Cheng, Liying Kang, Absorbant of generalized de Bruijn digraphs, Information Processing Letters 105 (2007), 6-11.
70. Guangjun Xu, Erfang Shan, Liying Kang and T.C.E. Cheng, The algorithmic complexity of the minus clique-transversal problem, Applied Mathematics and Computation 189 (2007), 1410-1418.
71. Erfang Shan, Liying Kang, Qin Lu, k-semikernels, k-quasikernels, k-kernels in digraphs and their line digraphs, Utilitas Mathematica 72 (2007), 267-277.
72. Erfang Shan, Liying Kang, Bondage number in oriented graphs, Ars Combinatoria 84 (2007), 319-331.
73. Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao, Power domination in block graphs, Theoretical Computer Science 359 (2006), 299-305.
74. Liying Kang, Erfang Shan, Louis Caccetta, Total minus domination in k-partite graphs, Discrete Mathematics 306 (2006), 1771-1775.
75. Min Zhao, Liying Kang, Gerard J. Chang, Power domination in graphs, Discrete Mathematics 306 (2006), 1812-1816.
76. Guangjun Xu, Liying Kang, Erfang Shan, Acyclic domination on bipartite permutation graphs, Information Processing Letters 99(2006), 139-144.
77. L.Y. Kang, T.C.E. Cheng, C.T. Ng, and M. Zhao, Scheduling to minimize makespan with time-dependent processing times, Lecture Notes in Computer Science 3827 (2005), 925-933.
78. T.C.E. Cheng, Liying Kang, C.T. Ng, Single machine due-date scheduling of jobs with decreasing start-time dependent processing times, International Transactions in Operational Research 12 (2005), 355-366.
79. Liying Kang, Moo Young Sohn, Hye Kyung Kim, Bondage number of the discrete torus C_n* C_4, Discrete Mathematics 303 (2005), 80-86.
80. Liying Kang, Hye Kyung Kim, Moo Young Sohn, Minus domination number in k-partite graphs, Discrete Mathematics 277(2004), 295-300.
81. Chuangyin Dang, Liying Kang, Batch-Processing Scheduling with setup times, Journal of Combinatorial Optimization 8 (2004), 137-146.
82. Liying Kang, Moo Young Sohn, T.C.E. Cheng, Paired domination in inflated graphs, Theoretical Computer Science 320 (2004), 485-494.
83. T.C.E. Cheng, Liying Kang, C.T. Ng, Due-date assignment and single machine scheduling with deteriorating jobs, Journal of the Operation Research Society 55 (2004), 198-203.
84. Erfang Shan, Liying Kang, A note on balance vertices in trees, Discrete Mathematics 280 (2004), 265-269.
85. Erfang Shan, Liying Kang, M. A. Henning, A characterization of trees with equal total domination and paired-domination numbers, Austrasian Journal of Combinatorics 30 (2004), 31-39.
86. Erfang Shan, Liying Kang，Characterization of graphs with equal domination and matching numbers(Chinese),Advances in Mathematics 33(2)(2004),229-235.
87. Erfang Shan, Chuangyin Dang, Liying Kang, A note on Nordhaus-Gaddum inequalities for domination, Discrete Applied Mathematics 136 (2004), 83-85.
88. Erfang Shan, Moo Young Sohn, Liying Kang, Upper bounds on signed 2-independence number of graphs, Ars Combinatoria 69(2003), 229-239.
89. Erfang Shan, Liying Kang, K-central vertices in graphs, J. System Science and Information 1(4) (2003), 503-507.
90. Liying Kang, Hong Qiao, Erfang Shan, Dingzhu Du, Lower bounds on the minus domination and k-subdomination numbers, Theoretical Computer Science 296 (2003), 89-98.
91. Hong Qiao, Liying Kang, Cardei Mihaela, Dingzhu Du, Paired domination number of trees, Journal of Global Optimization 25 (2003), 43-54.
92. Liying Kang, Chuangyin Dang, Maocheng Cai, Erfang Shan, Upper minus domination for k-subdomination number of graphs, Discrete Mathematics 247(2002), 229-234.
93. Liying Kang, Qiao Hong, Erfang Shan, Du Ding-Zhu,Lower bounds on the minus domination and k-subdomination numbers, Lecture Notes in Computer Science 2108 (2001), 375-383.
94. Kang Liying, Erfang Shan, Lower bounds on domination function in graphs, Ars Combinatoria 56 (2000), 121-128.
95. Liying Kang, Maocheng Cai, Upper minus domination in regular graphs, Discrete Mathematics 219 (2000), 135-144.
96. Xudong Yuan, Liying Kang, Maocheng Cai, The number of vertices of degree k in a minimally k-edge-connected digraph, Journal of Graph Theory 33 (2000), 94-106.
97. Liying Kang, Jinjiang Yuan, Bondage number of planar graphs, Discrete Mathematics 222 (2000), 191-198.
98. Liying Kang, Maocheng Cai, Minus domination number in cubic graphs, Chinese Science Bulletin 6 (1998), 444-447.
99. Erfang Shan, Liang Sun, Liying Kang, Some results on domination number of products of graphs, Applied Mathematics--JCU Ser. B 13 (1998), 103-108.
100. Liying Kang, Erfang Shan, On connected domination number of a graph, Combinatorics and Graph theory'95, Vol. 1 (1995), 199-204, World Science Publishing, River Edge, NJ.
|