Changhong Lu

Guanlin Wu

Inf. Process. Lett., 2023

Explicit Invariant Feature Induced Cross-Domain Crowd Counting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs.

[BibT_eX]

[DOI]

Qingjie Ye

Chengru Zhu

J. Comb. Optim., 2022

Generalized Power Domination in Claw-Free Regular Graphs.

[BibT_eX]

[DOI]

Hangdi Chen

Qingjie Ye

Graphs Comb., 2022

Extremal Graphs for Two Vertex-Disjoint Copies of a Clique.

[BibT_eX]

[DOI]

Wanfang Chen

Long-Tu Yuan

Graphs Comb., 2022

Roman 2-domination problem in graphs.

[BibT_eX]

[DOI]

Hangdi Chen

Discuss. Math. Graph Theory, 2022

A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem.

[BibT_eX]

[DOI]

Qingjie Ye

Discret. Appl. Math., 2022

DH-GCN: Saliency-Aware Complex Scene Graph Generation Using Dual-Hierarchy Graph Convolutional Network.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Multimedia and Expo, 2022

2021

Connectivity keeping caterpillars and spiders in 2-connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

The Maximum Number of Copies of $K_{r, s}$ in Graphs Without Long Cycles or Paths.

[BibT_eX]

[DOI]

Long-Tu Yuan

Electron. J. Comb., 2021

Leveraging Intra-Domain Knowledge to Strengthen Cross-Domain Crowd Counting.

[BibT_eX]

[DOI]

Proceedings of the 2021 IEEE International Conference on Multimedia and Expo, 2021

2020

The k-power domination problem in weighted trees.

[BibT_eX]

[DOI]

Changjie Cheng

Yu Zhou

Theor. Comput. Sci., 2020

A fast double greedy algorithm for non-monotone DR-submodular function maximization.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2020

Connectivity keeping trees in 2-connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Power domination in regular claw-free graphs.

[BibT_eX]

[DOI]

Rui Mao

Discret. Appl. Math., 2020

2019

Monotone submodular maximization over the bounded integer lattice with cardinality constraints.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2019

Paired-domination in claw-free graphs with minimum degree at least three.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Independent Double Roman Domination on Block Graphs.

[BibT_eX]

[DOI]

Decheng Wei

CoRR, 2019

2018

K5--Subdivision in 4-Connected Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Algorithm complexity of neighborhood total domination and (ρ, γnt)-graphs.

[BibT_eX]

[DOI]

Kan Wang

J. Comb. Optim., 2018

Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four.

[BibT_eX]

Rui Mao

Ars Comb., 2018

The k-power Domination Problem in Weighted Trees.

[BibT_eX]

[DOI]

Changjie Cheng

Yu Zhou

Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017

Monochromatic loose path partitions in k-uniform hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

Cover k-Uniform Hypergraphs by Monochromatic Loose Paths.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

2016

k-Power domination in block graphs.

[BibT_eX]

[DOI]

Chao Wang

J. Comb. Optim., 2016

Upper Bounds for the Paired-Domination Numbers of Graphs.

[BibT_eX]

[DOI]

Chao Wang

Kan Wang

Graphs Comb., 2016

2015

On Tight Components and Anti-Tight Components.

[BibT_eX]

[DOI]

Kan Wang

Xingxing Yu

Graphs Comb., 2015

Identifying New Candidate Genes and Chemicals Related to Prostate Cancer Using a Hybrid Network and Shortest Path Approach.

[BibT_eX]

[DOI]

Comput. Math. Methods Medicine, 2015

Graphs with unique minimum paired-dominating set.

[BibT_eX]

Ars Comb., 2015

2013

Three conjectures on the signed cycle domination in graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2013

Path covering number and L(2, 1)L(2, 1)-labeling number of graphs.

[BibT_eX]

[DOI]

Qing Zhou

Discret. Appl. Math., 2013

2012

NP-completeness and APX-completeness of restrained domination in graphs.

[BibT_eX]

[DOI]

Weiming Zeng

Theor. Comput. Sci., 2012

Vertices in all minimum paired-dominating sets of block graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2012

A conjecture on the number of SDRs of a (t, n)-family.

[BibT_eX]

[DOI]

Dawei He

Eur. J. Comb., 2012

Path covering number and L(2,1)-labeling number of graphs

[BibT_eX]

[DOI]

Qing Zhou

CoRR, 2012

2011

Identifying codes and locating-dominating sets on paths and cycles.

[BibT_eX]

[DOI]

Chunxia Chen

Zhengke Miao

Discret. Appl. Math., 2011

2010

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

[BibT_eX]

[DOI]

Yukun Cheng

Liying Kang

Theor. Comput. Sci., 2010

Labelling algorithms for paired-domination problems in block and interval graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2010

2009

Distance paired-domination problems on subclasses of chordal graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Hardness results and approximation algorithms for (weighted) paired-domination in graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A linear-time algorithm for paired-domination problem in strongly chordal graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Distance-two labellings of Hamming graphs.

[BibT_eX]

[DOI]

Gerard J. Chang

Sanming Zhou

Discret. Appl. Math., 2009

The Upper and Lower Geodetic Numbers of Graphs.

[BibT_eX]

Lin Dong

Xiao Wang

Ars Comb., 2009

2007

No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.

[BibT_eX]

[DOI]

Gerard J. Chang

Sanming Zhou

Discret. Math., 2007

An extremal problem on non-full colorable graphs.

[BibT_eX]

[DOI]

Mingqing Zhai

Discret. Appl. Math., 2007

Extremal problems on consecutive L(2, 1)-labelling.

[BibT_eX]

[DOI]

Mingqing Zhai

Discret. Appl. Math., 2007

2003

Distance-two labelings of graphs.

[BibT_eX]

[DOI]

Gerard J. Chang

Eur. J. Comb., 2003

2000

On (d, 2)-dominating numbers of binary undirected de Bruijn graphs.

[BibT_eX]

[DOI]