default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRongxia Hao
Rong-Xia Hao
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
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j102]Wenjuan Zhou, Rong-Xia Hao
, Yilun Luo:
Perfect matching cover indices of generalized rotation snarks. Appl. Math. Comput. 487: 129101 (2025)- [j101]Mei-Li Wang, Rong-Xia Hao, Jou-Ming Chang, Sejeong Bang:
2-Edge Hamiltonian connectedness: Characterization and results in data center networks. Appl. Math. Comput. 490: 129197 (2025) - [j100]Siyan Liu, Rong-Xia Hao, Rong Luo, Cun-Quan Zhang:
Five-cycle double cover and shortest cycle cover. J. Graph Theory 108(1): 39-49 (2025) - [j99]Wen-Han Zhu, Rong-Xia Hao, Jou-Ming Chang, Jaeun Lee:
Packing internally disjoint Steiner paths of data center networks. J. Supercomput. 81(1): 211 (2025) - 2024
- [j98]Rong-Xia Hao, Xiao-Wen Qin, Hui Zhang, Jou-Ming Chang:
Two-disjoint-cycle-cover pancyclicity of data center networks. Appl. Math. Comput. 475: 128716 (2024) - [j97]Lin Li, Rong-Xia Hao, Wen-Han Zhu:
The 3-path-connectivity of the star graphs. Discret. Appl. Math. 357: 215-235 (2024) - [j96]Wen-Han Zhu, Rong-Xia Hao, Kung-Jui Pai, Eddie Cheng:
Reliability analysis of exchanged hypercubes based on the path connectivity. Discret. Appl. Math. 358: 404-416 (2024) - [j95]Xiao-Wen Qin, Rong-Xia Hao, Sheng-Lung Peng:
Diagnosability of multigraph composition networks. Theor. Comput. Sci. 988: 114375 (2024) - [j94]Huimei Guo, Rong-Xia Hao, Jou-Ming Chang, Young Soo Kwon:
Hyper star structure connectivity of hierarchical folded cubic networks. J. Supercomput. 80(10): 14224-14241 (2024) - 2023
- [j93]Wen-Han Zhu, Rong-Xia Hao, Yan-Quan Feng, Jaeun Lee:
The 3-path-connectivity of the k-ary n-cube. Appl. Math. Comput. 436: 127499 (2023) - [j92]Wen-Han Zhu, Rong-Xia Hao, Yan-Quan Feng, Jaeun Lee:
Path connectivity of line graphs and total graphs of complete bipartite graphs. Appl. Math. Comput. 457: 128182 (2023) - [j91]Hui Zhang, Rong-Xia Hao, Hong-Jian Lai, Jaeun Lee:
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs. Discret. Appl. Math. 338: 320-328 (2023) - [j90]Pengfei Li, Aimei Yu, Rongxia Hao:
On the Dα-spectral radius of cacti and bicyclic graphs. Discret. Math. 346(1): 113134 (2023) - [j89]Hengzhe Li, Jiajia Wang, Rong-Xia Hao:
The λ4-Connectivity of the Cartesian Product of Trees. J. Interconnect. Networks 23(3): 2250007:1-2250007:22 (2023) - [j88]Siyan Liu, Rong-Xia Hao, Rong Luo, Cun-Quan Zhang:
5-Cycle Double Covers, 4-Flows, and Catlin Reduction. SIAM J. Discret. Math. 37(1): 253-267 (2023) - [j87]Hui Zhang, Rong-Xia Hao, Xiao-Wen Qin, Cheng-Kuan Lin, Sun-Yuan Hsieh:
The High Faulty Tolerant Capability of the Alternating Group Graphs. IEEE Trans. Parallel Distributed Syst. 34(1): 225-233 (2023) - 2022
- [j86]Shu-Li Zhao, Rong-Xia Hao, Chao Wei:
Internally disjoint trees in the line graph and total graph of the complete bipartite graph. Appl. Math. Comput. 422: 126990 (2022) - [j85]Xiao-Chen Li, Rong-Xia Hao:
The vertex Turán density in 3-ary n-cubes. Discret. Appl. Math. 311: 129-141 (2022) - [j84]Shao-Liang Chen, Rong-Xia Hao, Xiao-Wen Qin:
Bounds for the connected domination number of maximal outerplanar graphs. Discret. Appl. Math. 320: 235-244 (2022) - [j83]Wen-Han Zhu, Rong-Xia Hao, Lin Li:
The 3-path-connectivity of the hypercubes. Discret. Appl. Math. 322: 203-209 (2022) - [j82]Xiao-Wen Qin, Rong-Xia Hao, Jie Wu:
Construction of Dual-CISTs on an Infinite Class of Networks. IEEE Trans. Parallel Distributed Syst. 33(8): 1902-1910 (2022) - [c1]Xiao-Wen Qin, Rong-Xia Hao, Sheng-Lung Peng:
Fault Diagnosability of Multigraph Matching Composition Networks. ICS 2022: 145-155 - 2021
- [j81]Xiao-Wen Qin, Rong-Xia Hao:
Reliability analysis based on the dual-CIST in shuffle-cubes. Appl. Math. Comput. 397: 125900 (2021) - [j80]Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang:
Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction. Appl. Math. Comput. 410: 126441 (2021) - [j79]Shu-Li Zhao, Rong-Xia Hao, Sheng-Lung Peng:
Reliability Assessment of Some Regular Networks. Comput. J. 64(1): 1-6 (2021) - [j78]Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao:
Strong Menger Connectedness of Augmented k-ary n-cubes. Comput. J. 64(5): 812-825 (2021) - [j77]Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang:
Reliability Analysis of Alternating Group Graphs and Split-Stars. Comput. J. 64(9): 1425-1436 (2021) - [j76]Shu-Li Zhao, Rong-Xia Hao, Jie Wu:
The generalized 4-connectivity of hierarchical cubic networks. Discret. Appl. Math. 289: 194-206 (2021) - [j75]Chao Wei, Rong-Xia Hao, Jou-Ming Chang:
The reliability analysis based on the generalized connectivity in balanced hypercubes. Discret. Appl. Math. 292: 19-32 (2021) - [j74]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng, Erling Wei:
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions. Discret. Appl. Math. 304: 137-152 (2021) - [j73]Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang:
Berge-Fulkerson coloring for some families of superposition snarks. Eur. J. Comb. 96: 103344 (2021) - [j72]Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang, Zhang Zhang:
Berge-Fulkerson coloring for C ( 12 ) -linked permutation graphs. J. Graph Theory 98(4): 662-675 (2021) - [j71]Chao Wei, Rong-Xia Hao, Jou-Ming Chang:
Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes. J. Parallel Distributed Comput. 154: 42-53 (2021) - [j70]Rong-Xia Hao, Zeng-Xian Tian:
The vertex-pancyclicity of data center networks. Theor. Comput. Sci. 855: 74-89 (2021) - 2020
- [j69]Chao Wei, Rong-Xia Hao, Jou-Ming Chang:
Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes. Appl. Math. Comput. 381: 125305 (2020) - [j68]Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao:
On Computing Component (Edge) Connectivities of Balanced Hypercubes. Comput. J. 63(9): 1311-1320 (2020) - [j67]Mei-Mei Gu, Rong-Xia Hao, Eddie Cheng:
Note on Applications of Linearly Many Faults. Comput. J. 63(9): 1406-1416 (2020) - [j66]Mei-Mei Gu, Rong-Xia Hao, Shyue-Ming Tang, Jou-Ming Chang:
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs. Discret. Appl. Math. 279: 80-91 (2020) - [j65]Xiao-Wen Qin, Rong-Xia Hao, Kung-Jui Pai, Jou-Ming Chang:
Comments on "A Hamilton sufficient condition for completely independent spanning tree". Discret. Appl. Math. 283: 730-733 (2020) - [j64]Shengjie He, Rong-Xia Hao, Yan-Quan Feng:
On the edge-Szeged index of unicyclic graphs with perfect matchings. Discret. Appl. Math. 284: 207-223 (2020) - [j63]Shu-Li Zhao, Rong-Xia Hao:
The fault tolerance of (n, k)-bubble-sort networks. Discret. Appl. Math. 285: 204-211 (2020) - [j62]Shu-Li Zhao, Jou-Ming Chang, Rong-Xia Hao:
Reliability assessment of the Cayley graph generated by trees. Discret. Appl. Math. 287: 10-14 (2020) - [j61]Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao:
On Component Connectivity of Hierarchical Star Networks. Int. J. Found. Comput. Sci. 31(3): 313-326 (2020) - [j60]Rong-Xia Hao, Mei-Mei Gu, Jou-Ming Chang:
Relationship between extra edge connectivity and component edge connectivity for regular graphs. Theor. Comput. Sci. 833: 41-55 (2020) - [j59]Xiao-Wen Qin, Rong-Xia Hao, Jou-Ming Chang:
The Existence of Completely Independent Spanning Trees for Some Compound Graphs. IEEE Trans. Parallel Distributed Syst. 31(1): 201-210 (2020)
2010 – 2019
- 2019
- [j58]Shu-Li Zhao, Rong-Xia Hao:
Reliability Assessment of Hierarchical Hypercube Networks. IEEE Access 7: 54015-54023 (2019) - [j57]Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang:
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity. IEEE Access 7: 97745-97759 (2019) - [j56]Shu-Li Zhao, Rong-Xia Hao:
The generalized 4-connectivity of exchanged hypercubes. Appl. Math. Comput. 347: 342-353 (2019) - [j55]Xiao-Wen Qin, Jou-Ming Chang, Rong-Xia Hao:
Constructing dual-CISTs of DCell data center networks. Appl. Math. Comput. 362 (2019) - [j54]Shu-Li Zhao, Rong-Xia Hao:
The Generalized Three-Connectivity of Two Kinds of Cayley Graphs. Comput. J. 62(1): 144-149 (2019) - [j53]Shu-Li Zhao, Rong-Xia Hao, Lidong Wu:
The Generalized Connectivity of (n, k)-Bubble-Sort Graphs. Comput. J. 62(9): 1277-1283 (2019) - [j52]Shu-Li Zhao, Rong-Xia Hao, Eddie Cheng:
Two kinds of generalized connectivity of dual cubes. Discret. Appl. Math. 257: 306-316 (2019) - [j51]Yuan Yuan, Rong-Xia Hao:
Toughness condition for the existence of all fractional (a, b, k)-critical graphs. Discret. Math. 342(8): 2308-2314 (2019) - [j50]Chen Song, Rong-Xia Hao:
Antimagic orientations of disconnected even regular graphs. Discret. Math. 342(8): 2350-2355 (2019) - [j49]Rong-Xia Hao, Yuan Yuan:
Independence number, connectivity and all fractional (a, b, k)-critical graphs. Discuss. Math. Graph Theory 39(1): 183-190 (2019) - [j48]Shu-Li Zhao, Rong-Xia Hao:
The Generalized Connectivity of Bubble-Sort Star Graphs. Int. J. Found. Comput. Sci. 30(5): 793-809 (2019) - [j47]Yuan Yuan, Rong-Xia Hao:
A degree condition for fractional [a, b]-covered graphs. Inf. Process. Lett. 143: 20-23 (2019) - [j46]Chen Song, Rong-Xia Hao:
Antimagic orientations for the complete k-ary trees. J. Comb. Optim. 38(4): 1077-1085 (2019) - [j45]Shu-Li Zhao, Rong-Xia Hao, Jie Wu:
The generalized 3-connectivity of some Regular Networks. J. Parallel Distributed Comput. 133: 18-29 (2019) - [j44]Mei-Mei Gu, Rong-Xia Hao, Shuming Zhou:
Fault diagnosability of data center networks. Theor. Comput. Sci. 776: 138-147 (2019) - [j43]Mei-Mei Gu, Shengjie He, Rong-Xia Hao, Eddie Cheng:
Strongly Menger connectedness of data center network and (n, k)-star graph. Theor. Comput. Sci. 799: 94-103 (2019) - [p1]Eddie Cheng, Rong-Xia Hao, Ke Qiu, Zhizhang Shen:
Structural Properties and Fault Resiliency of Interconnection Networks. From Parallel to Emergent Computing 2019: 77-102 - [i4]Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao:
Strong Menger connectedness of augmented k-ary n-cubes. CoRR abs/1910.00852 (2019) - 2018
- [j42]Shengjie He, Rong-Xia Hao, Liancui Zuo:
The linear (n-1)-arboricity of some lexicographic product graphs. Appl. Math. Comput. 338: 152-163 (2018) - [j41]Mei-Mei Gu, Rong-Xia Hao:
Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges. Ars Comb. 140: 45-61 (2018) - [j40]Rong-Xia Hao:
A note on the directed genus of Kn, n, n and Kn. Ars Math. Contemp. 14(2): 375-385 (2018) - [j39]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng, Ai-Mei Yu:
The 3-extra Connectivity and Faulty Diagnosability. Comput. J. 61(5): 672-686 (2018) - [j38]Xiao-Wen Qin, Rong-Xia Hao:
Hamiltonian properties of some compound networks. Discret. Appl. Math. 239: 174-182 (2018) - [j37]Mei-Mei Gu, Rong-Xia Hao:
Reliability analysis of Cayley graphs generated by transpositions. Discret. Appl. Math. 244: 94-102 (2018) - [j36]Xiao-Wen Qin, Rong-Xia Hao:
Conditional edge-fault-tolerant Hamiltonicity of the data center network. Discret. Appl. Math. 247: 165-179 (2018) - [j35]Shu-Li Zhao, Rong-Xia Hao:
The generalized connectivity of alternating group graphs and (n, k)-star graphs. Discret. Appl. Math. 251: 310-321 (2018) - [j34]Mei-Mei Gu, Rong-Xia Hao, Lei Jiang:
Fault-tolerance and diagnosability of hierarchical star networks. Int. J. Comput. Math. Comput. Syst. Theory 3(2): 106-121 (2018) - [j33]Mei-Mei Gu, Rong-Xia Hao, Jian-Bing Liu:
The pessimistic diagnosability of data center networks. Inf. Process. Lett. 134: 52-56 (2018) - [j32]Rongxia Hao, Cun-Quan Zhang, Ting Zheng:
Berge-Fulkerson coloring for C(8)-linked graphs. J. Graph Theory 88(1): 46-60 (2018) - [j31]Shengjie He, Rong-Xia Hao, Eddie Cheng:
Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks. Theor. Comput. Sci. 731: 50-67 (2018) - [i3]Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang:
The Component Connectivity of Alternating Group Graphs and Split-Stars. CoRR abs/1812.00617 (2018) - 2017
- [j30]Mei-Mei Gu, Rong-Xia Hao:
The pessimistic diagnosability of three kinds of graphs. Discret. Appl. Math. 217: 548-556 (2017) - [j29]Yan Liu, Aimei Yu, Mei Lu, Rong-Xia Hao:
On the Szeged index of unicyclic graphs with given diameter. Discret. Appl. Math. 233: 118-130 (2017) - [j28]Mei-Mei Gu, Rong-Xia Hao, Jian-Bing Liu:
On the extraconnectivity of k-ary n-cube networks. Int. J. Comput. Math. 94(1): 95-106 (2017) - [j27]Mei-Mei Gu, Rong-Xia Hao, Ai-Mei Yu:
The 1-Good-Neighbor Conditional Diagnosability of Some Regular Graphs. J. Interconnect. Networks 17(3-4): 1741001:1-1741001:13 (2017) - [j26]Xiang Xu, Xiaowang Li, Shuming Zhou, Rong-Xia Hao, Mei-Mei Gu:
The g-good-neighbor diagnosability of (n, k)-star graphs. Theor. Comput. Sci. 659: 53-63 (2017) - [j25]Mei-Mei Gu, Rong-Xia Hao, Jun-Ming Xu, Yan-Quan Feng:
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs. Theor. Comput. Sci. 690: 59-72 (2017) - [i2]Mei-Mei Gu, Rong-Xia Hao, Shuming Zhou:
Fault diagnosability of data center networks. CoRR abs/1702.00259 (2017) - 2016
- [j24]Cairen Wenmao, Rong-Xia Hao, Weili He:
The genus of the balanced hypercube. Discret. Math. Algorithms Appl. 8(1): 1650008:1-1650008:8 (2016) - [j23]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng:
The pessimistic diagnosability of bubble-sort star graphs and augmented k-ary n-cubes. Int. J. Comput. Math. Comput. Syst. Theory 1(3-4): 98-112 (2016) - [j22]Mei-Mei Gu, Rong-Xia Hao, Dond-Xue Yang:
A Short Note on the 1, 2-Good-Neighbor Diagnosability of Balanced Hypercubes. J. Interconnect. Networks 16(2): 1650001:1-1650001:12 (2016) - [j21]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng:
Edge Fault-Tolerant Strong Hamiltonian Laceability of Balanced Hypercubes. J. Interconnect. Networks 16(2): 1650002:1-1650002:17 (2016) - [j20]Rong-Xia Hao, Mei-Mei Gu, Huan Luo, Aimei Yu:
A Note on the Pessimistic Diagnosability of Augmented Cubes. J. Interconnect. Networks 16(3-4): 1671001:1-1671001:8 (2016) - [j19]Rong-Xia Hao, Mei-Mei Gu, Yan-Quan Feng:
The pessimistic diagnosabilities of some general regular graphs. Theor. Comput. Sci. 609: 413-420 (2016) - [j18]Rong-Xia Hao, Zeng-Xian Tian, Jun-Ming Xu:
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs. Theor. Comput. Sci. 627: 36-53 (2016) - 2015
- [j17]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Embedding even cycles on folded hypercubes with conditional faulty edges. Inf. Process. Lett. 115(12): 945-949 (2015) - [j16]Dongqin Cheng, Rong-Xia Hao:
Various cycles embedding in faulty balanced hypercubes. Inf. Sci. 297: 140-153 (2015) - [j15]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng:
Fault-Tolerant Cycle Embedding in Balanced Hypercubes with Faulty Vertices and Faulty Edges. J. Interconnect. Networks 15(1-2): 1550002:1-1550002:16 (2015) - 2014
- [j14]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Two node-disjoint paths in balanced hypercubes. Appl. Math. Comput. 242: 127-142 (2014) - [j13]Rong-Xia Hao, Ru Zhang, Yan-Quan Feng, Jin-Xin Zhou:
Hamiltonian cycle embedding for fault tolerance in balanced hypercubes. Appl. Math. Comput. 244: 447-456 (2014) - [j12]Mei-Mei Gu, Rong-Xia Hao:
3-extra connectivity of 3-ary n-cube networks. Inf. Process. Lett. 114(9): 486-491 (2014) - [j11]Dongqin Cheng, Rong-Xia Hao:
Fault-tolerant cycles embedding in hypercubes with faulty edges. Inf. Sci. 282: 57-69 (2014) - [j10]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Odd cycles embedding on folded hypercubes with conditional faulty edges. Inf. Sci. 282: 180-189 (2014) - [j9]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Vertex-fault-tolerant cycles embedding in balanced hypercubes. Inf. Sci. 288: 449-461 (2014) - 2013
- [j8]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Cycles embedding on folded hypercubes with faulty nodes. Discret. Appl. Math. 161(18): 2894-2900 (2013) - [j7]Rong-Xia Hao, Yan-Quan Feng, Jin-Xin Zhou:
Conditional Diagnosability of Alternating Group Graphs. IEEE Trans. Computers 62(4): 827-831 (2013) - [j6]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Conditional edge-fault pancyclicity of augmented cubes. Theor. Comput. Sci. 510: 94-101 (2013) - [i1]Mei-Mei Gu, Rong-Xia Hao:
3-extra connectivity of 3-ary n-cube networks. CoRR abs/1309.5083 (2013) - 2012
- [j5]Xingkuo Li, Rongxia Hao, Jiangen Zhang:
Orientable Embedding Distributions by Genus of Crossing-Digraph. Ars Comb. 106: 417-421 (2012) - [j4]Jianchu Zeng, Yanpei Liu, Rongxia Hao:
Counting Orientable Embeddings by Genus for a Type of 3-Regular Graph. Graphs Comb. 28(1): 133-142 (2012)
2000 – 2009
- 2009
- [j3]Rongxia Hao, Yanpei Liu, Taoye Zhang, Lanshuan Xu:
The genus distributions of 4-regular digraphs. Australas. J Comb. 43: 79-90 (2009) - [j2]Rongxia Hao, Jianbing Niu, Xiaofeng Wang, Cun-Quan Zhang, Taoye Zhang:
A note on Berge-Fulkerson coloring. Discret. Math. 309(13): 4235-4240 (2009) - 2008
- [j1]Rongxia Hao, Yanpei Liu:
The genus distributions of directed antiladders in orientable surfaces. Appl. Math. Lett. 21(2): 161-164 (2008)
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-01-26 23:45 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:
