default search action
Guanghui Wang 0002
Person information
- affiliation: Shandong University, Jinan, China
Other persons with the same name
- Guanghui Wang — disambiguation page
- Guanghui Wang 0001
— Toronto Metropolitan University, Canada (and 1 more)
- Guanghui Wang 0003
- Guanghui Wang 0004
- Guanghui Wang 0005
- Guanghui Wang 0006 — Nanjing University, National Key Laboratory for Novel Software Technology, Nanjing, China
- Guanghui Wang 0007 — Ministry of Natural Resources of P. R. China, Land Satellite Remote Sensing Application Center, Beijing, China
- Guanghui Wang 0008 — China Agricultural University, Beijing, China
- Guanghui Wang 0009 — Nanchang University, Nanchang, China
- Guanghui Wang 0010 — HeBei United University, Tangshan, China
- Guanghui Wang 0011 — Nankai University, Institute of Statistics and LPMC, Tianjin, China
- Guanghui Wang 0012 — Zhejiang Ocean University, Zhoushan, China
- Guanghui Wang 0013 — Nanjing University, nstitute of Optical Communication Engineering, Jiangsu, China
- Guanghui Wang 0014 — China North Vehicle Research Institute, Beijing, China
- Guanghui Wang 0015 — National Institutes of Health, Bethesda, MD, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j92]Jie Han, Jie Hu, Lidan Ping, Guanghui Wang, Yi Wang, Donglei Yang:
Spanning trees in graphs without large bipartite holes. Comb. Probab. Comput. 33(3): 270-285 (2024) - [j91]Dongxu Chang
An Optimization Model for Offline Scheduling Policy of Low-Density Parity-Check Codes. IEEE Commun. Lett. 28(8): 1740-1744 (2024) - [j90]Jie Han, Patrick Morris
A Ramsey-Turán theory for tilings in graphs. Random Struct. Algorithms 64(1): 94-124 (2024) - [i10]Qingqing Peng, Dawei Yin, Dongxu Chang, Yuan Li, Huazi Zhang, Guiying Yan, Guanghui Wang:
On the Performance of Low-complexity Decoders of LDPC and Polar Codes. CoRR abs/2403.19266 (2024) - [i9]Dongxu Chang, Qingqing Peng, Guanghui Wang, Dawei Yin:
Density Evolution Analysis of Generalized Low-density Parity-check Codes under a Posteriori Probability Decoder. CoRR abs/2404.01136 (2024) - [i8]Longlong Li, Yipeng Zhang, Guanghui Wang, Kelin Xia:
KA-GNN: Kolmogorov-Arnold Graph Neural Networks for Molecular Property Prediction. CoRR abs/2410.11323 (2024) - 2023
- [j89]Bingyu Luan, Yantao Tang, Guanghui Wang, Donglei Yang:
Balanced Subdivisions of Cliques in Graphs. Comb. 43(5): 885-907 (2023) - [j88]Jie Han, Ping Hu, Guanghui Wang, Donglei Yang:
Clique-factors in graphs with sublinear ?-independence number. Comb. Probab. Comput. 32(4): 665-681 (2023) - [j87]Hong Liu, Guanghui Wang, Laurence Wilkes
Shape of the asymptotic maximum sum-free sets in integer lattice grids. Eur. J. Comb. 107: 103614 (2023) - [j86]Jialin Bi
Multiscale Topological Indices for the Quantitative Prediction of SARS CoV-2 Binding Affinity Change upon Mutations. J. Chem. Inf. Model. 63(13): 4216-4227 (2023) - [j85]Yangyang Cheng, Yifan Jing
Integer colorings with forbidden rainbow sums. J. Comb. Theory A 199: 105769 (2023) - [j84]Laihao Ding, Jie Han, Shumin Sun, Guanghui Wang, Wenling Zhou:
Tiling multipartite hypergraphs in quasi-random hypergraphs. J. Comb. Theory B 160: 36-65 (2023) - [j83]Fan Chang, Jie Han
Embedding clique-factors in graphs with low ℓ-independence number. J. Comb. Theory B 161: 301-330 (2023) - [j82]Luyining Gan, Jie Han
Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs. J. Graph Theory 104(3): 516-556 (2023) - [j81]Qi Luo, Dongxiao Yu, Zhipeng Cai, Xuemin Lin, Guanghui Wang, Xiuzhen Cheng
Toward maintenance of hypercores in large-scale dynamic hypergraphs. VLDB J. 32(3): 647-664 (2023) - [i7]Dongxu Chang, Guanghui Wang, Guiying Yan, Dawei Yin:
An Optimization Model for Offline Scheduling Policy of Low-density Parity-check Codes. CoRR abs/2303.13762 (2023) - [i6]Haoran Xiong, Zicheng Ye, Huazi Zhang, Jun Wang, Ke Liu, Dawei Yin, Guanghui Wang, Guiying Yan, Zhiming Ma:
Theoretical Bounds for the Size of Elementary Trapping Sets by Graphic Methods. CoRR abs/2307.02737 (2023) - 2022
- [j80]Laihao Ding, Jie Hu, Guanghui Wang, Donglei Yang
Properly colored short cycles in edge-colored graphs. Eur. J. Comb. 100: 103436 (2022) - [j79]Hao Li, Guanghui Wang, Wenling Zhou
Integer colorings with no rainbow k-term arithmetic progression. Eur. J. Comb. 104: 103547 (2022) - [j78]Dongxiao Yu, Dongbiao Wang, Qi Luo, Yanwei Zheng, Guanghui Wang, Zhipeng Cai
Stable structural clustering in uncertain graphs. Inf. Sci. 586: 596-610 (2022) - [j77]Hong Liu, Guanghui Wang, Donglei Yang
Clique immersion in graphs without a fixed bipartite graph. J. Comb. Theory B 157: 346-365 (2022) - [j76]Yulin Chang, Huifen Ge, Jie Han
Matching of Given Sizes in Hypergraphs. SIAM J. Discret. Math. 36(3): 2323-2338 (2022) - [j75]John Haslegrave, Jie Hu, Jaehoon Kim, Hong Liu, Bingyu Luan, Guanghui Wang
Crux and Long Cycles in Graphs. SIAM J. Discret. Math. 36(4): 2942-2958 (2022) - [j74]Zhaoyue Zhong
Efficient Algorithm Based on Non-Backtracking Matrix for Community Detection in Signed Networks. IEEE Trans. Netw. Sci. Eng. 9(4): 2200-2211 (2022) - [c8]Dawei Yin, Yuan Li, Xianbin Wang, Jiajie Tong, Huazi Zhang, Jun Wang, Guanghui Wang, Guiying Yan, Zhiming Ma:
On the Message Passing Efficiency of Polar and Low-Density Parity-Check Decoders. GLOBECOM (Workshops) 2022: 528-534 - [i5]Dawei Yin, Yuan Li, Xianbin Wang, Jiajie Tong, Huazi Zhang, Jun Wang, Guanghui Wang, Guiying Yan, Zhiming Ma:
On the Message Passing Efficiency of Polar and Low-Density Parity-Check Decoders. CoRR abs/2206.06897 (2022) - 2021
- [j73]Yangyang Cheng, Guanghui Wang, Yi Zhao:
Rainbow Pancyclicity in Graph Systems. Electron. J. Comb. 28(3): 3 (2021) - [j72]Ya-Wei Niu, Cunquan Qu, Guanghui Wang, Jian-Liang Wu, Guiying Yan:
Information spreading with relative attributes on signed networks. Inf. Sci. 551: 54-66 (2021) - [c7]Longlong Li, Hu Chen, Ping Li, Jie Han, Guanghui Wang, Gong Zhang:
The K-Core Decomposition Algorithm Under the Framework of GraphBLAS. HPEC 2021: 1-7 - [c6]Dawei Yin, Xiaojing Zhang, Xichao Shu, Guiying Yan, Guanghui Wang:
Search for Good Irregular Low-Density Parity-Check Codes Via Graph Spectrum. PIMRC 2021: 405-410 - [c5]Jie Han, Xichao Shu, Guanghui Wang:
Non-linear Hamilton cycles in linear quasi-random hypergraphs. SODA 2021: 74-88 - 2020
- [j71]Yangyang Cheng, Mikio Kano, Guanghui Wang:
Properly colored spanning trees in edge-colored graphs. Discret. Math. 343(1): 111629 (2020) - [j70]Xiaohan Cheng, Laihao Ding, Guanghui Wang, Jianliang Wu:
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs. Discret. Math. 343(7): 111856 (2020) - [j69]Yulin Chang, Jie Hu, Guanghui Wang, Xiaowei Yu:
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8. Discret. Math. 343(10): 112014 (2020) - [j68]Hua Liu, Cunquan Qu, Yawei Niu, Guanghui Wang:
The evolution of structural balance in time-varying signed networks. Future Gener. Comput. Syst. 102: 403-408 (2020) - [j67]Yulin Chang, Fei Jing
Local antimagic orientation of graphs. J. Comb. Optim. 39(4): 1129-1152 (2020) - [i4]Zhaoyue Zhong, Xiangrong Wang, Cunquan Qu, Guanghui Wang:
Non-backtracking Operator for Community Detection in Signed Networks. CoRR abs/2006.15471 (2020) - [i3]Jialin Bi, Ji Jin, Cunquan Qu, Xiuxiu Zhan, Guanghui Wang:
Temporal Gravity Model for Important Nodes Identification in Temporal Networks. CoRR abs/2007.02097 (2020)
2010 – 2019
- 2019
- [j66]Ya-Wei Niu, Guanghui Wang, Gui-Ying Yan, Xing Chen
Integrating random walk and binary regression to identify novel miRNA-disease association. BMC Bioinform. 20(1): 59 (2019) - [j65]Hao Huang, Tong Li, Guanghui Wang:
Rainbow Matchings in Properly-Colored Hypergraphs. Electron. J. Comb. 26(1): 1 (2019) - [j64]Shinya Fujita, Ruonan Li
Decomposing edge-coloured graphs under colour degree constraints. Comb. Probab. Comput. 28(5): 755-767 (2019) - [j63]Jie Hu, Qiancheng Ouyang, Guanghui Wang:
Local antimagic orientations of d-degenerate graphs. Discret. Appl. Math. 257: 206-215 (2019) - [j62]Laihao Ding, Guan-Huei Duh, Guanghui Wang, Tsai-Lien Wong, Jianliang Wu, Xiaowei Yu, Xuding Zhu:
Graphs are (1, Δ+1)-choosable. Discret. Math. 342(1): 279-284 (2019) - [j61]Yangyang Cheng, Qiang Sun, Ta Sheng Tan
Rainbow Hamiltonian cycles in strongly edge-colored graphs. Discret. Math. 342(4): 1186-1190 (2019) - [j60]Jie Hu, Guanghui Wang, Jianliang Wu
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. Discret. Math. 342(5): 1392-1402 (2019) - [j59]Yulin Chang, Qiancheng Ouyang, Guanghui Wang:
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10. J. Comb. Optim. 38(1): 185-196 (2019) - [j58]Tong Li, Zi-Xia Song
Antimagic orientations of even regular graphs. J. Graph Theory 90(1): 46-53 (2019) - 2018
- [j57]Xiaowei Yu, Jie Hu, Donglei Yang
Local antimagic labeling of graphs. Appl. Math. Comput. 322: 30-39 (2018) - [j56]Allan Lo, Nicolás Sanhueza-Matamala
Density of Monochromatic Infinite Paths. Electron. J. Comb. 25(4): 4 (2018) - [j55]Yangyang Cheng, Ta Sheng Tan
A note on rainbow matchings in strongly edge-colored graphs. Discret. Math. 341(10): 2762-2767 (2018) - [j54]Tianjiao Dai, Guanghui Wang, Donglei Yang
Strong list-chromatic index of subcubic graphs. Discret. Math. 341(12): 3434-3440 (2018) - [j53]Donglei Yang
On splitting digraphs. Eur. J. Comb. 71: 174-179 (2018) - [j52]Jingcheng Fu, Jianwen Li
Multipolarization versus unification in community networks. Future Gener. Comput. Syst. 83: 454-460 (2018) - [j51]Laihao Ding, Guanghui Wang, Jianliang Wu:
Generalized acyclic edge colorings via entropy compression. J. Comb. Optim. 35(3): 906-920 (2018) - 2017
- [j50]Shinya Fujita, Ruonan Li
Decomposing edge-colored graphs under color degree constraints. Electron. Notes Discret. Math. 61: 491-497 (2017) - [j49]Laihao Ding, Guanghui Wang, Jianliang Wu, Jiguo Yu:
Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz. Graphs Comb. 33(4): 885-900 (2017) - [j48]Xing Chen
HAMDA: Hybrid Approach for MiRNA-Disease Association prediction. J. Biomed. Informatics 76: 50-58 (2017) - [j47]Tong Li, Cunquan Qu, Guanghui Wang, Xiaowei Yu:
Neighbor product distinguishing total colorings. J. Comb. Optim. 33(1): 237-253 (2017) - [j46]Jingjing Yao, Xiaowei Yu, Guanghui Wang, Changqing Xu:
Neighbor sum distinguishing total coloring of 2-degenerate graphs. J. Comb. Optim. 34(1): 64-70 (2017) - [j45]Xiaohan Cheng, Guanghui Wang, Jianliang Wu:
The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10. J. Comb. Optim. 34(2): 383-397 (2017) - [j44]Guantao Chen, Yuping Gao, Songling Shan
Equitable vertex arboricity of 5-degenerate graphs. J. Comb. Optim. 34(2): 426-432 (2017) - [j43]Xueqin Sui, Zhumin Chen, Lei Guo, Kai Wu, Jun Ma, Guanghui Wang:
Social media as sensor in real world: movement trajectory detection with microblog. Soft Comput. 21(3): 765-779 (2017) - 2016
- [j42]Xiaowei Yu, Cunquan Qu, Guanghui Wang, Yiqiao Wang:
Adjacent vertex distinguishing colorings by sum of sparse graphs. Discret. Math. 339(1): 62-71 (2016) - [j41]Guanghui Wang, Guiying Yan, Xiaowei Yu:
Existence of rainbow matchings in strongly edge-colored graphs. Discret. Math. 339(10): 2457-2460 (2016) - [j40]Yuping Gao, Guanghui Wang, Jian-Liang Wu:
A Relaxed Case on 1-2-3 Conjecture. Graphs Comb. 32(4): 1415-1421 (2016) - [j39]Jingjing Yao, Xiaowei Yu, Guanghui Wang, Changqing Xu:
Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs. Graphs Comb. 32(4): 1611-1620 (2016) - [j38]Jianghua Zhang
Neighbor Sum Distinguishing Index of K4-Minor Free Graphs. Graphs Comb. 32(4): 1621-1633 (2016) - [j37]Cunquan Qu, Guanghui Wang, Guiying Yan, Xiaowei Yu:
Neighbor sum distinguishing total choosability of planar graphs. J. Comb. Optim. 32(3): 906-916 (2016) - [j36]Cunquan Qu, Guanghui Wang, Jian-Liang Wu, Xiaowei Yu:
On the neighbor sum distinguishing total coloring of planar graphs. Theor. Comput. Sci. 609: 162-170 (2016) - 2015
- [j35]Xiaohan Cheng, Danjun Huang, Guanghui Wang, Jian-Liang Wu:
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ. Discret. Appl. Math. 190-191: 34-41 (2015) - [j34]Cunquan Qu, Guanghui Wang, Guiying Yan:
Orthogonal matchings revisited. Discret. Math. 338(11): 2080-2088 (2015) - [j33]Guanghui Wang, Guiying Yan:
An Improved Upper Bound on Edge Weight Choosability of Graphs. Graphs Comb. 31(5): 1789-1793 (2015) - [j32]Guanghui Wang, Guiying Yan, Jiguo Yu
The r-acyclic chromatic number of planar graphs. J. Comb. Optim. 29(4): 713-722 (2015) - [j31]Hualong Li, Laihao Ding, Bingqiang Liu, Guanghui Wang:
Neighbor sum distinguishing total colorings of planar graphs. J. Comb. Optim. 30(3): 675-688 (2015) - 2014
- [j30]Xin Gu, Jiguo Yu
ECDC: An energy and coverage-aware distributed clustering protocol for wireless sensor networks. Comput. Electr. Eng. 40(2): 384-398 (2014) - [j29]Bing Xue, Liancui Zuo, Guanghui Wang, Guojun Li:
Shortest paths in Sierpiński graphs. Discret. Appl. Math. 162: 314-321 (2014) - [j28]Guanghui Wang, Guiying Yan:
An improved upper bound for the neighbor sum distinguishing index of graphs. Discret. Appl. Math. 175: 126-128 (2014) - [j27]Guanghui Wang, Tao Wang
Long properly colored cycles in edge colored complete graphs. Discret. Math. 324: 56-61 (2014) - [j26]Guanghui Wang, Zhumin Chen, Jihui Wang:
Neighbor sum distinguishing index of planar graphs. Discret. Math. 334: 70-73 (2014) - [j25]Jingcheng Fu, Guanghui Wang, Jianliang Wu, Jin Xu:
A note on Edge Weight choosability of graphs. Discret. Math. Algorithms Appl. 6(1) (2014) - [j24]Jinbo Li, Guizhen Liu, Guanghui Wang:
Fractional f-Edge Cover Chromatic Index of Graphs. Graphs Comb. 30(3): 687-698 (2014) - [j23]Bing Xue, Liancui Zuo, Guanghui Wang, Guojun Li:
The Linear t-Colorings of Sierpiński-Like Graphs. Graphs Comb. 30(3): 755-767 (2014) - [j22]Jiguo Yu
Domatic partition in homogeneous wireless sensor networks. J. Netw. Comput. Appl. 37: 186-193 (2014) - 2013
- [j21]Jiguo Yu
Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey. Comput. Commun. 36(2): 121-134 (2013) - [j20]Aijun Dong, Guojun Li, Guanghui Wang:
Equitable and list equitable colorings of planar graphs without 4-cycles. Discret. Math. 313(15): 1610-1619 (2013) - [j19]Guanghui Wang, Bingqiang Liu, Guizhen Liu:
A note on Rainbow Matchings. Discret. Math. Algorithms Appl. 5(4) (2013) - [i2]Guanghui Wang, Tao Wang, Guizhen Liu:
Long properly colored cycles in edge-colored complete graphs. CoRR abs/1301.0450 (2013) - 2012
- [j18]Xin Zhang
On r-acyclic edge colorings of planar graphs. Discret. Appl. Math. 160(13-14): 2048-2053 (2012) - [j17]Aijun Dong, Guanghui Wang:
Neighbor Sum Distinguishing Coloring of some Graphs. Discret. Math. Algorithms Appl. 4(4) (2012) - [j16]Hao Li, Guanghui Wang:
Color degree and heterochromatic cycles in edge-colored graphs. Eur. J. Comb. 33(8): 1958-1964 (2012) - [j15]Guanghui Wang, Bin Liu, Jiguo Yu
Circular Coloring of Planar Digraphs. Graphs Comb. 28(6): 889-900 (2012) - [j14]Guanghui Wang, Hao Li, Yan Zhu
A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs. Graphs Comb. 28(6): 901-905 (2012) - [j13]Jiguo Yu
Clustering-Based Energy-Efficient Broadcast Tree in Wireless Networks. Int. J. Comput. Commun. Control 7(4): 785-790 (2012) - [j12]Jiguo Yu
A Stochastic k-Coverage Scheduling Algorithm in Wireless Sensor Networks. Int. J. Distributed Sens. Networks 8 (2012) - [j11]Jiguo Yu
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks. J. Parallel Distributed Comput. 72(1): 35-47 (2012) - 2011
- [j10]Guanghui Wang:
Rainbow Matchings in Properly Edge Colored Graphs. Electron. J. Comb. 18(1) (2011) - [j9]Jianfeng Hou, Guizhen Liu, Guanghui Wang:
Improved bounds for acyclic chromatic index of planar graphs. Discret. Appl. Math. 159(8): 876-881 (2011) - [j8]Guanghui Wang, Shan Zhou, Guizhen Liu, Jianliang Wu:
Circular vertex arboricity. Discret. Appl. Math. 159(12): 1231-1238 (2011) - [i1]Yong Yu, Xin Zhang, Guanghui Wang, Jinbo Li:
(2,1)-Total labeling of planar graphs with large maximum degree. CoRR abs/1105.1908 (2011) - 2010
- [j7]Hao Li, Shan Zhou, Guanghui Wang:
The k-dominating cycles in graphs. Eur. J. Comb. 31(2): 608-616 (2010) - [j6]Shan Zhou, Hao Li, Guanghui Wang:
Algorithm for two disjoint long paths in 2-connected graphs. Theor. Comput. Sci. 411(34-36): 3247-3254 (2010) - [c4]Jiguo Yu
Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks. WASA 2010: 11-20
2000 – 2009
- 2009
- [j5]Hao Li, Xueliang Li, Guizhen Liu, Guanghui Wang:
The heterochromatic matchings in edge-colored bipartite graphs. Ars Comb. 93 (2009) - [j4]Guanghui Wang, Hao Li:
Color degree and alternating cycles in edge-colored graphs. Discret. Math. 309(13): 4349-4354 (2009) - [j3]Guanghui Wang, Guizhen Liu:
Paths, cycles and circular colorings in digraphs. Theor. Comput. Sci. 410(21-23): 1982-1985 (2009) - [c3]Jiguo Yu
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings. COCOA 2009: 519-529 - [c2]Jiguo Yu
An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings. COCOA 2009: 530-540 - 2008
- [j2]Guanghui Wang, Hao Li:
Heterochromatic Matchings in Edge-Colored Graphs. Electron. J. Comb. 15(1) (2008) - 2007
- [j1]Tomás Kaiser
A Note on k -walks in Bridgeless Graphs. Graphs Comb. 23(3): 303-308 (2007) - [c1]Hao Li, Guanghui Wang, Shan Zhou:
Long Alternating Cycles in Edge-Colored Complete Graphs. FAW 2007: 305-309
Coauthor Index
Jian-Liang Wu
aka: Jianliang Wu
aka: Jianliang Wu
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-12-12 21:02 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: