Liying Kang

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 61

Top Venues

Publications

Erfang Shan, Liying Kang, Yisai Xue
The Turán number of Berge hypergraphs with stable properties. Discret. Math. 347 (1) (2024)
Zhenyu Ni, Lele Liu, Liying Kang
Spectral Turán-Type Problems on Cancellative Hypergraphs. Electron. J. Comb. 31 (2) (2024)
Yisai Xue, Yichong Liu, Liying Kang
Stability of Generalized Turán Number for Linear Forests. Graphs Comb. 40 (3) (2024)
Jiadong Wu, Jing Wang, Liying Kang
Spectral conditions for matching extension. Appl. Math. Comput. 483 (2024)
Yuanpei Wang, Zhenyu Ni, Yichong Liu, Liying Kang
Generalized Turán results for edge blow-up of star forests. Discret. Math. 347 (1) (2024)
Yichong Liu, Liying Kang
Extremal graphs without long paths and a given graph. Discret. Math. 347 (7) (2024)
Peiyan Zhang, Chaozhuo Li, Liying Kang, Feiran Huang, Senzhang Wang, Xing Xie, Sunghun Kim
High-Frequency-aware Hierarchical Contrastive Selective Coding for Representation Learning on Text Attributed Graphs. WWW (2024)
Peiyan Zhang, Chaozhuo Li, Liying Kang, Feiran Huang, Senzhang Wang, Xing Xie, Sunghun Kim
High-Frequency-aware Hierarchical Contrastive Selective Coding for Representation Learning on Text-attributed Graphs. CoRR (2024)
Peiyan Zhang, Yuchen Yan, Xi Zhang, Liying Kang, Chaozhuo Li, Feiran Huang, Senzhang Wang, Sunghun Kim
GPT4Rec: Graph Prompt Tuning for Streaming Recommendation. CoRR (2024)
Jing Wang, Zhenyu Ni, Liying Kang, Yi-zheng Fan
Spectral extremal graphs for edge blow-up of star forests. Discret. Math. 347 (10) (2024)
Peiyan Zhang, Yuchen Yan, Xi Zhang, Liying Kang, Chaozhuo Li, Feiran Huang, Senzhang Wang, Sunghun Kim
GPT4Rec: Graph Prompt Tuning for Streaming Recommendation. SIGIR (2024)
Jing Wang, Liying Kang, Yisai Xue
On a conjecture of spectral extremal problems. J. Comb. Theory, Ser. B 159 (2023)
Liying Kang, Anna B. Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang
The two-step average tree value for graph and hypergraph games. Ann. Oper. Res. 323 (1) (2023)
Jiadong Wu, Yisai Xue, Liying Kang
Some sufficient conditions for graphs being k-leaf-connected. Discret. Appl. Math. 339 (2023)
Zhenyu Ni, Jing Wang, Liying Kang
Spectral Extremal Graphs for Disjoint Cliques. Electron. J. Comb. 30 (1) (2023)
Liying Kang, Zhenyu Ni, Erfang Shan
The Turán number of Berge-matching in hypergraphs. Discret. Math. 345 (8) (2022)
Mao-cheng Cai, Liying Kang
Solution to a Forcible Version of a Graphic Sequence Problem. Graphs Comb. 38 (3) (2022)
Yisai Xue, Erfang Shan, Liying Kang
-uniform hypergraphs. Discret. Math. 345 (4) (2022)
Liying Kang, Anna B. Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang
The average tree value for hypergraph games. Math. Methods Oper. Res. 94 (3) (2021)
Min Zhao, Erfang Shan, Liying Kang
On a Conjecture for Power Domination. Graphs Comb. 37 (4) (2021)
Liying Kang, Hui Zhu, Erfang Shan
Extremal graphs for blow-ups of stars and paths. Discret. Appl. Math. 290 (2021)
Liying Kang, Zhenyu Ni, Erfang Shan
Decomposing uniform hypergraphs into uniform hypertrees and single edges. Discret. Math. 344 (8) (2021)
Jing Wang, Liying Kang, Erfang Shan
The principal eigenvector to α-spectral radius of hypergraphs. J. Comb. Optim. 42 (2) (2021)
Liying Kang, Wei Zhang, Erfang Shan
The spectral radius and domination number in linear uniform hypergraphs. J. Comb. Optim. 42 (3) (2021)
Lele Liu, Changxiang He, Liying Kang
Saturation Number of Berge Stars in Random Hypergraphs. Electron. J. Comb. 27 (4) (2020)
Liying Kang, Erfang Shan, Min Zhao
Power domination in the generalized Petersen graphs. Discuss. Math. Graph Theory 40 (3) (2020)
Hui Zhu, Liying Kang, Zhenyu Ni, Erfang Shan
in 3-Uniform Hypergraphs. SIAM J. Discret. Math. 34 (3) (2020)
Zhenyu Ni, Liying Kang, Erfang Shan, Hui Zhu
Extremal Graphs for Blow-Ups of Keyrings. Graphs Comb. 36 (6) (2020)
Hui Zhu, Liying Kang, Erfang Shan
Extremal Graphs for Odd-Ballooning of Paths and Cycles. Graphs Comb. 36 (3) (2020)
Qiannan Wang, Liying Kang, Erfang Shan, Zuosong Liang
The α-spectral radius of uniform hypergraphs concerning degrees and domination number. J. Comb. Optim. 38 (4) (2019)
Erfang Shan, Jing Zhao, Liying Kang
Maximally connected p-partite uniform hypergraphs. Discret. Appl. Math. 264 (2019)
Lele Liu, Liying Kang, Shuliang Bai
Bounds on the spectral radius of uniform hypergraphs. Discret. Appl. Math. 259 (2019)
Zhangqing Yu, Liying Kang, Lele Liu, Erfang Shan
-index of outerplanar and planar graphs. Appl. Math. Comput. 343 (2019)
Zuosong Liang, Erfang Shan, Liying Kang
The clique-perfectness and clique-coloring of outer-planar graphs. J. Comb. Optim. 38 (3) (2019)
Liying Kang, Lele Liu, Erfang Shan
The eigenvectors to the p-spectral radius of general hypergraphs. J. Comb. Optim. 38 (2) (2019)
Liying Kang, Weihua Lu, Yezhou Wu, Dong Ye, Cun-Quan Zhang
Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs. Graphs Comb. 34 (2) (2018)
Erfang Shan, Yanxia Dong, Liying Kang, Shan Li
Extremal hypergraphs for matching number and domination number. Discret. Appl. Math. 236 (2018)
Lele Liu, Liying Kang, Erfang Shan
On the irregularity of uniform hypergraphs. Eur. J. Comb. 71 (2018)
Mao-cheng Cai, Liying Kang
A Characterization of Box-bounded Degree Sequences of Graphs. Graphs Comb. 34 (4) (2018)
Liying Kang, Erfang Shan
Trees with unique least central subtrees. Discuss. Math. Graph Theory 38 (3) (2018)
Liying Kang, Lele Liu, Liqun Qi, Xi-Ying Yuan
Spectral radii of two kinds of uniform hypergraphs. Appl. Math. Comput. 338 (2018)
Yanxia Dong, Erfang Shan, Liying Kang, Shan Li
Domination in intersecting hypergraphs. Discret. Appl. Math. 251 (2018)
Liying Kang, Jianjie Zhou, Erfang Shan
Algorithms for connected p-centdian problem on block graphs. J. Comb. Optim. 36 (1) (2018)
Shan Li, Liying Kang, Erfang Shan, Yanxia Dong
The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four. Graphs Comb. 34 (5) (2018)
Erfang Shan, Liying Kang
The w-centroids and least w-central subtrees in weighted trees. J. Comb. Optim. 36 (4) (2018)
Liying Kang, Lele Liu, Erfang Shan
Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees. Electron. J. Comb. 25 (2) (2018)
Chunsong Bai, Liying Kang, Erfang Shan
-center problem on cactus graphs. Theor. Comput. Sci. 749 (2018)
Li Su, Liying Kang, Honghai Li, Erfang Shan
The Matching Polynomials and Spectral Radii of Uniform Supertrees. Electron. J. Comb. 25 (4) (2018)
Chunsong Bai, Liying Kang
The 2-Median Problem on Cactus Graphs with Positive and Negative Weights. COCOA (1) (2017)
Liying Kang, Wei Zhang, Erfang Shan
The Spectral Radius and Domination Number of Uniform Hypergraphs. COCOA (2) (2017)
Liying Kang, Shan Li, Yanxia Dong, Erfang Shan
Matching and domination numbers in r-uniform hypergraphs. J. Comb. Optim. 34 (2) (2017)
Liying Kang, Nicholas C. Wormald
Minimum Power Dominating Sets of Random Cubic Graphs. J. Graph Theory 85 (1) (2017)
Zuosong Liang, Erfang Shan, Liying Kang
}-free planar graphs. Inf. Process. Lett. 118 (2017)
Guang Zhang, Erfang Shan, Liying Kang, Yanxia Dong
Two efficient values of cooperative games with graph structure based on τ-values. J. Comb. Optim. 34 (2) (2017)
Liying Kang, Yi Lin, Erfang Shan
Asymptotic sharpness of bounds on hypertrees. Discuss. Math. Graph Theory 37 (3) (2017)
Zuosong Liang, Erfang Shan, Liying Kang
Clique-Coloring Claw-Free Graphs. Graphs Comb. 32 (4) (2016)
Chunsong Bai, Liying Kang, Erfang Shan
The Connected p-Center Problem on Cactus Graphs. COCOA (2016)
Qi Wei, Liying Kang, Erfang Shan
Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties. J. Syst. Sci. Complex. 29 (2) (2016)
Zuosong Liang, Erfang Shan, Liying Kang
Clique-Perfectness of Claw-Free Planar Graphs. Graphs Comb. 32 (6) (2016)
Erfang Shan, Liying Kang
w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees. COCOA (2016)
Hongzhuan Wang, Liying Kang
Further properties on the degree distance of graphs. J. Comb. Optim. 31 (1) (2016)
Erfang Shan, Liying Kang
. Theor. Comput. Sci. 592 (2015)
Yanmei Hong, Liying Kang, Xingxing Yu
Nonseparating Cycles Avoiding Specific Vertices. J. Graph Theory 80 (4) (2015)
Na Yin, Liying Kang
Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration. Asia Pac. J. Oper. Res. 32 (6) (2015)
Liying Kang, Jianjie Zhou, Erfang Shan
The Connected p-Centdian Problem on Block Graphs. COCOA (2015)
Yanxia Dong, Erfang Shan, Liying Kang
Constructing the minimum dominating sets of generalized de Bruijn digraphs. Discret. Math. 338 (8) (2015)
Jianjie Zhou, Liying Kang, Erfang Shan
Two paths location of a tree with positive or negative weights. Theor. Comput. Sci. 607 (2015)
Liying Kang, Chunsong Bai, Erfang Shan, Kien Nguyen
The 2-maxian problem on cactus graphs. Discret. Optim. 13 (2014)
Erfang Shan, Zuosong Liang, Liying Kang
Clique-transversal sets and clique-coloring in planar graphs. Eur. J. Comb. 36 (2014)
Liying Kang, Vladimir Nikiforov
Extremal Problems for the p-Spectral Radius of Graphs. Electron. J. Comb. 21 (3) (2014)
Liying Kang, Dingguo Wang, Erfang Shan
}-free 4-regular graphs. Discret. Math. 332 (2014)
Jianjie Zhou, Liying Kang, Erfang Shan
Two Paths Location of a Tree with Positive or Negative Weights. COCOA (2014)
Na Yin, Liying Kang, Ping Ji, Ji-Bo Wang
Single machine scheduling with sum-of-logarithm-processing-times based deterioration. Inf. Sci. 274 (2014)
Qi Wei, Erfang Shan, Liying Kang
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs. Theor. Comput. Sci. 524 (2014)
Shenwei Huang, Liying Kang, Erfang Shan
Paired-Domination in Claw-Free Graphs. Graphs Comb. 29 (6) (2013)
Shouwei Guo, Liying Kang
Online scheduling of parallel jobs with preemption on two identical machines. Oper. Res. Lett. 41 (2) (2013)
Li-ying Hou, Liying Kang
Online scheduling on uniform machines with two hierarchies. J. Comb. Optim. 24 (4) (2012)
Shenwei Huang, Erfang Shan, Liying Kang
Perfect matchings in paired domination vertex critical graphs. J. Comb. Optim. 23 (4) (2012)
Yanmei Hong, Liying Kang
Backup 2-center on interval graphs. Theor. Comput. Sci. 445 (2012)
Yancai Zhao, Liying Kang, Moo Young Sohn
The algorithmic complexity of mixed domination in graphs. Theor. Comput. Sci. 412 (22) (2011)
Guangjun Xu, Liying Kang
On the power domination number of the generalized Petersen graphs. J. Comb. Optim. 22 (2) (2011)
Li-ying Hou, Liying Kang
Online and semi-online hierarchical scheduling for load balancing on uniform machines. Theor. Comput. Sci. 412 (12-14) (2011)
Hongxing Jiang, Liying Kang
Total restrained domination in claw-free graphs. J. Comb. Optim. 19 (1) (2010)
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) (2010)
Haichao Wang, Liying Kang
Matching Properties in Double domination Edge Critical Graphs. Discret. Math. Algorithms Appl. 2 (2) (2010)
Xiaoqin Zhang, Liying Kang, Yukun Cheng
The pos/neg-weighted median problem on block graphs with subgraph-shaped customers. Computing 88 (3-4) (2010)
Haichao Wang, Liying Kang, Erfang Shan
Signed clique-transversal functions in graphs. Int. J. Comput. Math. 87 (11) (2010)
Shouwei Guo, Liying Kang
Online scheduling of malleable parallel jobs with setup times on two identical machines. Eur. J. Oper. Res. 206 (3) (2010)
Yukun Cheng, Liying Kang
The p-maxian problem on interval graphs. Discret. Appl. Math. 158 (18) (2010)
Liying Kang, Yukun Cheng
-maxian problem on block graphs. J. Comb. Optim. 20 (2) (2010)
T. C. Edwin Cheng, Liying Kang, Erfang Shan
A polynomial-time algorithm for the paired-domination problem on permutation graphs. Discret. Appl. Math. 157 (2) (2009)
Hongxing Jiang, Liying Kang, Erfang Shan
Total Restrained Domination in Cubic Graphs. Graphs Comb. 25 (3) (2009)
Hong Yan, Liying Kang, Guangjun Xu
The exact domination number of the generalized Petersen graphs. Discret. Math. 309 (8) (2009)
Haichao Wang, Liying Kang, Erfang Shan
Matching Properties in Total Domination Vertex Critical Graphs. Graphs Comb. 25 (6) (2009)
Guangjun Xu, Liying Kang, Erfang Shan, Hong Yan
Proof of a conjecture on k-tuple domination in graphs. Appl. Math. Lett. 21 (3) (2008)
Michael A. Henning, Liying Kang, Erfang Shan, Anders Yeo
On matching and total domination in graphs. Discret. Math. 308 (11) (2008)
Erfang Shan, T. C. Edwin Cheng, Liying Kang
An application of the Turán theorem to domination in graphs. Discret. Appl. Math. 156 (14) (2008)
T. C. Edwin Cheng, Liying Kang, C. T. Ng
Paired domination on interval and circular-arc graphs. Discret. Appl. Math. 155 (16) (2007)
Erfang Shan, Liying Kang
Bondage number in oriented graphs. Ars Comb. 84 (2007)
T. C. Edwin Cheng, Liying Kang, C. T. Ng
An improved algorithm for the p-center problem on interval graphs with unit lengths. Comput. Oper. Res. 34 (8) (2007)

Liying Kang.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Liying Kang