Address: 99 Shangda Road
Shanghai 200444, P. R. China, Shanghai University

Research Interest
Scheduling, Approximation algorithm, Combinatorial optimization, Graph theory.

Research in Progress
1. Batch scheduling problems and approximation algorithms
2. Domination number and related parameters
3. K-center problems

Qualifications

Ph.D, Operation Research and Control Theory, Institute of System Science, Academia Sinica(1999)
M. S., Applied Mathematics, Zhengzhou University(1989)
B. S., Mathematics, Hebei Normal University(1986)

Professional Experience

Professor, Shanghai University (2002.2-present)
Research Fellow, Hong Kong Polytechnic University (2002,10-2003,10)
Visiting Professor, Changwon National University, South Korea (2001.9--2002.1)
Visiting Professor, Catholic University of Taegu, South Korea (2001.5--2001.6)
Associate Professor, Shanghai University, (2001,1-2002.2)
Senior Research Associate, City University of Hong Kong (2000.10--2001.1)
Research Fellow, City University of Hong Kong (2000.7--2000.9)
Research Associate, City University of Hong Kong (1999.8--2000.1)
Associate Professor, Shijiazhuang Railway Institute (1997.9--2001.2)
Lecturer, Shijiazhuang Railway Institute (1989.7--1996.7)

Relevant Publications

1. 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.
2. Hong Qiao, Liying Kang, Cardei Mihaela, Dingzhu Du, Paired domination number of trees,
Journal of Global Optimization 25(2003), 43-54.
3. Erfang Shan, Chuangyin Dang, Liying Kang, A note on Nordhaus-Gaddum inequalities for domination, Discrete Applied Mathematics 2003.
4. Liying Kang, Chuangyin Dang, Maocheng Cai, Erfang Shan, Upper minus domination for
k-subdomination number of graphs, Discrete Mathematics 247(2002), 229-234.
5. Liying Kang, Hong Qiao, Erfang Shan, Dingzhu Du, Lower bounds on minus domination and k-subdomination numbers, Lecture Notes in Computer Science 2108(2001), 375-383.
6. Liying Kang, Maocheng Cai, Upper minus domination in regular graphs, Discrete Mathematics 219(2000), 135-144.
7. 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.
8. Liying Kang, Jinjiang Yuan, Bondage number of planar graphs, Discrete Mathematics 222(2000), 191-198.
9. Liying Kang, Erfang Shan, Lower bounds on domination function in graphs, ARS Combinatoria 56(2000), 121-128.
10. T.C.E. Cheng, Liying Kang, C.T. Ng, Due-date assignment and single machine scheduling with deteriorating jobs (accepted by Journal of Operation Research Society)
11. Liying Kang, Moo Young Sohn, T.C.E. Cheng, Paired domination in inflated graphs (accepted by Theoretical Computer Science).
12. Chuangyin Dang, Liying Kang, Batching-processing scheduling with set-up times (accepted by Journal of Combinatorial Optimization).
13. Erfang Shan, Liying Kang, A note on balance vertices in trees (accepted by Discrete Mathematics).
14. Liying Kang, Hye Kyung Kim, Moo Young Sohn, Minus domination number in k-partite graphs (accepted by Discrete Mathematics).
15. Liying Kang, Moo Young Sohn, Hye Kyung Kim, Bondage number of the discrete torus C_n (accepted by Discrete Mathematics).
16. Erfang Shan, Moo Young Sohn, Liying Kang, Upper bounds on signed 2-independence number of graphs, Ars Combinatoria 169ÖÎ229-239.
17. Erfang Shan, Liying Kang, K-central vertices in graphs, Journal of System Science and Information, 4(2003), 503-507.
18. Erfang Shan, Liying Kang, Matching number and domination number (accepted by Advances in Mathematics (China))
19. Liying Kang and Maocheng Cai, Minus domination number in cubic graphs, Chinese Science Bulletin 6(1998), 444-447.
20. Erfang Shan, Liang Sun and Liying Kang, Some results on domination number of products of graphs, Applied Mathematics-- A J. Chinese Univ. Ser. B 13(1998),103--108.
21. Erfang Shan and Liying Kang(1998), $\Theta$-tolerance chain graphs and strongly chordal graphs(Chinese), Journal of the Hebei Academy of Sciences 15(2), 17-21.
22. Liying Kang and Erfang Shan(1996), On domination numbers of products of graphs. (Chinese) Mathematics Applicata 9(1996), 526--528.
23. Liying Kang and 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.
24. Jinjiang Yuan and Liying Kang, P2 path coloring problems of graphs with diameter 2(Chinese), Journal of Mathematics 15(1995), 401--404.
25. Liying Kang and Erfang Shan, A note on total-colourable edge-critical graphs (Chinese), Pure and Applied Mathematics 10(1994), 81-83.

26. Liying Kang, One single machine scheduling problem with release date(Chinese), Chinese Journal of Operations Research 10(1992), 73-74.
27. Liying Kang, A simple algorithm for a special scheduling matrices ( Chinese), Mathematics in Practice and Theory 3(1990), 59-60.