default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuangfu Wang
This is just a disambiguation page, and is not intended to be the bibliography of an actual person. Any publication listed on this page has not been assigned to an actual author yet. If you know the true author of one of the publications listed below, you are welcome to contact us.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j21]Guangfu Wang, Chenyang Li:
l1-embeddability under the edge-gluing operation on some nonbipartite graphs. Discret. Appl. Math. 375: 79-84 (2025)- [j20]Guangfu Wang, Dazhi Sun, Hao Li, Jian Cheng
, Pengpeng Yan, Heping Li:
Helmet Detection in Underground Coal Mines via Dynamic Background Perception with Limited Valid Samples. Mach. Learn. Knowl. Extr. 7(3): 64 (2025) - [j19]Zhicheng Yang, Guangfu Wang, Chiyu Wang, Jinhong Wang, Ke Yang, Yan Ma:
Magnetic Interference Data Evaluation and Compensation of Three-Axis Magnetometers. IEEE Trans. Instrum. Meas. 74: 1-9 (2025) - [j18]Zhicheng Yang, Guangfu Wang, Haoyang Xu, Yajun Shi, Jinhong Wang, Ziqin Wang, Yan Ma, Ke Yang:
Compensate Three-Axis Magnetometers Based on Adaptive Cancellation Under Time-Varying Noise. IEEE Trans. Instrum. Meas. 74: 1-9 (2025) - [i3]Chen Wang, Tianyu Peng, Wen Yang, Yinan Bai, Guangfu Wang, Jun Lin, Lanpeng Jia, Lingxiang Wu, Jinqiao Wang, Chengqing Zong, Jiajun Zhang:
OpenS2S: Advancing Fully Open-Source End-to-End Empathetic Large Speech Language Model. CoRR abs/2507.05177 (2025) - 2024
- [j17]Lin Zheng, Shuchao Li, Xiaobing Luo, Guangfu Wang:
Some sufficient conditions for a graph with minimum degree to be k-factor-critical. Discret. Appl. Math. 348: 279-291 (2024) - 2023
- [j16]Guangfu Wang, Zhikun Xiong, Lijun Chen:
l1-embeddability of shifted quadrilateral cylinder graphs. Graphs Comb. 39(6): 129 (2023) - 2022
- [j15]Guangfu Wang, Lijun Chen, Zhikun Xiong:
The l1-Embeddability of Hypertrees and Unicyclic Hypergraphs. Symmetry 14(11): 2260 (2022) - [j14]Ru Li, Shuaicheng Liu, Guangfu Wang, Guanghui Liu, Bing Zeng:
JigsawGAN: Auxiliary Learning for Solving Jigsaw Puzzles With Generative Adversarial Networks. IEEE Trans. Image Process. 31: 513-524 (2022) - 2021
- [j13]Ru Li, Chi-Hao Wu, Shuaicheng Liu, Jue Wang, Guangfu Wang, Guanghui Liu, Bing Zeng:
SDP-GAN: Saliency Detail Preservation Generative Adversarial Networks for High Perceptual Quality Style Transfer. IEEE Trans. Image Process. 30: 374-385 (2021) - [c3]Hao Xu, Shuaicheng Liu, Guangfu Wang, Guanghui Liu, Bing Zeng:
OMNet: Learning Overlapping Mask for Partial-to-Partial Point Cloud Registration. ICCV 2021: 3112-3121 - [i2]Ru Li, Shuaicheng Liu, Guangfu Wang, Guanghui Liu, Bing Zeng:
JigsawGAN: Self-supervised Learning for Solving Jigsaw Puzzles with Generative Adversarial Networks. CoRR abs/2101.07555 (2021) - [i1]Hao Xu, Shuaicheng Liu, Guangfu Wang, Guanghui Liu, Bing Zeng:
OMNet: Learning Overlapping Mask for Partial-to-Partial Point Cloud Registration. CoRR abs/2103.00937 (2021) - 2020
- [j12]Guangfu Wang, Yajing Liu:
The edge-Wiener index of zigzag nanotubes. Appl. Math. Comput. 377: 125191 (2020) - [j11]Jianxin Wei, Yujun Yang, Guangfu Wang:
Circular embeddability of isometric words. Discret. Math. 343(10): 112024 (2020)
2010 – 2019
- 2019
- [j10]Minjie Zhang, Shuchao Li, Baogen Xu, Guangfu Wang:
On the minimal eccentric connectivity indices of bipartite graphs with some given parameters. Discret. Appl. Math. 258: 242-253 (2019) - [j9]Guangfu Wang, Sergey V. Shpectorov:
l1-embeddability of generic quadrilateral Möbius maps. Eur. J. Comb. 80: 373-389 (2019) - [c2]Meijie Liu, Guangfu Wang, Kai Wei, Hong Gang, Hao Wang:
Multi-time Source Selection Optimization Algorithm for Time Synchronization System. AISI 2019: 166-174 - 2018
- [j8]Guangfu Wang, Shuchao Li, Dongchao Qi, Huihui Zhang:
On the edge-Szeged index of unicyclic graphs with given diameter. Appl. Math. Comput. 336: 94-106 (2018) - 2017
- [j7]Jianxin Wei, Yujun Yang, Guangfu Wang:
The self-concatenation of isometric strings is isometric. Discret. Math. 340(8): 1844-1850 (2017) - [j6]Huazhong Lü, Guangfu Wang:
Geodesic-bipancyclicity of balanced hypercubes. Int. J. Comput. Math. Comput. Syst. Theory 2(4): 121-135 (2017) - [j5]Jianxin Wei, Yujun Yang, Guangfu Wang:
Infinite families of 2-isometric and not 3-isometric binary words. Theor. Comput. Sci. 696: 1-10 (2017) - 2013
- [j4]Guangfu Wang, Heping Zhang:
l1l1-embeddability under the edge-gluing operation on graphs. Discret. Math. 313(20): 2115-2118 (2013) - [c1]Borui Wang, Guangfu Wang:
A new intelligent programmable logic controller based on switched networks. ICNC 2013: 1712-1717 - 2011
- [j3]Guangfu Wang, Heping Zhang:
l1-Embeddability of Hexagonal and Quadrilateral Mobius graphs. Ars Comb. 102: 269-287 (2011) - 2010
- [j2]Heping Zhang, Guangfu Wang:
Embeddability of open-ended carbon nanotubes in hypercubes. Comput. Geom. 43(5): 524-534 (2010)
2000 – 2009
- 2007
- [j1]Heping Zhang, Guangfu Wang:
A characterization of the interval distance monotone graphs. Discret. Math. 307(21): 2622-2627 (2007)
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-10-29 01:51 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:
