Lower bounds on dominating functions in graphs. - Liying Kang; Erfang Shan (Ars Comb., 2000)

Upper minus domination in regular graphs. - Liying Kang; Mao-cheng Cai (Discret. Math., 2000)

Bondage number of planar graphs. - Liying Kang; Jinjiang Yuan (Discret. Math., 2000)

The number of vertices of degree k in a minimally k-edge-connected digraph. - Xudong Yuan; Liying Kang; Mao-cheng Cai (J. Graph Theory, 2000)

Upper bounds for the k-subdomination number of graphs. - Liying Kang; Chuangyin Dang; Mao-cheng Cai; Erfang Shan (Discret. Math., 2002)

Upper bounds on signed 2-independence number of graphs. - Erfang Shan; Moo Young Sohn; Liying Kang (Ars Comb., 2003)

Paired-domination of Trees. - Hong Qiao; Liying Kang; Mihaela Cardei; Ding-Zhu Du (J. Glob. Optim., 2003)

Lower bounds on the minus domination and k-subdomination numbers. - Liying Kang; Hong Qiao; Erfang Shan; Ding-Zhu Du (Theor. Comput. Sci., 2003)

A characterization of trees with equal total domination and paired-domination numbers. - Erfang Shan; Liying Kang; Michael A. Henning (Australas. J Comb., 2004)

A note on Nordhaus-Gaddum inequalities for domination. - Erfang Shan; Chuangyin Dang; Liying Kang (Discret. Appl. Math., 2004)

Minus domination number in k-partite graphs. - Liying Kang; Hye Kyung Kim; Moo Young Sohn (Discret. Math., 2004)

A note on balance vertices in trees. - Erfang Shan; Liying Kang (Discret. Math., 2004)

Batch-Processing Scheduling with Setup Times. - Chuangyin Dang; Liying Kang (J. Comb. Optim., 2004)

Due-date assignment and single machine scheduling with deteriorating jobs. - T. C. E. Cheng; Liying Kang; C. T. Ng 001 (J. Oper. Res. Soc., 2004)

Paired-domination in inflated graphs. - Liying Kang; Moo Young Sohn; T. C. Edwin Cheng (Theor. Comput. Sci., 2004)

Scheduling to Minimize Makespan with Time-Dependent Processing Times. - Liying Kang; T. C. Edwin Cheng; C. T. Ng 001; Min Zhao (ISAAC, 2005)

Bondage number of the discrete torus Cn×C4. - Liying Kang; Moo Young Sohn; Hye Kyung Kim (Discret. Math., 2005)

Total minus domination in k-partite graphs. - Liying Kang; Erfang Shan; Louis Caccetta (Discret. Math., 2006)

Power domination in graphs. - Min Zhao; Liying Kang; Gerard J. Chang (Discret. Math., 2006)

Acyclic domination on bipartite permutation graphs. - Guangjun Xu; Liying Kang; Erfang Shan (Inf. Process. Lett., 2006)

Power domination in block graphs. - Guangjun Xu; Liying Kang; Erfang Shan; Min Zhao (Theor. Comput. Sci., 2006)

The algorithmic complexity of the minus clique-transversal problem. - Guangjun Xu; Erfang Shan; Liying Kang; T. C. Edwin Cheng (Appl. Math. Comput., 2007)

Bondage number in oriented graphs. - Erfang Shan; Liying Kang (Ars Comb., 2007)

An improved algorithm for the p-center problem on interval graphs with unit lengths. - T. C. Edwin Cheng; Liying Kang; C. T. Ng 001 (Comput. Oper. Res., 2007)

Paired domination on interval and circular-arc graphs. - T. C. Edwin Cheng; Liying Kang; C. T. Ng 001 (Discret. Appl. Math., 2007)

Absorbant of generalized de Bruijn digraphs. - Erfang Shan; T. C. Edwin Cheng; Liying Kang (Inf. Process. Lett., 2007)

Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". - Erfang Shan; Liying Kang; Michael A. Henning (J. Graph Theory, 2007)

Proof of a conjecture on k-tuple domination in graphs. - Guangjun Xu; Liying Kang; Erfang Shan; Hong Yan 002 (Appl. Math. Lett., 2008)

An application of the Turán theorem to domination in graphs. - Erfang Shan; T. C. Edwin Cheng; Liying Kang (Discret. Appl. Math., 2008)

On matching and total domination in graphs. - Michael A. Henning; Liying Kang; Erfang Shan; Anders Yeo (Discret. Math., 2008)

A polynomial-time algorithm for the paired-domination problem on permutation graphs. - T. C. Edwin Cheng; Liying Kang; Erfang Shan (Discret. Appl. Math., 2009)

The exact domination number of the generalized Petersen graphs. - Hong Yan 002; Liying Kang; Guangjun Xu (Discret. Math., 2009)

Total Restrained Domination in Cubic Graphs. - Hongxing Jiang; Liying Kang; Erfang Shan (Graphs Comb., 2009)

Matching Properties in Total Domination Vertex Critical Graphs. - Haichao Wang 004; Liying Kang; Erfang Shan (Graphs Comb., 2009)

The pos/neg-weighted median problem on block graphs with subgraph-shaped customers. - Xiaoqin Zhang; Liying Kang; Yukun Cheng (Computing, 2010)

The p-maxian problem on interval graphs. - Yukun Cheng; Liying Kang (Discret. Appl. Math., 2010)

Matching Properties in Double domination Edge Critical Graphs. - Haichao Wang 004; Liying Kang (Discret. Math. Algorithms Appl., 2010)

Online scheduling of malleable parallel jobs with setup times on two identical machines. - Shouwei Guo; Liying Kang (Eur. J. Oper. Res., 2010)

Signed clique-transversal functions in graphs. - Haichao Wang 004; Liying Kang; Erfang Shan (Int. J. Comput. Math., 2010)

Total restrained domination in claw-free graphs. - Hongxing Jiang; Liying Kang (J. Comb. Optim., 2010)

The p-maxian problem on block graphs. - Liying Kang; Yukun Cheng (J. Comb. Optim., 2010)

The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers. - Yukun Cheng; Liying Kang; Changhong Lu (Theor. Comput. Sci., 2010)

On the power domination number of the generalized Petersen graphs. - Guangjun Xu; Liying Kang (J. Comb. Optim., 2011)

Online and semi-online hierarchical scheduling for load balancing on uniform machines. - Li-ying Hou; Liying Kang (Theor. Comput. Sci., 2011)

The algorithmic complexity of mixed domination in graphs. - Yancai Zhao; Liying Kang; Moo Young Sohn (Theor. Comput. Sci., 2011)

Online scheduling on uniform machines with two hierarchies. - Li-ying Hou; Liying Kang (J. Comb. Optim., 2012)

Perfect matchings in paired domination vertex critical graphs. - Shenwei Huang; Erfang Shan; Liying Kang (J. Comb. Optim., 2012)

Backup 2-center on interval graphs. - Yanmei Hong; Liying Kang (Theor. Comput. Sci., 2012)

Paired-Domination in Claw-Free Graphs. - Shenwei Huang; Liying Kang; Erfang Shan (Graphs Comb., 2013)

Online scheduling of parallel jobs with preemption on two identical machines. - Shouwei Guo; Liying Kang (Oper. Res. Lett., 2013)

Extremal Problems for the p-Spectral Radius of Graphs. - Liying Kang; Vladimir Nikiforov 001 (Electron. J. Comb., 2014)

The 2-maxian problem on cactus graphs. - Liying Kang; Chunsong Bai; Erfang Shan; Kien Nguyen (Discret. Optim., 2014)

Independent sets in {claw, K4}-free 4-regular graphs. - Liying Kang; Dingguo Wang; Erfang Shan (Discret. Math., 2014)

Clique-transversal sets and clique-coloring in planar graphs. - Erfang Shan; Zuosong Liang; Liying Kang (Eur. J. Comb., 2014)

Single machine scheduling with sum-of-logarithm-processing-times based deterioration. - Na Yin; Liying Kang; Ping Ji 001; Ji-Bo Wang (Inf. Sci., 2014)

A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs. - Qi Wei 007; Erfang Shan; Liying Kang (Theor. Comput. Sci., 2014)

The Connected p-Centdian Problem on Block Graphs. - Liying Kang; Jianjie Zhou; Erfang Shan (COCOA, 2015)

Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration. - Na Yin; Liying Kang (Asia Pac. J. Oper. Res., 2015)

Constructing the minimum dominating sets of generalized de Bruijn digraphs. - Yanxia Dong; Erfang Shan; Liying Kang (Discret. Math., 2015)

Nonseparating Cycles Avoiding Specific Vertices. - Yanmei Hong; Liying Kang; Xingxing Yu (J. Graph Theory, 2015)

Coloring clique-hypergraphs of graphs with no subdivision of K5. - Erfang Shan; Liying Kang (Theor. Comput. Sci., 2015)

Two paths location of a tree with positive or negative weights. - Jianjie Zhou; Liying Kang; Erfang Shan (Theor. Comput. Sci., 2015)

The Connected p-Center Problem on Cactus Graphs. - Chunsong Bai; Liying Kang; Erfang Shan (COCOA, 2016)

w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees. - Erfang Shan; Liying Kang (COCOA, 2016)

Clique-Coloring Claw-Free Graphs. - Zuosong Liang; Erfang Shan; Liying Kang (Graphs Comb., 2016)

Clique-Perfectness of Claw-Free Planar Graphs. - Zuosong Liang; Erfang Shan; Liying Kang (Graphs Comb., 2016)

Further properties on the degree distance of graphs. - Hongzhuan Wang; Liying Kang (J. Comb. Optim., 2016)

Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties. - Qi Wei 007; Liying Kang; Erfang Shan (J. Syst. Sci. Complex., 2016)

The 2-Median Problem on Cactus Graphs with Positive and Negative Weights. - Chunsong Bai; Liying Kang (COCOA (1), 2017)

The Spectral Radius and Domination Number of Uniform Hypergraphs. - Liying Kang; Wei Zhang 172; Erfang Shan (COCOA (2), 2017)

Asymptotic sharpness of bounds on hypertrees. - Liying Kang; Yi Lin; Erfang Shan (Discuss. Math. Graph Theory, 2017)

The clique-transversal set problem in {claw, K4}-free planar graphs. - Zuosong Liang; Erfang Shan; Liying Kang (Inf. Process. Lett., 2017)

Matching and domination numbers in r-uniform hypergraphs. - Liying Kang; Shan Li; Yanxia Dong; Erfang Shan (J. Comb. Optim., 2017)

Two efficient values of cooperative games with graph structure based on τ-values. - Guang Zhang; Erfang Shan; Liying Kang; Yanxia Dong (J. Comb. Optim., 2017)

Minimum Power Dominating Sets of Random Cubic Graphs. - Liying Kang; Nicholas C. Wormald (J. Graph Theory, 2017)

Spectral radii of two kinds of uniform hypergraphs. - Liying Kang; Lele Liu; Liqun Qi 001; Xi-Ying Yuan (Appl. Math. Comput., 2018)

Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees. - Liying Kang; Lele Liu; Erfang Shan (Electron. J. Comb., 2018)

The Matching Polynomials and Spectral Radii of Uniform Supertrees. - Li Su; Liying Kang; Honghai Li; Erfang Shan (Electron. J. Comb., 2018)

Domination in intersecting hypergraphs. - Yanxia Dong; Erfang Shan; Liying Kang; Shan Li (Discret. Appl. Math., 2018)

Extremal hypergraphs for matching number and domination number. - Erfang Shan; Yanxia Dong; Liying Kang; Shan Li (Discret. Appl. Math., 2018)

Trees with unique least central subtrees. - Liying Kang; Erfang Shan (Discuss. Math. Graph Theory, 2018)

On the irregularity of uniform hypergraphs. - Lele Liu; Liying Kang; Erfang Shan (Eur. J. Comb., 2018)

A Characterization of Box-bounded Degree Sequences of Graphs. - Mao-cheng Cai; Liying Kang (Graphs Comb., 2018)

Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs. - Liying Kang; Weihua Lu; Yezhou Wu; Dong Ye 002; Cun-Quan Zhang (Graphs Comb., 2018)

The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four. - Shan Li; Liying Kang; Erfang Shan; Yanxia Dong (Graphs Comb., 2018)

Algorithms for connected p-centdian problem on block graphs. - Liying Kang; Jianjie Zhou; Erfang Shan (J. Comb. Optim., 2018)

The w-centroids and least w-central subtrees in weighted trees. - Erfang Shan; Liying Kang (J. Comb. Optim., 2018)

The connected p-center problem on cactus graphs. - Chunsong Bai; Liying Kang; Erfang Shan (Theor. Comput. Sci., 2018)

The extremal α-index of outerplanar and planar graphs. - Zhangqing Yu; Liying Kang; Lele Liu; Erfang Shan (Appl. Math. Comput., 2019)

Bounds on the spectral radius of uniform hypergraphs. - Lele Liu; Liying Kang; Shuliang Bai (Discret. Appl. Math., 2019)

Maximally connected p-partite uniform hypergraphs. - Erfang Shan; Jing Zhao; Liying Kang (Discret. Appl. Math., 2019)

The eigenvectors to the p-spectral radius of general hypergraphs. - Liying Kang; Lele Liu; Erfang Shan (J. Comb. Optim., 2019)

The clique-perfectness and clique-coloring of outer-planar graphs. - Zuosong Liang; Erfang Shan; Liying Kang (J. Comb. Optim., 2019)

The α-spectral radius of uniform hypergraphs concerning degrees and domination number. - Qiannan Wang; Liying Kang; Erfang Shan; Zuosong Liang (J. Comb. Optim., 2019)

Saturation Number of Berge Stars in Random Hypergraphs. - Lele Liu; Changxiang He; Liying Kang (Electron. J. Comb., 2020)

Power domination in the generalized Petersen graphs. - Liying Kang; Erfang Shan; Min Zhao (Discuss. Math. Graph Theory, 2020)

Extremal Graphs for Blow-Ups of Keyrings. - Zhenyu Ni; Liying Kang; Erfang Shan; Hui Zhu 008 (Graphs Comb., 2020)

Extremal Graphs for Odd-Ballooning of Paths and Cycles. - Hui Zhu 008; Liying Kang; Erfang Shan (Graphs Comb., 2020)

The Turán Number of Berge-K4 in 3-Uniform Hypergraphs. - Hui Zhu 008; Liying Kang; Zhenyu Ni; Erfang Shan (SIAM J. Discret. Math., 2020)

Extremal graphs for blow-ups of stars and paths. - Liying Kang; Hui Zhu 008; Erfang Shan (Discret. Appl. Math., 2021)

Decomposing uniform hypergraphs into uniform hypertrees and single edges. - Liying Kang; Zhenyu Ni; Erfang Shan (Discret. Math., 2021)

On a Conjecture for Power Domination. - Min Zhao; Erfang Shan; Liying Kang (Graphs Comb., 2021)

The spectral radius and domination number in linear uniform hypergraphs. - Liying Kang; Wei Zhang 172; Erfang Shan (J. Comb. Optim., 2021)

The principal eigenvector to α-spectral radius of hypergraphs. - Jing Wang; Liying Kang; Erfang Shan (J. Comb. Optim., 2021)

The average tree value for hypergraph games. - Liying Kang; Anna B. Khmelnitskaya; Erfang Shan; Dolf Talman; Guang Zhang (Math. Methods Oper. Res., 2021)

The Turán number of Berge-matching in hypergraphs. - Liying Kang; Zhenyu Ni; Erfang Shan (Discret. Math., 2022)

Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs. - Yisai Xue; Erfang Shan; Liying Kang (Discret. Math., 2022)

Solution to a Forcible Version of a Graphic Sequence Problem. - Mao-cheng Cai; Liying Kang (Graphs Comb., 2022)

Spectral Extremal Graphs for Disjoint Cliques. - Zhenyu Ni; Jing Wang; Liying Kang (Electron. J. Comb., 2023)

On a conjecture of spectral extremal problems. - Jing Wang; Liying Kang; Yisai Xue (J. Comb. Theory B, 2023)

The two-step average tree value for graph and hypergraph games. - Liying Kang; Anna B. Khmelnitskaya; Erfang Shan; Dolf Talman; Guang Zhang (Ann. Oper. Res., 2023)

Some sufficient conditions for graphs being k-leaf-connected. - Jiadong Wu; Yisai Xue; Liying Kang (Discret. Appl. Math., 2023)

GPT4Rec: Graph Prompt Tuning for Streaming Recommendation. - Peiyan Zhang; Yuchen Yan; Xi Zhang 008; Liying Kang; Chaozhuo Li; Feiran Huang; Senzhang Wang; Sunghun Kim 001 (SIGIR, 2024)

High-Frequency-aware Hierarchical Contrastive Selective Coding for Representation Learning on Text Attributed Graphs. - Peiyan Zhang; Chaozhuo Li; Liying Kang; Feiran Huang; Senzhang Wang; Xing Xie 001; Sunghun Kim 001 (WWW, 2024)

Spectral conditions for matching extension. - Jiadong Wu; Jing Wang; Liying Kang (Appl. Math. Comput., 2024)

Spectral Turán-Type Problems on Cancellative Hypergraphs. - Zhenyu Ni; Lele Liu; Liying Kang (Electron. J. Comb., 2024)

Revolve: Optimizing AI Systems by Tracking Response Evolution in Textual Optimization. - Peiyan Zhang; Haibo Jin; Leyang Hu; Xinnuo Li; Liying Kang; Man Luo; Yangqiu Song; Haohan Wang (CoRR, 2024)

Extremal graphs without long paths and a given graph. - Yichong Liu; Liying Kang (Discret. Math., 2024)

Spectral extremal graphs for edge blow-up of star forests. - Jing Wang; Zhenyu Ni; Liying Kang; Yi-zheng Fan (Discret. Math., 2024)

The Turán number of Berge hypergraphs with stable properties. - Erfang Shan; Liying Kang; Yisai Xue (Discret. Math., 2024)

Generalized Turán results for edge blow-up of star forests. - Yuanpei Wang; Zhenyu Ni; Yichong Liu; Liying Kang (Discret. Math., 2024)

Stability of Generalized Turán Number for Linear Forests. - Yisai Xue; Yichong Liu; Liying Kang (Graphs Comb., 2024)

On generalized Turán number of graphs with bounded matching number. - Yisai Xue; Liying Kang (Discret. Appl. Math., 2025)

Extremal graphs for star forests with bounded clique number. - Yongchun Lu; Yichong Liu; Liying Kang (Discret. Math., 2025)

Spectral bipartite Turán problems on linear hypergraphs. - Chuan-Ming She; Yi-Zheng Fan; Liying Kang (Discret. Math., 2025)

GuardVal: Dynamic Large Language Model Jailbreak Evaluation for Comprehensive Safety Testing. - Peiyan Zhang; Haibo Jin; Liying Kang; Haohan Wang (CoRR, 2025)

On spectral radius of planar graphs with fixed size. - Liangdong Fan; Liying Kang; Jiadong Wu (Discret. Math., 2026)