default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChanghong Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j46]Changhong Lu, Niping Yi
:
The problem of path decomposition for graphs with treewidth at most 4. Discret. Math. 347(6): 113957 (2024)- [j45]Jialei Song, Changhong Lu, Long-Tu Yuan:
On the Turán Number of Edge Blow-Ups of Cliques. SIAM J. Discret. Math. 38(3): 2429-2446 (2024) - 2023
- [j44]Lifeng Guo, Changhong Lu, Guanlin Wu:
Approximation algorithms for a virtual machine allocation problem with finite types. Inf. Process. Lett. 180: 106339 (2023) - [j43]Lianggangxu Chen, Yiqing Cai, Changhong Lu, Changbo Wang, Gaoqi He:
Video-based spatio-temporal scene graph generation with efficient self-supervision tasks. Multim. Tools Appl. 82(25): 38947-38966 (2023) - [j42]Yiqing Cai, Zhenwei Ma, Changhong Lu, Changbo Wang, Gaoqi He:
Global Representation Guided Adaptive Fusion Network for Stable Video Crowd Counting. IEEE Trans. Multim. 25: 5222-5233 (2023) - [c5]Yiqing Cai, Lianggangxu Chen, Haoyue Guan, Shaohui Lin, Changhong Lu, Changbo Wang, Gaoqi He:
Explicit Invariant Feature Induced Cross-Domain Crowd Counting. AAAI 2023: 259-267 - 2022
- [j41]Changhong Lu, Qingjie Ye:
A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem. Discret. Appl. Math. 309: 147-159 (2022) - [j40]Hangdi Chen, Changhong Lu:
Roman 2-domination problem in graphs. Discuss. Math. Graph Theory 42(2): 641-660 (2022) - [j39]Wanfang Chen, Changhong Lu, Long-Tu Yuan:
Extremal Graphs for Two Vertex-Disjoint Copies of a Clique. Graphs Comb. 38(3): 67 (2022) - [j38]Hangdi Chen, Changhong Lu, Qingjie Ye:
Generalized Power Domination in Claw-Free Regular Graphs. Graphs Comb. 38(3): 68 (2022) - [j37]Changhong Lu, Qingjie Ye, Chengru Zhu:
Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs. J. Comb. Optim. 44(3): 2029-2039 (2022) - [c4]Jiale Lu, Lianggangxu Chen, Yiqing Cai, Haoyue Guan, Changhong Lu, Changbo Wang, Gaoqi He:
DH-GCN: Saliency-Aware Complex Scene Graph Generation Using Dual-Hierarchy Graph Convolutional Network. ICME 2022: 1-6 - 2021
- [j36]Changhong Lu, Long-Tu Yuan, Ping Zhang:
The Maximum Number of Copies of $K_{r, s}$ in Graphs Without Long Cycles or Paths. Electron. J. Comb. 28(4) (2021) - [j35]Yanmei Hong, Qinghai Liu, Changhong Lu, Qingjie Ye:
Connectivity keeping caterpillars and spiders in 2-connected graphs. Discret. Math. 344(3): 112236 (2021) - [c3]Yiqing Cai, Lianggangxu Chen, Zhenwei Ma, Changhong Lu, Changbo Wang, Gaoqi He:
Leveraging Intra-Domain Knowledge to Strengthen Cross-Domain Crowd Counting. ICME 2021: 1-6 - 2020
- [j34]Changhong Lu, Rui Mao, Bing Wang:
Power domination in regular claw-free graphs. Discret. Appl. Math. 284: 401-415 (2020) - [j33]Changhong Lu, Ping Zhang:
Connectivity keeping trees in 2-connected graphs. Discret. Math. 343(2): 111677 (2020) - [j32]Shuyang Gu, Ganquan Shi, Weili Wu, Changhong Lu:
A fast double greedy algorithm for non-monotone DR-submodular function maximization. Discret. Math. Algorithms Appl. 12(1): 2050007:1-2050007:11 (2020) - [j31]Changjie Cheng, Changhong Lu, Yu Zhou:
The k-power domination problem in weighted trees. Theor. Comput. Sci. 809: 231-238 (2020)
2010 – 2019
- 2019
- [j30]Changhong Lu, Bing Wang, Kan Wang, Yana Wu:
Paired-domination in claw-free graphs with minimum degree at least three. Discret. Appl. Math. 257: 250-259 (2019) - [j29]Lei Lai, Qiufen Ni, Changhong Lu, Chuanhe Huang, Weili Wu:
Monotone submodular maximization over the bounded integer lattice with cardinality constraints. Discret. Math. Algorithms Appl. 11(6): 1950075:1-1950075:14 (2019) - [c2]Changhong Lu, Qingjie Ye, Chengru Zhu:
Algorithmic Aspect on the Minimum (Weighted) Doubly Resolving Set Problem of Graphs. AAIM 2019: 212-222 - [i2]Decheng Wei, Changhong Lu:
Independent Double Roman Domination on Block Graphs. CoRR abs/1908.00784 (2019) - 2018
- [j28]Changhong Lu, Rui Mao, Bing Wang:
Paired-Domination in Claw-Free Graphs with Minimum Degree at Least Four. Ars Comb. 139: 393-409 (2018) - [j27]Changhong Lu, Bing Wang, Kan Wang:
Algorithm complexity of neighborhood total domination and (ρ, γnt)-graphs. J. Comb. Optim. 35(2): 424-435 (2018) - [j26]Changhong Lu, Ping Zhang:
K5--Subdivision in 4-Connected Graphs. SIAM J. Discret. Math. 32(4): 2900-2915 (2018) - [c1]Changjie Cheng, Changhong Lu, Yu Zhou:
The k-power Domination Problem in Weighted Trees. AAIM 2018: 149-160 - 2017
- [j25]Changhong Lu, Rui Mao, Bing Wang, Ping Zhang:
Cover k-Uniform Hypergraphs by Monochromatic Loose Paths. Electron. J. Comb. 24(4): 4 (2017) - [j24]Changhong Lu, Bing Wang, Ping Zhang:
Monochromatic loose path partitions in k-uniform hypergraphs. Discret. Math. 340(12): 2789-2791 (2017) - 2016
- [j23]Changhong Lu, Chao Wang, Kan Wang:
Upper Bounds for the Paired-Domination Numbers of Graphs. Graphs Comb. 32(4): 1489-1494 (2016) - [j22]Chao Wang, Lei Chen, Changhong Lu:
k-Power domination in block graphs. J. Comb. Optim. 31(2): 865-873 (2016) - 2015
- [j21]Lei Chen, Changhong Lu, Zhenbing Zeng:
Graphs with unique minimum paired-dominating set. Ars Comb. 119: 177-192 (2015) - [j20]Fei Yuan, You Zhou, Meng Wang, Jing Yang, Kai Wu, Changhong Lu, Xiangyin Kong, Yu-Dong Cai:
Identifying New Candidate Genes and Chemicals Related to Prostate Cancer Using a Hybrid Network and Shortest Path Approach. Comput. Math. Methods Medicine 2015: 462363:1-462363:12 (2015) - [j19]Changhong Lu, Kan Wang, Xingxing Yu:
On Tight Components and Anti-Tight Components. Graphs Comb. 31(6): 2293-2297 (2015) - 2013
- [j18]Changhong Lu, Qing Zhou:
Path covering number and L(2, 1)L(2, 1)-labeling number of graphs. Discret. Appl. Math. 161(13-14): 2062-2074 (2013) - [j17]Jian Guan, Xiaoyan Liu, Changhong Lu, Zhengke Miao:
Three conjectures on the signed cycle domination in graphs. J. Comb. Optim. 25(4): 639-645 (2013) - 2012
- [j16]Dawei He, Changhong Lu:
A conjecture on the number of SDRs of a (t, n)-family. Eur. J. Comb. 33(1): 1-7 (2012) - [j15]Lei Chen, Changhong Lu, Zhenbing Zeng:
Vertices in all minimum paired-dominating sets of block graphs. J. Comb. Optim. 24(3): 176-191 (2012) - [j14]Lei Chen, Weiming Zeng, Changhong Lu:
NP-completeness and APX-completeness of restrained domination in graphs. Theor. Comput. Sci. 448: 1-8 (2012) - [i1]Changhong Lu, Qing Zhou:
Path covering number and L(2,1)-labeling number of graphs. CoRR abs/1204.2306 (2012) - 2011
- [j13]Chunxia Chen, Changhong Lu, Zhengke Miao:
Identifying codes and locating-dominating sets on paths and cycles. Discret. Appl. Math. 159(15): 1540-1547 (2011) - 2010
- [j12]Lei Chen, Changhong Lu, Zhenbing Zeng:
Labelling algorithms for paired-domination problems in block and interval graphs. J. Comb. Optim. 19(4): 457-470 (2010) - [j11]Yukun Cheng, Liying Kang, Changhong Lu:
The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers. Theor. Comput. Sci. 411(7-9): 1038-1044 (2010)
2000 – 2009
- 2009
- [j10]Lin Dong, Changhong Lu, Xiao Wang:
The Upper and Lower Geodetic Numbers of Graphs. Ars Comb. 91 (2009) - [j9]Gerard J. Chang, Changhong Lu, Sanming Zhou:
Distance-two labellings of Hamming graphs. Discret. Appl. Math. 157(8): 1896-1904 (2009) - [j8]Lei Chen, Changhong Lu, Zhenbing Zeng:
A linear-time algorithm for paired-domination problem in strongly chordal graphs. Inf. Process. Lett. 110(1): 20-23 (2009) - [j7]Lei Chen, Changhong Lu, Zhenbing Zeng:
Hardness results and approximation algorithms for (weighted) paired-domination in graphs. Theor. Comput. Sci. 410(47-49): 5063-5071 (2009) - [j6]Lei Chen, Changhong Lu, Zhenbing Zeng:
Distance paired-domination problems on subclasses of chordal graphs. Theor. Comput. Sci. 410(47-49): 5072-5081 (2009) - 2007
- [j5]Changhong Lu, Lei Chen, Mingqing Zhai:
Extremal problems on consecutive L(2, 1)-labelling. Discret. Appl. Math. 155(10): 1302-1313 (2007) - [j4]Changhong Lu, Mingqing Zhai:
An extremal problem on non-full colorable graphs. Discret. Appl. Math. 155(16): 2165-2173 (2007) - [j3]Gerard J. Chang, Changhong Lu, Sanming Zhou:
No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups. Discret. Math. 307(14): 1808-1817 (2007) - 2003
- [j2]Gerard J. Chang, Changhong Lu:
Distance-two labelings of graphs. Eur. J. Comb. 24(1): 53-58 (2003) - 2000
- [j1]Changhong Lu, Juming Xu, Kemin Zhang:
On (d, 2)-dominating numbers of binary undirected de Bruijn graphs. Discret. Appl. Math. 105(1-3): 137-145 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
