Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Liying Kang
2010 – today
- 2013
[j45]Shouwei Guo, Liying Kang: Online scheduling of parallel jobs with preemption on two identical machines. Oper. Res. Lett. 41(2): 207-209 (2013)- 2012
- [j44]Shenwei Huang, Erfang Shan, Liying Kang: Perfect matchings in paired domination vertex critical graphs. J. Comb. Optim. 23(4): 507-518 (2012)
- [j43]Li-ying Hou, Liying Kang: Online scheduling on uniform machines with two hierarchies. J. Comb. Optim. 24(4): 593-612 (2012)
- [j42]
- 2011
- [j41]Guangjun Xu, Liying Kang: On the power domination number of the generalized Petersen graphs. J. Comb. Optim. 22(2): 282-291 (2011)
- [j40]Li-ying Hou, Liying Kang: Online and semi-online hierarchical scheduling for load balancing on uniform machines. Theor. Comput. Sci. 412(12-14): 1092-1098 (2011)
- [j39]Yancai Zhao, Liying Kang, Moo Young Sohn: The algorithmic complexity of mixed domination in graphs. Theor. Comput. Sci. 412(22): 2387-2392 (2011)
- 2010
- [j38]Xiaoqin Zhang, Liying Kang, Yukun Cheng: The pos/neg-weighted median problem on block graphs with subgraph-shaped customers. Computing 88(3-4): 97-110 (2010)
- [j37]Yukun Cheng, Liying Kang: The p-maxian problem on interval graphs. Discrete Applied Mathematics 158(18): 1986-1993 (2010)
- [j36]Haichao Wang, Liying Kang: Matching Properties in Double domination Edge Critical Graphs. Discrete Math., Alg. and Appl. 2(2): 151-160 (2010)
- [j35]Shouwei Guo, Liying Kang: Online scheduling of malleable parallel jobs with setup times on two identical machines. European Journal of Operational Research 206(3): 555-561 (2010)
- [j34]Haichao Wang, Liying Kang, Erfang Shan: Signed clique-transversal functions in graphs. Int. J. Comput. Math. 87(11): 2398-2407 (2010)
- [j33]Hongxing Jiang, Liying Kang: Total restrained domination in claw-free graphs. J. Comb. Optim. 19(1): 60-68 (2010)
- [j32]Liying Kang, Yukun Cheng: The p-maxian problem on block graphs. J. Comb. Optim. 20(2): 131-141 (2010)
- [j31]Yukun Cheng, Liying Kang, Changhong Lu: The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers. Theor. Comput. Sci. 411(7-9): 1038-1044 (2010)
2000 – 2009
- 2009
- [j30]T. C. Edwin Cheng, Liying Kang, Erfang Shan: A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discrete Applied Mathematics 157(2): 262-271 (2009)
- [j29]Hong Yan, Liying Kang, Guangjun Xu: The exact domination number of the generalized Petersen graphs. Discrete Mathematics 309(8): 2596-2607 (2009)
- [j28]Hongxing Jiang, Liying Kang, Erfang Shan: Total Restrained Domination in Cubic Graphs. Graphs and Combinatorics 25(3): 341-350 (2009)
- [j27]Haichao Wang, Liying Kang, Erfang Shan: Matching Properties in Total Domination Vertex Critical Graphs. Graphs and Combinatorics 25(6): 851-861 (2009)
- 2008
- [j26]Guangjun Xu, Liying Kang, Erfang Shan, Hong Yan: Proof of a conjecture on k-tuple domination in graphs. Appl. Math. Lett. 21(3): 287-290 (2008)
- [j25]Erfang Shan, T. C. Edwin Cheng, Liying Kang: An application of the Turán theorem to domination in graphs. Discrete Applied Mathematics 156(14): 2712-2718 (2008)
- [j24]Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo: On matching and total domination in graphs. Discrete Mathematics 308(11): 2313-2318 (2008)
- 2007
- [j23]Guangjun Xu, Erfang Shan, Liying Kang, T. C. Edwin Cheng: The algorithmic complexity of the minus clique-transversal problem. Applied Mathematics and Computation 189(2): 1410-1418 (2007)
- [j22]
- [j21]T. C. Edwin Cheng, Liying Kang, C. T. Ng: An improved algorithm for the p-center problem on interval graphs with unit lengths. Computers & OR 34(8): 2215-2222 (2007)
- [j20]T. C. Edwin Cheng, Liying Kang, C. T. Ng: Paired domination on interval and circular-arc graphs. Discrete Applied Mathematics 155(16): 2077-2086 (2007)
- [j19]Erfang Shan, T. C. Edwin Cheng, Liying Kang: Absorbant of generalized de Bruijn digraphs. Inf. Process. Lett. 105(1): 6-11 (2007)
- [j18]Erfang Shan, Liying Kang, Michael A. Henning: Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". Journal of Graph Theory 54(4): 350-353 (2007)
- 2006
- [j17]Liying Kang, Erfang Shan, Louis Caccetta: Total minus domination in k-partite graphs. Discrete Mathematics 306(15): 1771-1775 (2006)
- [j16]Min Zhao, Liying Kang, Gerard J. Chang: Power domination in graphs. Discrete Mathematics 306(15): 1812-1816 (2006)
- [j15]Guangjun Xu, Liying Kang, Erfang Shan: Acyclic domination on bipartite permutation graphs. Inf. Process. Lett. 99(4): 139-144 (2006)
- [j14]Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao: Power domination in block graphs. Theor. Comput. Sci. 359(1-3): 299-305 (2006)
- 2005
- [j13]Liying Kang, Moo Young Sohn, Hye Kyung Kim: Bondage number of the discrete torus Cn×C4. Discrete Mathematics 303(1-3): 80-86 (2005)
- [c2]Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao: Scheduling to Minimize Makespan with Time-Dependent Processing Times. ISAAC 2005: 925-933
- 2004
- [j12]Erfang Shan, Chuangyin Dang, Liying Kang: A note on Nordhaus-Gaddum inequalities for domination. Discrete Applied Mathematics 136(1): 83-85 (2004)
- [j11]Liying Kang, Hye Kyung Kim, Moo Young Sohn: Minus domination number in k-partite graphs. Discrete Mathematics 277(1-3): 295-300 (2004)
- [j10]Erfang Shan, Liying Kang: A note on balance vertices in trees. Discrete Mathematics 280(1-3): 265-269 (2004)
- [j9]Chuangyin Dang, Liying Kang: Batch-Processing Scheduling with Setup Times. J. Comb. Optim. 8(2): 137-146 (2004)
- [j8]Liying Kang, Moo Young Sohn, T. C. Edwin Cheng: Paired-domination in inflated graphs. Theor. Comput. Sci. 320(2-3): 485-494 (2004)
- 2003
- [j7]Erfang Shan, Moo Young Sohn, Liying Kang: Upper bounds on signed 2-independence number of graphs. Ars Comb. 69 (2003)
- [j6]Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du: Lower bounds on the minus domination and k-subdomination numbers. Theor. Comput. Sci. 296(1): 89-98 (2003)
- 2002
- [j5]Liying Kang, Chuangyin Dang, Mao-cheng Cai, Erfang Shan: Upper bounds for the k-subdomination number of graphs. Discrete Mathematics 247(1-3): 229-234 (2002)
- 2001
- [c1]Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du: Lower Bounds on the Minus Domination and k-Subdomination Numbers. COCOON 2001: 375-383
- 2000
- [j4]
- [j3]Liying Kang, Mao-cheng Cai: Upper minus domination in regular graphs. Discrete Mathematics 219(1-3): 135-144 (2000)
- [j2]Liying Kang, Jinjiang Yuan: Bondage number of planar graphs. Discrete Mathematics 222(1-3): 191-198 (2000)
- [j1]Xudong Yuan, Liying Kang, Mao-cheng Cai: The number of vertices of degree k in a minimally k-edge-connected digraph. Journal of Graph Theory 33(2): 94-108 (2000)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-29 21:29 CEST by the dblp team