Changhong Lu

According to our database1, Changhong Lu authored at least 52 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Turán Number of Edge Blow-Ups of Cliques.
SIAM J. Discret. Math., 2024

The problem of path decomposition for graphs with treewidth at most 4.
Discret. Math., 2024

2023
Video-based spatio-temporal scene graph generation with efficient self-supervision tasks.
Multim. Tools Appl., October, 2023

Global Representation Guided Adaptive Fusion Network for Stable Video Crowd Counting.
IEEE Trans. Multim., 2023

Approximation algorithms for a virtual machine allocation problem with finite types.
Inf. Process. Lett., 2023

Explicit Invariant Feature Induced Cross-Domain Crowd Counting.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs.
J. Comb. Optim., 2022

Generalized Power Domination in Claw-Free Regular Graphs.
Graphs Comb., 2022

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

Roman 2-domination problem in graphs.
Discuss. Math. Graph Theory, 2022

A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem.
Discret. Appl. Math., 2022

DH-GCN: Saliency-Aware Complex Scene Graph Generation Using Dual-Hierarchy Graph Convolutional Network.
Proceedings of the IEEE International Conference on Multimedia and Expo, 2022

2021
Connectivity keeping caterpillars and spiders in 2-connected graphs.
Discret. Math., 2021

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

Leveraging Intra-Domain Knowledge to Strengthen Cross-Domain Crowd Counting.
Proceedings of the 2021 IEEE International Conference on Multimedia and Expo, 2021

2020
The <i>k</i>-power domination problem in weighted trees.
Theor. Comput. Sci., 2020

A fast double greedy algorithm for non-monotone DR-submodular function maximization.
Discret. Math. Algorithms Appl., 2020

Connectivity keeping trees in 2-connected graphs.
Discret. Math., 2020

Power domination in regular claw-free graphs.
Discret. Appl. Math., 2020

2019
Monotone submodular maximization over the bounded integer lattice with cardinality constraints.
Discret. Math. Algorithms Appl., 2019

Paired-domination in claw-free graphs with minimum degree at least three.
Discret. Appl. Math., 2019

Independent Double Roman Domination on Block Graphs.
CoRR, 2019

2018
K<sub>5<sup>-</sup></sub>-Subdivision in 4-Connected Graphs.
SIAM J. Discret. Math., 2018

Algorithm complexity of neighborhood total domination and (ρ, γ<sub>nt</sub>)-graphs.
J. Comb. Optim., 2018

Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four.
Ars Comb., 2018

The k-power Domination Problem in Weighted Trees.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017
Monochromatic loose path partitions in k-uniform hypergraphs.
Discret. Math., 2017

Cover <i>k</i>-Uniform Hypergraphs by Monochromatic Loose Paths.
Electron. J. Comb., 2017

2016
k-Power domination in block graphs.
J. Comb. Optim., 2016

Upper Bounds for the Paired-Domination Numbers of Graphs.
Graphs Comb., 2016

2015
On Tight Components and Anti-Tight Components.
Graphs Comb., 2015

Identifying New Candidate Genes and Chemicals Related to Prostate Cancer Using a Hybrid Network and Shortest Path Approach.
Comput. Math. Methods Medicine, 2015

Graphs with unique minimum paired-dominating set.
Ars Comb., 2015

2013
Three conjectures on the signed cycle domination in graphs.
J. Comb. Optim., 2013

Path covering number and <i>L</i>(2, 1)L(2, 1)-labeling number of graphs.
Discret. Appl. Math., 2013

2012
NP-completeness and APX-completeness of restrained domination in graphs.
Theor. Comput. Sci., 2012

Vertices in all minimum paired-dominating sets of block graphs.
J. Comb. Optim., 2012

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

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

2011
Identifying codes and locating-dominating sets on paths and cycles.
Discret. Appl. Math., 2011

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

Labelling algorithms for paired-domination problems in block and interval graphs.
J. Comb. Optim., 2010

2009
Distance paired-domination problems on subclasses of chordal graphs.
Theor. Comput. Sci., 2009

Hardness results and approximation algorithms for (weighted) paired-domination in graphs.
Theor. Comput. Sci., 2009

A linear-time algorithm for paired-domination problem in strongly chordal graphs.
Inf. Process. Lett., 2009

Distance-two labellings of Hamming graphs.
Discret. Appl. Math., 2009

The Upper and Lower Geodetic Numbers of Graphs.
Ars Comb., 2009

2007
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups.
Discret. Math., 2007

An extremal problem on non-full colorable graphs.
Discret. Appl. Math., 2007

Extremal problems on consecutive L(2, 1)-labelling.
Discret. Appl. Math., 2007

2003
Distance-two labelings of graphs.
Eur. J. Comb., 2003

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


  Loading...