On (d, 2)-dominating numbers of binary undirected de Bruijn graphs. - Changhong Lu; Juming Xu; Kemin Zhang 001 (Discret. Appl. Math., 2000)

Distance-two labelings of graphs. - Gerard J. Chang; Changhong Lu (Eur. J. Comb., 2003)

Extremal problems on consecutive L(2, 1)-labelling. - Changhong Lu; Lei Chen 007; Mingqing Zhai (Discret. Appl. Math., 2007)

An extremal problem on non-full colorable graphs. - Changhong Lu; Mingqing Zhai (Discret. Appl. Math., 2007)

No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups. - Gerard J. Chang; Changhong Lu; Sanming Zhou (Discret. Math., 2007)

The Upper and Lower Geodetic Numbers of Graphs. - Lin Dong; Changhong Lu; Xiao Wang (Ars Comb., 2009)

Distance-two labellings of Hamming graphs. - Gerard J. Chang; Changhong Lu; Sanming Zhou (Discret. Appl. Math., 2009)

A linear-time algorithm for paired-domination problem in strongly chordal graphs. - Lei Chen 007; Changhong Lu; Zhenbing Zeng (Inf. Process. Lett., 2009)

Hardness results and approximation algorithms for (weighted) paired-domination in graphs. - Lei Chen 007; Changhong Lu; Zhenbing Zeng (Theor. Comput. Sci., 2009)

Distance paired-domination problems on subclasses of chordal graphs. - Lei Chen 007; Changhong Lu; Zhenbing Zeng (Theor. Comput. Sci., 2009)

Labelling algorithms for paired-domination problems in block and interval graphs. - Lei Chen 007; Changhong Lu; Zhenbing Zeng (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)

Identifying codes and locating-dominating sets on paths and cycles. - Chunxia Chen; Changhong Lu; Zhengke Miao (Discret. Appl. Math., 2011)

Path covering number and L(2,1)-labeling number of graphs - Changhong Lu; Qing Zhou (CoRR, 2012)

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

Vertices in all minimum paired-dominating sets of block graphs. - Lei Chen 007; Changhong Lu; Zhenbing Zeng (J. Comb. Optim., 2012)

NP-completeness and APX-completeness of restrained domination in graphs. - Lei Chen 007; Weiming Zeng; Changhong Lu (Theor. Comput. Sci., 2012)

Path covering number and L(2, 1)L(2, 1)-labeling number of graphs. - Changhong Lu; Qing Zhou (Discret. Appl. Math., 2013)

Three conjectures on the signed cycle domination in graphs. - Jian Guan; Xiaoyan Liu; Changhong Lu; Zhengke Miao (J. Comb. Optim., 2013)

Graphs with unique minimum paired-dominating set. - Lei Chen 007; Changhong Lu; Zhenbing Zeng (Ars Comb., 2015)

Identifying New Candidate Genes and Chemicals Related to Prostate Cancer Using a Hybrid Network and Shortest Path Approach. - Fei Yuan 002; You Zhou 005; Meng Wang; Jing Yang 009; Kai Wu; Changhong Lu; Xiangyin Kong; Yu-Dong Cai 001 (Comput. Math. Methods Medicine, 2015)

On Tight Components and Anti-Tight Components. - Changhong Lu; Kan Wang; Xingxing Yu (Graphs Comb., 2015)

Upper Bounds for the Paired-Domination Numbers of Graphs. - Changhong Lu; Chao Wang; Kan Wang (Graphs Comb., 2016)

k-Power domination in block graphs. - Chao Wang; Lei Chen 007; Changhong Lu (J. Comb. Optim., 2016)

Cover k-Uniform Hypergraphs by Monochromatic Loose Paths. - Changhong Lu; Rui Mao 003; Bing Wang 008; Ping Zhang (Electron. J. Comb., 2017)

Monochromatic loose path partitions in k-uniform hypergraphs. - Changhong Lu; Bing Wang 008; Ping Zhang (Discret. Math., 2017)

The k-power Domination Problem in Weighted Trees. - Changjie Cheng; Changhong Lu; Yu Zhou (AAIM, 2018)

Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four. - Changhong Lu; Rui Mao 003; Bing Wang 008 (Ars Comb., 2018)

Algorithm complexity of neighborhood total domination and (ρ, γnt)-graphs. - Changhong Lu; Bing Wang 008; Kan Wang (J. Comb. Optim., 2018)

K5--Subdivision in 4-Connected Graphs. - Changhong Lu; Ping Zhang (SIAM J. Discret. Math., 2018)

Independent Double Roman Domination on Block Graphs. - Decheng Wei; Changhong Lu (CoRR, 2019)

Paired-domination in claw-free graphs with minimum degree at least three. - Changhong Lu; Bing Wang 008; Kan Wang; Yana Wu (Discret. Appl. Math., 2019)

Monotone submodular maximization over the bounded integer lattice with cardinality constraints. - Lei Lai; Qiufen Ni; Changhong Lu; Chuanhe Huang; Weili Wu 001 (Discret. Math. Algorithms Appl., 2019)

Power domination in regular claw-free graphs. - Changhong Lu; Rui Mao 003; Bing Wang 008 (Discret. Appl. Math., 2020)

Connectivity keeping trees in 2-connected graphs. - Changhong Lu; Ping Zhang (Discret. Math., 2020)

A fast double greedy algorithm for non-monotone DR-submodular function maximization. - Shuyang Gu; Ganquan Shi; Weili Wu 001; Changhong Lu (Discret. Math. Algorithms Appl., 2020)

The k-power domination problem in weighted trees. - Changjie Cheng; Changhong Lu; Yu Zhou (Theor. Comput. Sci., 2020)

Leveraging Intra-Domain Knowledge to Strengthen Cross-Domain Crowd Counting. - Yiqing Cai; Lianggangxu Chen; Zhenwei Ma; Changhong Lu; Changbo Wang; Gaoqi He (ICME, 2021)

The Maximum Number of Copies of $K_{r, s}$ in Graphs Without Long Cycles or Paths. - Changhong Lu; Long-Tu Yuan; Ping Zhang (Electron. J. Comb., 2021)

Connectivity keeping caterpillars and spiders in 2-connected graphs. - Yanmei Hong; Qinghai Liu; Changhong Lu; Qingjie Ye (Discret. Math., 2021)

DH-GCN: Saliency-Aware Complex Scene Graph Generation Using Dual-Hierarchy Graph Convolutional Network. - Jiale Lu; Lianggangxu Chen; Yiqing Cai; Haoyue Guan; Changhong Lu; Changbo Wang; Gaoqi He (ICME, 2022)

A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem. - Changhong Lu; Qingjie Ye (Discret. Appl. Math., 2022)

Roman 2-domination problem in graphs. - Hangdi Chen; Changhong Lu (Discuss. Math. Graph Theory, 2022)

Extremal Graphs for Two Vertex-Disjoint Copies of a Clique. - Wanfang Chen; Changhong Lu; Long-Tu Yuan (Graphs Comb., 2022)

Generalized Power Domination in Claw-Free Regular Graphs. - Hangdi Chen; Changhong Lu; Qingjie Ye (Graphs Comb., 2022)

Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs. - Changhong Lu; Qingjie Ye; Chengru Zhu (J. Comb. Optim., 2022)

Explicit Invariant Feature Induced Cross-Domain Crowd Counting. - Yiqing Cai; Lianggangxu Chen; Haoyue Guan; Shaohui Lin; Changhong Lu; Changbo Wang; Gaoqi He (AAAI, 2023)

Approximation algorithms for a virtual machine allocation problem with finite types. - Lifeng Guo; Changhong Lu; Guanlin Wu (Inf. Process. Lett., 2023)

Global Representation Guided Adaptive Fusion Network for Stable Video Crowd Counting. - Yiqing Cai; Zhenwei Ma; Changhong Lu; Changbo Wang; Gaoqi He (IEEE Trans. Multim., 2023)

Video-based spatio-temporal scene graph generation with efficient self-supervision tasks. - Lianggangxu Chen; Yiqing Cai; Changhong Lu; Changbo Wang; Gaoqi He (Multim. Tools Appl., 2023)

QUBO Formulations for Variation of Domination Problem. - Haoqian Pan; Changhong Lu (CoRR, 2024)

Application of Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem. - Haoqian Pan; Shiyue Wang; Changhong Lu (CoRR, 2024)

The problem of path decomposition for graphs with treewidth at most 4. - Changhong Lu; Niping Yi (Discret. Math., 2024)

On the Turán Number of Edge Blow-Ups of Cliques. - Jialei Song; Changhong Lu; Long-Tu Yuan (SIAM J. Discret. Math., 2024)

Packing of the k-power of Hamilton cycles. - Wanfang Chen; Changhong Lu; Qi Wu; Long-Tu Yuan (Discret. Math., 2025)

SkyRover: A Modular Simulator for Cross-Domain Pathfinding. - Wenhui Ma; Wenhao Li 001; Bo Jin 003; Changhong Lu; Xiangfeng Wang (CoRR, 2025)

GraphThought: Graph Combinatorial Optimization with Thought Generation. - Zixiao Huang; Lifeng Guo; Junjie Sheng; Haosheng Chen; Wenhao Li 001; Bo Jin 003; Changhong Lu; Xiangfeng Wang (CoRR, 2025)

Low-Rank and Deep Plug-and-Play Priors for Missing Traffic Data Imputation. - Peng Chen; Fang Li 004; Deliang Wei; Changhong Lu (IEEE Trans. Intell. Transp. Syst., 2025)

Optimization Problem Solving Can Transition to Evolutionary Agentic Workflows. - Wenhao Li 001; Bo Jin 003; Mingyi Hong 001; Changhong Lu; Xiangfeng Wang (CoRR, 2025)

Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding. - Shiyue Wang; Haozheng Xu; Yuhan Zhang 002; Jingran Lin; Changhong Lu; Xiangfeng Wang; Wenhao Li 001 (CoRR, 2025)

The edge metric dimensions of convex polytopes. - Meiqin Wei; Bohua Fan; Changhong Lu; Jun Yue; Jinfeng Liu (Discret. Appl. Math., 2026)