default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHong Chang 0002
Person information
- affiliation: Nanjing Normal University, Nanjing, China
Other persons with the same name
- Hong Chang — disambiguation page
- Hong Chang 0001
![[0000-0002-2668-0070]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2668-0070")
— Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China - Hong Chang 0003 — University of Tennessee, Knoxville, TN, USA
- Hong Chang 0004 — Inner Mongolia University of Technology, Hohhot, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Hong Chang, Zhong Huang:
A survey on conflict-free connection coloring of graphs. Discret. Appl. Math. 352: 88-104 (2024)- [j11]Zhicheng Liu, Hong Chang, Ran Ma, Donglei Du, Xiaoyan Zhang:
Two-stage submodular maximization problem beyond nonnegative and monotone. Math. Struct. Comput. Sci. 34(3): 211-226 (2024) - [j10]Hong Chang, Jing Jin, Zhicheng Liu, Donglei Du, Xiaoyan Zhang:
Two-stage BP maximization under p-matroid constraint. Theor. Comput. Sci. 994: 114469 (2024) - 2023
- [j9]Yanzhi Li, Zhicheng Liu, Chuchu Xu, Ping Li, Xiaoyan Zhang, Hong Chang:
Two-stage submodular maximization under curvature. J. Comb. Optim. 45(2): 77 (2023) - [j8]Hong Chang, Jing Jin, Zhicheng Liu, Ping Li, Xiaoyan Zhang:
Two-stage non-submodular maximization. Theor. Comput. Sci. 968: 114017 (2023) - 2022
- [j7]Zhicheng Liu, Jing Jin, Hong Chang, Donglei Du, Xiaoyan Zhang:
Improved algorithms for non-submodular function maximization problem. Theor. Comput. Sci. 931: 49-55 (2022) - [c6]Hong Chang, Zhicheng Liu, Donglei Du, Xiaoyan Zhang:
Two-Stage BP Maximization Under p-matroid Constraint. COCOON 2022: 452-462 - [c5]Hong Chang, Zhicheng Liu, Ping Li, Xiaoyan Zhang:
Two-Stage Non-submodular Maximization. TAMC 2022: 272-280 - 2021
- [j6]Hong Chang, Meng Ji, Xueliang Li, Jingshu Zhang:
Conflict-free connection of trees. J. Comb. Optim. 42(3): 340-353 (2021) - [j5]Zhicheng Liu, Ling Chen, Hong Chang, Donglei Du, Xiaoyan Zhang:
Online algorithms for BP functions maximization. Theor. Comput. Sci. 858: 114-121 (2021) - [c4]Zhicheng Liu, Hong Chang, Donglei Du, Xiaoyan Zhang:
Improved Algorithms for Non-submodular Function Maximization Problem. AAIM 2021: 190-199 - [c3]Yanzhi Li, Zhicheng Liu, Chuchu Xu, Ping Li, Hong Chang, Xiaoyan Zhang:
Two-Stage Submodular Maximization Under Curvature. COCOA 2021: 25-34 - 2020
- [j4]Xuqing Bai, Hong Chang, Xueliang Li:
More on limited packings in graphs. J. Comb. Optim. 40(2): 412-430 (2020) - [c2]Ling Chen, Zhicheng Liu, Hong Chang, Donglei Du, Xiaoyan Zhang:
Online BP Functions Maximization. AAIM 2020: 173-184 - [c1]Zhicheng Liu, Hong Chang, Ran Ma, Donglei Du, Xiaoyan Zhang:
Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone. TAMC 2020: 144-155
2010 – 2019
- 2019
- [j3]Hong Chang, Zhong Huang, Xueliang Li, Yaping Mao, Haixing Zhao:
On conflict-free connection of graphs. Discret. Appl. Math. 255: 167-182 (2019) - 2018
- [j2]Hong Chang, Trung Duy Doan, Zhong Huang, Stanislav Jendrol', Xueliang Li, Ingo Schiermeyer:
Graphs with Conflict-Free Connection Number Two. Graphs Comb. 34(6): 1553-1563 (2018) - [j1]Hong Chang, Xueliang Li, Colton Magnant, Zhongmei Qin:
The (k , ℓ)-proper index of graphs. J. Comb. Optim. 36(2): 458-471 (2018) - 2017
- [i1]Hong Chang, Meng Ji, Xueliang Li, Jingshu Zhang:
Conflict-free connection of trees. CoRR abs/1712.10010 (2017)
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 2025-02-08 00:49 CET 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:
