Liying Kang

Discret. Math., 2026

Many cliques in graphs with bounded matching number and circumference.

[BibT_eX]

[DOI]

Yongchun Lu

Discret. Math., 2026

Spectral Turán problems on the expansion of matchings.

[BibT_eX]

[DOI]

Discret. Math., 2026

On spectral radius of planar graphs with fixed size.

[BibT_eX]

[DOI]

Liangdong Fan

Jiadong Wu

Discret. Math., 2026

A note on large cliques in graphs.

[BibT_eX]

[DOI]

Shenwei Huang

Yan Jin

Discret. Appl. Math., 2026

2025

Advancing Session-Based Recommendations with Atten-Mixer+: Dynamic and Adaptive Multi-Level Intent Mining.

[BibT_eX]

[DOI]

ACM Trans. Intell. Syst. Technol., October, 2025

GuardVal: Dynamic Large Language Model Jailbreak Evaluation for Comprehensive Safety Testing.

[BibT_eX]

[DOI]

CoRR, July, 2025

Spectral bipartite Turán problems on linear hypergraphs.

[BibT_eX]

[DOI]

Chuan-Ming She

Yi-Zheng Fan

Discret. Math., 2025

Extremal graphs for star forests with bounded clique number.

[BibT_eX]

[DOI]

Yongchun Lu

Yichong Liu

Discret. Math., 2025

On generalized Turán number of graphs with bounded matching number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2025

Revolve: Optimizing AI Systems by Tracking Response Evolution in Textual Optimization.

[BibT_eX]

[DOI]

Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024

Stability of Generalized Turán Number for Linear Forests.

[BibT_eX]

[DOI]

Yichong Liu

Graphs Comb., May, 2024

Generalized Turán results for edge blow-up of star forests.

[BibT_eX]

[DOI]

Discret. Math., January, 2024

The Turán number of Berge hypergraphs with stable properties.

[BibT_eX]

[DOI]

Discret. Math., January, 2024

Spectral extremal graphs for edge blow-up of star forests.

[BibT_eX]

[DOI]

Discret. Math., 2024

Extremal graphs without long paths and a given graph.

[BibT_eX]

[DOI]

Yichong Liu

Discret. Math., 2024

Spectral Turán-Type Problems on Cancellative Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Spectral conditions for matching extension.

[BibT_eX]

[DOI]

Jiadong Wu

Appl. Math. Comput., 2024

High-Frequency-aware Hierarchical Contrastive Selective Coding for Representation Learning on Text Attributed Graphs.

[BibT_eX]

[DOI]

Proceedings of the ACM on Web Conference 2024, 2024

GPT4Rec: Graph Prompt Tuning for Streaming Recommendation.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Jiadong Wu

Discret. Appl. Math., November, 2023

The two-step average tree value for graph and hypergraph games.

[BibT_eX]

[DOI]

Anna B. Khmelnitskaya

Dolf Talman

Guang Zhang

Ann. Oper. Res., April, 2023

On a conjecture of spectral extremal problems.

[BibT_eX]

[DOI]

J. Comb. Theory B, March, 2023

Spectral Extremal Graphs for Disjoint Cliques.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

Solution to a Forcible Version of a Graphic Sequence Problem.

[BibT_eX]

[DOI]

Graphs Comb., 2022

Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

The Turán number of Berge-matching in hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

The average tree value for hypergraph games.

[BibT_eX]

[DOI]

Anna B. Khmelnitskaya

Dolf Talman

Guang Zhang

Math. Methods Oper. Res., 2021

The principal eigenvector to α-spectral radius of hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

The spectral radius and domination number in linear uniform hypergraphs.

[BibT_eX]

[DOI]

Wei Zhang

J. Comb. Optim., 2021

On a Conjecture for Power Domination.

[BibT_eX]

[DOI]

Min Zhao

Graphs Comb., 2021

Decomposing uniform hypergraphs into uniform hypertrees and single edges.

[BibT_eX]

[DOI]

Discret. Math., 2021

Extremal graphs for blow-ups of stars and paths.

[BibT_eX]

[DOI]

Hui Zhu

Discret. Appl. Math., 2021

2020

The Turán Number of Berge-K4 in 3-Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Extremal Graphs for Odd-Ballooning of Paths and Cycles.

[BibT_eX]

[DOI]

Hui Zhu

Graphs Comb., 2020

Extremal Graphs for Blow-Ups of Keyrings.

[BibT_eX]

[DOI]

Graphs Comb., 2020

Power domination in the generalized Petersen graphs.

[BibT_eX]

[DOI]

Min Zhao

Discuss. Math. Graph Theory, 2020

Saturation Number of Berge Stars in Random Hypergraphs.

[BibT_eX]

[DOI]

Changxiang He

Electron. J. Comb., 2020

2019

The α-spectral radius of uniform hypergraphs concerning degrees and domination number.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

The clique-perfectness and clique-coloring of outer-planar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

The eigenvectors to the p-spectral radius of general hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

Maximally connected p-partite uniform hypergraphs.

[BibT_eX]

[DOI]

Jing Zhao

Discret. Appl. Math., 2019

Bounds on the spectral radius of uniform hypergraphs.

[BibT_eX]

[DOI]

Shuliang Bai

Discret. Appl. Math., 2019

The extremal α-index of outerplanar and planar graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

2018

The connected p-center problem on cactus graphs.

[BibT_eX]

[DOI]

Chunsong Bai

Theor. Comput. Sci., 2018

The w-centroids and least w-central subtrees in weighted trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Algorithms for connected p-centdian problem on block graphs.

[BibT_eX]

[DOI]

Jianjie Zhou

J. Comb. Optim., 2018

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

[BibT_eX]

[DOI]

Graphs Comb., 2018

Circuit Decompositions and Shortest Circuit Coverings of Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2018

A Characterization of Box-bounded Degree Sequences of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2018

On the irregularity of uniform hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Trees with unique least central subtrees.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2018

Extremal hypergraphs for matching number and domination number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Domination in intersecting hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

The Matching Polynomials and Spectral Radii of Uniform Supertrees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Sharp Lower Bounds on the Spectral Radius of Uniform Hypergraphs Concerning Degrees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

Spectral radii of two kinds of uniform hypergraphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

Minimum Power Dominating Sets of Random Cubic Graphs.

[BibT_eX]

[DOI]

Nicholas C. Wormald

J. Graph Theory, 2017

Two efficient values of cooperative games with graph structure based on τ-values.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Matching and domination numbers in r-uniform hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

The clique-transversal set problem in {claw, K4}-free planar graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Asymptotic sharpness of bounds on hypertrees.

[BibT_eX]

[DOI]

Yi Lin

Discuss. Math. Graph Theory, 2017

The Spectral Radius and Domination Number of Uniform Hypergraphs.

[BibT_eX]

[DOI]

Wei Zhang

Proceedings of the Combinatorial Optimization and Applications, 2017

The 2-Median Problem on Cactus Graphs with Positive and Negative Weights.

[BibT_eX]

[DOI]

Chunsong Bai

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Batching Scheduling in a Two-Level Supply Chain with Earliness and Tardiness Penalties.

[BibT_eX]

[DOI]

Qi Wei

J. Syst. Sci. Complex., 2016

Further properties on the degree distance of graphs.

[BibT_eX]

[DOI]

Hongzhuan Wang

J. Comb. Optim., 2016

Clique-Perfectness of Claw-Free Planar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Clique-Coloring Claw-Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

The Connected p-Center Problem on Cactus Graphs.

[BibT_eX]

[DOI]

Chunsong Bai

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Coloring clique-hypergraphs of graphs with no subdivision of K5.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Nonseparating Cycles Avoiding Specific Vertices.

[BibT_eX]

[DOI]

Yanmei Hong

Xingxing Yu

J. Graph Theory, 2015

Constructing the minimum dominating sets of generalized de Bruijn digraphs.

[BibT_eX]

[DOI]

Yanxia Dong

Discret. Math., 2015

Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration.

[BibT_eX]

[DOI]

Na Yin

Asia Pac. J. Oper. Res., 2015

The Connected p-Centdian Problem on Block Graphs.

[BibT_eX]

[DOI]

Jianjie Zhou

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.

[BibT_eX]

[DOI]

Qi Wei

Theor. Comput. Sci., 2014

Single machine scheduling with sum-of-logarithm-processing-times based deterioration.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Clique-transversal sets and clique-coloring in planar graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Independent sets in {claw, K4}-free 4-regular graphs.

[BibT_eX]

[DOI]

Dingguo Wang

Discret. Math., 2014

The 2-maxian problem on cactus graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2014

Extremal Problems for the p-Spectral Radius of Graphs.

[BibT_eX]

[DOI]

Vladimir Nikiforov

Electron. J. Comb., 2014

Two Paths Location of a Tree with Positive or Negative Weights.

[BibT_eX]

[DOI]

Jianjie Zhou

Proceedings of the Combinatorial Optimization and Applications, 2014

2013

Online scheduling of parallel jobs with preemption on two identical machines.

[BibT_eX]

[DOI]

Shouwei Guo

Oper. Res. Lett., 2013

Paired-Domination in Claw-Free Graphs.

[BibT_eX]

[DOI]

Shenwei Huang

Graphs Comb., 2013

2012

Backup 2-center on interval graphs.

[BibT_eX]

[DOI]

Yanmei Hong

Theor. Comput. Sci., 2012

Perfect matchings in paired domination vertex critical graphs.

[BibT_eX]

[DOI]

Shenwei Huang

J. Comb. Optim., 2012

Online scheduling on uniform machines with two hierarchies.

[BibT_eX]

[DOI]

Li-ying Hou

J. Comb. Optim., 2012

2011

The algorithmic complexity of mixed domination in graphs.

[BibT_eX]

[DOI]

Yancai Zhao

Theor. Comput. Sci., 2011

Online and semi-online hierarchical scheduling for load balancing on uniform machines.

[BibT_eX]

[DOI]

Li-ying Hou

Theor. Comput. Sci., 2011

On the power domination number of the generalized Petersen graphs.

[BibT_eX]

[DOI]

Guangjun Xu

J. Comb. Optim., 2011

2010

The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers.

[BibT_eX]

[DOI]

Changhong Lu

Theor. Comput. Sci., 2010

The p-maxian problem on block graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

Total restrained domination in claw-free graphs.

[BibT_eX]

[DOI]

Hongxing Jiang

J. Comb. Optim., 2010

Signed clique-transversal functions in graphs.

[BibT_eX]

[DOI]

Haichao Wang

Int. J. Comput. Math., 2010

Online scheduling of malleable parallel jobs with setup times on two identical machines.

[BibT_eX]

[DOI]

Shouwei Guo

Eur. J. Oper. Res., 2010

Matching Properties in Double domination Edge Critical Graphs.

[BibT_eX]

[DOI]

Haichao Wang

Discret. Math. Algorithms Appl., 2010

The p-maxian problem on interval graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

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

[BibT_eX]

[DOI]

Xiaoqin Zhang

Computing, 2010

2009

Matching Properties in Total Domination Vertex Critical Graphs.

[BibT_eX]

[DOI]

Haichao Wang

Graphs Comb., 2009

Total Restrained Domination in Cubic Graphs.

[BibT_eX]

[DOI]

Hongxing Jiang

Graphs Comb., 2009

The exact domination number of the generalized Petersen graphs.

[BibT_eX]

[DOI]

Hong Yan

Guangjun Xu

Discret. Math., 2009

A polynomial-time algorithm for the paired-domination problem on permutation graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

On matching and total domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

An application of the Turán theorem to domination in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Proof of a conjecture on k-tuple domination in graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2008

2007

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

[BibT_eX]

[DOI]

Michael A. Henning

J. Graph Theory, 2007

Absorbant of generalized de Bruijn digraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Paired domination on interval and circular-arc graphs.

[BibT_eX]

[DOI]

C. T. Ng

Discret. Appl. Math., 2007

An improved algorithm for the p-center problem on interval graphs with unit lengths.

[BibT_eX]

[DOI]

C. T. Ng

Comput. Oper. Res., 2007

Bondage number in oriented graphs.

[BibT_eX]

Ars Comb., 2007

The algorithmic complexity of the minus clique-transversal problem.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2007

2006

Power domination in block graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Acyclic domination on bipartite permutation graphs.

[BibT_eX]

[DOI]

Guangjun Xu

Inf. Process. Lett., 2006

Power domination in graphs.

[BibT_eX]

[DOI]

Min Zhao

Gerard J. Chang

Discret. Math., 2006

Total minus domination in k-partite graphs.

[BibT_eX]

[DOI]

Louis Caccetta

Discret. Math., 2006

2005

Bondage number of the discrete torus Cn×C4.

[BibT_eX]

[DOI]

Hye Kyung Kim

Discret. Math., 2005

Scheduling to Minimize Makespan with Time-Dependent Processing Times.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Paired-domination in inflated graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Due-date assignment and single machine scheduling with deteriorating jobs.

[BibT_eX]

[DOI]

T. C. E. Cheng

C. T. Ng

J. Oper. Res. Soc., 2004

Batch-Processing Scheduling with Setup Times.

[BibT_eX]

[DOI]

Chuangyin Dang

J. Comb. Optim., 2004

A note on balance vertices in trees.

[BibT_eX]

[DOI]

Discret. Math., 2004

Minus domination number in k-partite graphs.

[BibT_eX]

[DOI]

Hye Kyung Kim

Discret. Math., 2004

A note on Nordhaus-Gaddum inequalities for domination.

[BibT_eX]

[DOI]

Chuangyin Dang

Discret. Appl. Math., 2004

A characterization of trees with equal total domination and paired-domination numbers.

[BibT_eX]

[DOI]

Michael A. Henning

Australas. J Comb., 2004

2003

Paired-domination of Trees.

[BibT_eX]

[DOI]

J. Glob. Optim., 2003

Upper bounds on signed 2-independence number of graphs.

[BibT_eX]

Ars Comb., 2003

2002

Upper bounds for the k-subdomination number of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Lower Bounds on the Minus Domination and k-Subdomination Numbers.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

The number of vertices of degree k in a minimally k-edge-connected digraph.

[BibT_eX]

[DOI]

Xudong Yuan

J. Graph Theory, 2000

Bondage number of planar graphs.

[BibT_eX]

[DOI]

Jinjiang Yuan

Discret. Math., 2000

Upper minus domination in regular graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

Lower bounds on dominating functions in graphs.

[BibT_eX]