Liying Kang

Orcid: 0009-0003-7715-8519

According to our database1, Liying Kang authored at least 121 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Stability of Generalized Turán Number for Linear Forests.
Graphs Comb., May, 2024

Generalized Turán results for edge blow-up of star forests.
Discret. Math., January, 2024

The Turán number of Berge hypergraphs with stable properties.
Discret. Math., January, 2024

Spectral extremal graphs for edge blow-up of star forests.
Discret. Math., 2024

Extremal graphs without long paths and a given graph.
Discret. Math., 2024

Spectral Turán-Type Problems on Cancellative Hypergraphs.
Electron. J. Comb., 2024

Spectral conditions for matching extension.
Appl. Math. Comput., 2024

High-Frequency-aware Hierarchical Contrastive Selective Coding for Representation Learning on Text Attributed Graphs.
Proceedings of the ACM on Web Conference 2024, 2024

GPT4Rec: Graph Prompt Tuning for Streaming Recommendation.
Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2024

2023
Some sufficient conditions for graphs being k-leaf-connected.
Discret. Appl. Math., November, 2023

The two-step average tree value for graph and hypergraph games.
Ann. Oper. Res., April, 2023

On a conjecture of spectral extremal problems.
J. Comb. Theory B, March, 2023

Spectral Extremal Graphs for Disjoint Cliques.
Electron. J. Comb., 2023

2022
Solution to a Forcible Version of a Graphic Sequence Problem.
Graphs Comb., 2022

Anti-Ramsey number of matchings in <i>r</i>-partite <i>r</i>-uniform hypergraphs.
Discret. Math., 2022

The Turán number of Berge-matching in hypergraphs.
Discret. Math., 2022

2021
The average tree value for hypergraph games.
Math. Methods Oper. Res., 2021

The principal eigenvector to α-spectral radius of hypergraphs.
J. Comb. Optim., 2021

The spectral radius and domination number in linear uniform hypergraphs.
J. Comb. Optim., 2021

On a Conjecture for Power Domination.
Graphs Comb., 2021

Decomposing uniform hypergraphs into uniform hypertrees and single edges.
Discret. Math., 2021

Extremal graphs for blow-ups of stars and paths.
Discret. Appl. Math., 2021

2020
The Turán Number of Berge-K<sub>4</sub> in 3-Uniform Hypergraphs.
SIAM J. Discret. Math., 2020

Extremal Graphs for Odd-Ballooning of Paths and Cycles.
Graphs Comb., 2020

Extremal Graphs for Blow-Ups of Keyrings.
Graphs Comb., 2020

Power domination in the generalized Petersen graphs.
Discuss. Math. Graph Theory, 2020

Saturation Number of Berge Stars in Random Hypergraphs.
Electron. J. Comb., 2020

2019
The α-spectral radius of uniform hypergraphs concerning degrees and domination number.
J. Comb. Optim., 2019

The clique-perfectness and clique-coloring of outer-planar graphs.
J. Comb. Optim., 2019

The eigenvectors to the p-spectral radius of general hypergraphs.
J. Comb. Optim., 2019

Maximally connected p-partite uniform hypergraphs.
Discret. Appl. Math., 2019

Bounds on the spectral radius of uniform hypergraphs.
Discret. Appl. Math., 2019

The extremal <i>α</i>-index of outerplanar and planar graphs.
Appl. Math. Comput., 2019

2018
The connected <i>p</i>-center problem on cactus graphs.
Theor. Comput. Sci., 2018

The w-centroids and least w-central subtrees in weighted trees.
J. Comb. Optim., 2018

Algorithms for connected p-centdian problem on block graphs.
J. Comb. Optim., 2018

The Finite Projective Plane and the 5-Uniform Linear Intersecting Hypergraphs with Domination Number Four.
Graphs Comb., 2018

Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs.
Graphs Comb., 2018

A Characterization of Box-bounded Degree Sequences of Graphs.
Graphs Comb., 2018

On the irregularity of uniform hypergraphs.
Eur. J. Comb., 2018

Trees with unique least central subtrees.
Discuss. Math. Graph Theory, 2018

Extremal hypergraphs for matching number and domination number.
Discret. Appl. Math., 2018

Domination in intersecting hypergraphs.
Discret. Appl. Math., 2018

The Matching Polynomials and Spectral Radii of Uniform Supertrees.
Electron. J. Comb., 2018

Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees.
Electron. J. Comb., 2018

Spectral radii of two kinds of uniform hypergraphs.
Appl. Math. Comput., 2018

2017
Minimum Power Dominating Sets of Random Cubic Graphs.
J. Graph Theory, 2017

Two efficient values of cooperative games with graph structure based on τ-values.
J. Comb. Optim., 2017

Matching and domination numbers in r-uniform hypergraphs.
J. Comb. Optim., 2017

The clique-transversal set problem in {claw, K<sub>4</sub>}-free planar graphs.
Inf. Process. Lett., 2017

Asymptotic sharpness of bounds on hypertrees.
Discuss. Math. Graph Theory, 2017

The Spectral Radius and Domination Number of Uniform Hypergraphs.
Proceedings of the Combinatorial Optimization and Applications, 2017

The 2-Median Problem on Cactus Graphs with Positive and Negative Weights.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties.
J. Syst. Sci. Complex., 2016

Further properties on the degree distance of graphs.
J. Comb. Optim., 2016

Clique-Perfectness of Claw-Free Planar Graphs.
Graphs Comb., 2016

Clique-Coloring Claw-Free Graphs.
Graphs Comb., 2016

w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees.
Proceedings of the Combinatorial Optimization and Applications, 2016

The Connected p-Center Problem on Cactus Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Two paths location of a tree with positive or negative weights.
Theor. Comput. Sci., 2015

Coloring clique-hypergraphs of graphs with no subdivision of <sub>K</sub><sub>5</sub>.
Theor. Comput. Sci., 2015

Nonseparating Cycles Avoiding Specific Vertices.
J. Graph Theory, 2015

Constructing the minimum dominating sets of generalized de Bruijn digraphs.
Discret. Math., 2015

Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration.
Asia Pac. J. Oper. Res., 2015

The Connected p-Centdian Problem on Block Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2015

2014
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs.
Theor. Comput. Sci., 2014

Single machine scheduling with sum-of-logarithm-processing-times based deterioration.
Inf. Sci., 2014

Clique-transversal sets and clique-coloring in planar graphs.
Eur. J. Comb., 2014

Independent sets in {claw, K<sub>4</sub>}-free 4-regular graphs.
Discret. Math., 2014

The 2-maxian problem on cactus graphs.
Discret. Optim., 2014

Extremal Problems for the p-Spectral Radius of Graphs.
Electron. J. Comb., 2014

2013
Online scheduling of parallel jobs with preemption on two identical machines.
Oper. Res. Lett., 2013

Paired-Domination in Claw-Free Graphs.
Graphs Comb., 2013

2012
Backup 2-center on interval graphs.
Theor. Comput. Sci., 2012

Perfect matchings in paired domination vertex critical graphs.
J. Comb. Optim., 2012

Online scheduling on uniform machines with two hierarchies.
J. Comb. Optim., 2012

2011
The algorithmic complexity of mixed domination in graphs.
Theor. Comput. Sci., 2011

Online and semi-online hierarchical scheduling for load balancing on uniform machines.
Theor. Comput. Sci., 2011

On the power domination number of the generalized Petersen graphs.
J. Comb. Optim., 2011

2010
The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers.
Theor. Comput. Sci., 2010

The <i>p</i>-maxian problem on block graphs.
J. Comb. Optim., 2010

Total restrained domination in claw-free graphs.
J. Comb. Optim., 2010

Signed clique-transversal functions in graphs.
Int. J. Comput. Math., 2010

Online scheduling of malleable parallel jobs with setup times on two identical machines.
Eur. J. Oper. Res., 2010

Matching Properties in Double domination Edge Critical Graphs.
Discret. Math. Algorithms Appl., 2010

The p-maxian problem on interval graphs.
Discret. Appl. Math., 2010

The pos/neg-weighted median problem on block graphs with subgraph-shaped customers.
Computing, 2010

2009
Matching Properties in Total Domination Vertex Critical Graphs.
Graphs Comb., 2009

Total Restrained Domination in Cubic Graphs.
Graphs Comb., 2009

The exact domination number of the generalized Petersen graphs.
Discret. Math., 2009

A polynomial-time algorithm for the paired-domination problem on permutation graphs.
Discret. Appl. Math., 2009

2008
On matching and total domination in graphs.
Discret. Math., 2008

An application of the Turán theorem to domination in graphs.
Discret. Appl. Math., 2008

Proof of a conjecture on k-tuple domination in graphs.
Appl. Math. Lett., 2008

2007
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph".
J. Graph Theory, 2007

Absorbant of generalized de Bruijn digraphs.
Inf. Process. Lett., 2007

Paired domination on interval and circular-arc graphs.
Discret. Appl. Math., 2007

An improved algorithm for the p-center problem on interval graphs with unit lengths.
Comput. Oper. Res., 2007

Bondage number in oriented graphs.
Ars Comb., 2007

The algorithmic complexity of the minus clique-transversal problem.
Appl. Math. Comput., 2007

2006
Power domination in block graphs.
Theor. Comput. Sci., 2006

Acyclic domination on bipartite permutation graphs.
Inf. Process. Lett., 2006

Power domination in graphs.
Discret. Math., 2006

Total minus domination in k-partite graphs.
Discret. Math., 2006

2005
Bondage number of the discrete torus <i>C</i><sub><i>n</i></sub>×<i>C</i><sub>4</sub>.
Discret. Math., 2005

Scheduling to Minimize Makespan with Time-Dependent Processing Times.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
Paired-domination in inflated graphs.
Theor. Comput. Sci., 2004

Due-date assignment and single machine scheduling with deteriorating jobs.
J. Oper. Res. Soc., 2004

Batch-Processing Scheduling with Setup Times.
J. Comb. Optim., 2004

A note on balance vertices in trees.
Discret. Math., 2004

Minus domination number in k-partite graphs.
Discret. Math., 2004

A note on Nordhaus-Gaddum inequalities for domination.
Discret. Appl. Math., 2004

A characterization of trees with equal total domination and paired-domination numbers.
Australas. J Comb., 2004

2003
Lower bounds on the minus domination and k-subdomination numbers.
Theor. Comput. Sci., 2003

Paired-domination of Trees.
J. Glob. Optim., 2003

Upper bounds on signed 2-independence number of graphs.
Ars Comb., 2003

2002
Upper bounds for the <i>k</i>-subdomination number of graphs.
Discret. Math., 2002

2000
The number of vertices of degree <i>k</i> in a minimally <i>k</i>-edge-connected digraph.
J. Graph Theory, 2000

Bondage number of planar graphs.
Discret. Math., 2000

Upper minus domination in regular graphs.
Discret. Math., 2000

Lower bounds on dominating functions in graphs.
Ars Comb., 2000


  Loading...