The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Liying Kang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du
    Lower Bounds on the Minus Domination and k-Subdomination Numbers. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:375-383 [Conf]
  2. Liying Kang, T. C. Edwin Cheng, C. T. Ng, Min Zhao
    Scheduling to Minimize Makespan with Time-Dependent Processing Times. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:925-933 [Conf]
  3. Liying Kang, Erfang Shan
    Lower bounds on dominating functions in graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  4. Erfang Shan, Moo Young Sohn, Liying Kang
    Upper bounds on signed 2-independence number of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:69, n:, pp:- [Journal]
  5. Erfang Shan, Chuangyin Dang, Liying Kang
    A note on Nordhaus-Gaddum inequalities for domination. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:1, pp:83-85 [Journal]
  6. Liying Kang, Mao-cheng Cai
    Upper minus domination in regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:135-144 [Journal]
  7. Liying Kang, Chuangyin Dang, Mao-cheng Cai, Erfang Shan
    Upper bounds for the k-subdomination number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:229-234 [Journal]
  8. Liying Kang, Hye Kyung Kim, Moo Young Sohn
    Minus domination number in k-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:277, n:1-3, pp:295-300 [Journal]
  9. Liying Kang, Moo Young Sohn, Hye Kyung Kim
    Bondage number of the discrete torus Cn×C4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:303, n:1-3, pp:80-86 [Journal]
  10. Liying Kang, Jinjiang Yuan
    Bondage number of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:191-198 [Journal]
  11. Erfang Shan, Liying Kang
    A note on balance vertices in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:265-269 [Journal]
  12. Liying Kang, Erfang Shan, Louis Caccetta
    Total minus domination in k-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:15, pp:1771-1775 [Journal]
  13. Min Zhao, Liying Kang, Gerard J. Chang
    Power domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:15, pp:1812-1816 [Journal]
  14. Guangjun Xu, Liying Kang, Erfang Shan
    Acyclic domination on bipartite permutation graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:4, pp:139-144 [Journal]
  15. Chuangyin Dang, Liying Kang
    Batch-Processing Scheduling with Setup Times. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2004, v:8, n:2, pp:137-146 [Journal]
  16. Liying Kang, Hong Qiao, Erfang Shan, Ding-Zhu Du
    Lower bounds on the minus domination and k-subdomination numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:89-98 [Journal]
  17. Liying Kang, Moo Young Sohn, T. C. Edwin Cheng
    Paired-domination in inflated graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:485-494 [Journal]
  18. Guangjun Xu, Liying Kang, Erfang Shan, Min Zhao
    Power domination in block graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:359, n:1-3, pp:299-305 [Journal]
  19. Erfang Shan, Liying Kang, Michael A. Henning
    Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:4, pp:350-353 [Journal]
  20. T. C. Edwin Cheng, L. Y. Kang, C. T. Ng
    Paired domination on interval and circular-arc graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2077-2086 [Journal]

  21. Proof of a conjecture on k-tuple domination in graphs. [Citation Graph (, )][DBLP]


  22. Bondage number in oriented graphs. [Citation Graph (, )][DBLP]


  23. An improved algorithm for the p-center problem on interval graphs with unit lengths. [Citation Graph (, )][DBLP]


  24. An application of the Turán theorem to domination in graphs. [Citation Graph (, )][DBLP]


  25. A polynomial-time algorithm for the paired-domination problem on permutation graphs. [Citation Graph (, )][DBLP]


  26. On matching and total domination in graphs. [Citation Graph (, )][DBLP]


  27. The exact domination number of the generalized Petersen graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002