default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuizhen Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j94]Yunxia Huang
, Guizhen Liu, Lingxiao Wang, Huajie Chen, Shuwu Xu:
Atmospheric Methane Retrieval Based on Back Propagation Neural Network and Simulated AVIRIS-NG Data. IEEE Geosci. Remote. Sens. Lett. 21: 1-5 (2024)- 2023
- [c17]Wenyi Xu, Shu Zhou, Guizhen Liu, Zhengxiang Wang:
AI Algorithm Evaluation and Regulation: Challenges and Countermeasures for Artificial Intelligence Risk Management. ICBAR 2023: 386-391 - 2021
- [j93]Zhenjiang Wu, Jiahua Zhang, Fan Deng, Sha Zhang, Da Zhang, Lan Xun, Tehseen Javed, Guizhen Liu, Dan Liu, Mengfei Ji:
Fusion of GF and MODIS Data for Regional-Scale Grassland Community Classification with EVI2 Time-Series and Phenological Features. Remote. Sens. 13(5): 835 (2021)
2010 – 2019
- 2019
- [c16]Ying Yu, Yuanfeng Li, Yingjie Zhao, Guizhen Liu, Jianjun Wu:
Design and Finite Element Analysis of Anastomosis System for Digestive Tract Surgery. ROBIO 2019: 2694-2698 - 2018
- [c15]Ying Yu, Yuanfeng Li, Guizhen Liu, Jianjun Wu, Xiaohai Li:
Stability Analysis of the Key Parts of the Continuous Body of Laryngeal Surgery. ICIA 2018: 1390-1397 - 2017
- [j92]Xia Zhang, Jianfeng Hou, Guizhen Liu, Guiying Yan:
Graphs of f-class 1. Discret. Appl. Math. 222: 197-204 (2017) - [c14]Ying Yu, Jiongjie Zhao, Guizhen Liu, Yongjie Li:
Research on the docking longitudinal replenishment at sea based on ABAQUS and virtual simulation technology. ICIA 2017: 820-825 - 2016
- [c13]Ying Yu, Guizhen Liu, Baolin Yin, Jiongjie Zhao, Jianjun Wu:
Design and finite element analysis of 6-RUS parallel connection mechanism. ICIA 2016: 398-402 - 2015
- [j91]Xin Zhang, Jianfeng Hou, Guizhen Liu:
On total colorings of 1-planar graphs. J. Comb. Optim. 30(1): 160-173 (2015) - [c12]Ying Yu, Guizhen Liu, Jianjun Wu, Zhenkun Zhu, Jiongjie Zhao:
Kinematics analysis and Simulation of the laryngeal minimally invasive operation continuum mechanism. ICIA 2015: 603-608 - 2014
- [j90]Hao Fan, Guizhen Liu:
The E2-Hamiltonian Property of Circuit Graphs of Matroids. Ars Comb. 113: 299-305 (2014) - [j89]Xin Zhang, Guizhen Liu:
On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree. Ars Math. Contemp. 7(2): 281-291 (2014) - [j88]Guanghui Wang, Tao Wang, Guizhen Liu:
Long properly colored cycles in edge colored complete graphs. Discret. Math. 324: 56-61 (2014) - [j87]Jinbo Li, Guizhen Liu, Guanghui Wang:
Fractional f-Edge Cover Chromatic Index of Graphs. Graphs Comb. 30(3): 687-698 (2014) - [j86]Huijuan Wang, Bin Liu, Jianliang Wu, Guizhen Liu:
Total coloring of embedded graphs with maximum degree at least seven. Theor. Comput. Sci. 518: 1-9 (2014) - 2013
- [j85]Guanghui Wang, Bingqiang Liu, Guizhen Liu:
A note on Rainbow Matchings. Discret. Math. Algorithms Appl. 5(4) (2013) - [j84]Aijun Dong, Guizhen Liu, Guojun Li:
List Edge and List Total Colorings of Planar Graphs without non-induced 7-cycles. Discret. Math. Theor. Comput. Sci. 15(1): 101-106 (2013) - [i11]Guanghui Wang, Tao Wang, Guizhen Liu:
Long properly colored cycles in edge-colored complete graphs. CoRR abs/1301.0450 (2013) - [i10]Xin Zhang, Jianfeng Hou, Guizhen Liu:
On total colorings of 1-planar graphs. CoRR abs/1304.6263 (2013) - 2012
- [j83]Xin Zhang, Guizhen Liu:
On edge colorings of 1-planar graphs without chordal 5-cycles. Ars Comb. 104: 431-436 (2012) - [j82]Renying Chang, Yan Zhu, Guizhen Liu:
Toughness and [a, b]-factors in graphs. Ars Comb. 105: 451-456 (2012) - [j81]Xin Zhang, Guanghui Wang, Yong Yu, Jinbo Li, Guizhen Liu:
On r-acyclic edge colorings of planar graphs. Discret. Appl. Math. 160(13-14): 2048-2053 (2012) - [j80]Xin Zhang, Guizhen Liu, Jianliang Wu:
1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs. Discret. Math. 312(5): 999-1005 (2012) - [j79]Xin Zhang, Guizhen Liu, Jianliang Wu:
Edge covering pseudo-outerplanar graphs with forests. Discret. Math. 312(18): 2788-2799 (2012) - [j78]Jianfeng Hou, Guizhen Liu:
A Bound on the bondage Number of toroidal Graphs. Discret. Math. Algorithms Appl. 4(3) (2012) - [j77]Jianfeng Hou, Guizhen Liu, Jianliang Wu:
Acyclic Edge Coloring of Planar Graphs Without Small Cycles. Graphs Comb. 28(2): 215-226 (2012) - [j76]Guanghui Wang, Bin Liu, Jiguo Yu, Guizhen Liu:
Circular Coloring of Planar Digraphs. Graphs Comb. 28(6): 889-900 (2012) - [j75]Guanghui Wang, Hao Li, Yan Zhu, Guizhen Liu:
A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs. Graphs Comb. 28(6): 901-905 (2012) - [j74]Xin Zhang, Guizhen Liu:
On edge colorings of 1-planar graphs without adjacent triangles. Inf. Process. Lett. 112(4): 138-142 (2012) - 2011
- [j73]Guanghui Wang, Guizhen Liu:
Circular choosability of planar graphs with large girth. Ars Comb. 99: 65-73 (2011) - [j72]Jiansheng Cai, Liansheng Ge, Xia Zhang, Guizhen Liu:
Edge-choosability of planar graphs without chordal 7-Cycles. Ars Comb. 100: 169-176 (2011) - [j71]Jinbo Li, Guizhen Liu, Bin Liu:
On edge cover coloring of join graphs. Ars Comb. 100: 299-306 (2011) - [j70]Jianfeng Hou, Bin Liu, Guizhen Liu, Jianliang Wu:
Total coloring of planar graphs without 6-cycles. Discret. Appl. Math. 159(2-3): 157-163 (2011) - [j69]Jianfeng Hou, Guizhen Liu, Guanghui Wang:
Improved bounds for acyclic chromatic index of planar graphs. Discret. Appl. Math. 159(8): 876-881 (2011) - [j68]Guanghui Wang, Shan Zhou, Guizhen Liu, Jianliang Wu:
Circular vertex arboricity. Discret. Appl. Math. 159(12): 1231-1238 (2011) - [j67]Xin Zhang, Jianliang Wu, Guizhen Liu:
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree. Discret. Math. Theor. Comput. Sci. 13(3): 9-16 (2011) - [j66]Xia Zhang, Guizhen Liu:
On edge covering colorings of graphs. Inf. Process. Lett. 111(20): 1004-1006 (2011) - [j65]Hao Fan, Hal A. Kierstead, Guizhen Liu, Theodore Molla, Jianliang Wu, Xin Zhang:
A note on relaxed equitable coloring of graphs. Inf. Process. Lett. 111(21-22): 1062-1066 (2011) - [j64]Xia Zhang, Guizhen Liu:
Equitable edge-colorings of simple graphs. J. Graph Theory 66(3): 175-197 (2011) - [i9]Xin Zhang, Guizhen Liu, Jianliang Wu:
k-forested choosability of graphs with bounded maximum average degree. CoRR abs/1102.3987 (2011) - [i8]Xin Zhang, Guizhen Liu:
Group edge choosability of planar graphs without adjacent short cycles. CoRR abs/1102.4980 (2011) - [i7]Yong Yu, Xin Zhang, Guizhen Liu:
List (d,1)-total labelling of graphs embedded in surfaces. CoRR abs/1105.1639 (2011) - [i6]Yong Yu, Guanghui Wang, Guizhen Liu:
List version of ($p$,1)-total labellings. CoRR abs/1105.1906 (2011) - [i5]Xin Zhang, Guizhen Liu, Jianliang Wu:
(1,λ)-embedded graphs and the acyclic edge choosability. CoRR abs/1106.4681 (2011) - [i4]Xin Zhang, Guizhen Liu, Jianliang Wu:
Edge covering pseudo-outerplanar graphs with forests. CoRR abs/1108.3877 (2011) - [i3]Xin Zhang, Guizhen Liu:
Total coloring of pseudo-outerplanar graphs. CoRR abs/1108.5009 (2011) - 2010
- [j63]Hongxia Liu, Guizhen Liu:
On fractional (g, f, n)-critical graphs. Ars Comb. 97 (2010) - [j62]Bin Liu, Guizhen Liu:
Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions. Graphs Comb. 26(6): 781-791 (2010) - [j61]Bin Liu, Guizhen Liu:
On the adjacent vertex distinguishing edge colourings of graphs. Int. J. Comput. Math. 87(4): 726-732 (2010) - [j60]Jianfeng Hou, Bin Liu, Guizhen Liu, Jihui Wang:
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles. Int. J. Comput. Math. 87(13): 2880-2886 (2010) - [j59]Xia Zhang, Jiguo Yu, Guizhen Liu:
On the fractional f-chromatic index of a graph. Int. J. Comput. Math. 87(15): 3359-3369 (2010) - [j58]Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu:
Acyclic edge chromatic number of outerplanar graphs. J. Graph Theory 64(1): 22-36 (2010) - [j57]Guizhen Liu, Jianfeng Hou:
The method of coloring in graphs and its application. J. Syst. Sci. Complex. 23(5): 951-960 (2010) - [c11]Guizhen Liu, Xuejun Pan, Jonathan Z. Sun:
A New Result on [k, k + 1]-Factors Containing Given Hamiltonian Cycles. COCOA (2) 2010: 170-180 - [i2]Xin Zhang, Guizhen Liu, Jianliang Wu:
Structural properties of 1-planar graphs and an application to acyclic edge coloring. CoRR abs/1008.5000 (2010) - [i1]Xin Zhang, Guizhen Liu, Jianliang Wu:
Edge Coloring of Triangle-Free 1-Planar Graphs. CoRR abs/1012.5921 (2010)
2000 – 2009
- 2009
- [j56]Jiansheng Cai, Guizhen Liu, Jianfeng Hou:
The stability number and connected [k, k+1]-factor in graphs. Appl. Math. Lett. 22(6): 927-931 (2009) - [j55]Jianfeng Hou, Guizhen Liu, Jianliang Wu:
On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability. Ars Comb. 91 (2009) - [j54]Hao Li, Xueliang Li, Guizhen Liu, Guanghui Wang:
The heterochromatic matchings in edge-colored bipartite graphs. Ars Comb. 93 (2009) - [j53]Hongxia Liu, Guizhen Liu:
A Neighborhood Condition for Graphs to Have (g, f)-Factors. Ars Comb. 93 (2009) - [j52]Jianfeng Hou, Guizhen Liu, Jiansheng Cai:
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles. Discret. Math. 309(1): 77-84 (2009) - [j51]Jin Yan, Guizhen Liu:
On 2-factors with cycles containing specified edges in a bipartite graph. Discret. Math. 309(5): 1112-1117 (2009) - [j50]Bin Liu, Jianfeng Hou, Jianliang Wu, Guizhen Liu:
Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discret. Math. 309(20): 6035-6043 (2009) - [j49]Changqing Xu, Guizhen Liu:
On Super F-Edge Cover-Coloring in multigraphs. Discret. Math. Algorithms Appl. 1(4): 531-540 (2009) - [j48]Jiansheng Cai, Jianfeng Hou, Xia Zhang, Guizhen Liu:
Edge-choosability of planar graphs without non-induced 5-cycles. Inf. Process. Lett. 109(7): 343-346 (2009) - [j47]Meijie Ma, Xuegong Tan, Jun-Ming Xu, Guizhen Liu:
A note on "The super connectivity of augmented cubes". Inf. Process. Lett. 109(12): 592-593 (2009) - [j46]Guanghui Wang, Guizhen Liu:
Paths, cycles and circular colorings in digraphs. Theor. Comput. Sci. 410(21-23): 1982-1985 (2009) - [j45]Dongxiao Yu, Jianfeng Hou, Guizhen Liu, Bin Liu, Lan Xu:
Acyclic edge coloring of planar graphs with large girth. Theor. Comput. Sci. 410(47-49): 5196-5200 (2009) - 2008
- [j44]Xia Zhang, Guizhen Liu:
Some graphs of class 1 for f-colorings. Appl. Math. Lett. 21(1): 23-29 (2008) - [j43]Xia Zhang, Jihui Wang, Guizhen Liu:
The Classification of Regular Graphs on f-colorings. Ars Comb. 86 (2008) - [j42]Guizhen Liu, Qinglin Yu:
Strongly pan-factorial property in cages. Ars Comb. 87 (2008) - [j41]Jiansheng Cai, Guizhen Liu:
Stability Number and f-factor in K1, n-free Graphs. Ars Comb. 89 (2008) - [j40]Ping Li, Guizhen Liu:
Hamilton cycles in circuit graphs of matroids. Comput. Math. Appl. 55(4): 654-659 (2008) - [j39]Guizhen Liu, Lanju Zhang:
Characterizations of maximum fractional (g, f)-factors of graphs. Discret. Appl. Math. 156(12): 2293-2299 (2008) - [j38]Guizhen Liu, Lanju Zhang:
Toughness and the existence of fractional k-factors of graphs. Discret. Math. 308(9): 1741-1748 (2008) - [j37]Changqing Xu, Guizhen Liu:
Edge covered critical multigraphs. Discret. Math. 308(24): 6348-6354 (2008) - [j36]Changqing Xu, Guizhen Liu:
A note on the edge cover chromatic index of multigraphs. Discret. Math. 308(24): 6564-6568 (2008) - [j35]Jianfeng Hou, Yan Zhu, Guizhen Liu, Jianliang Wu, Mei Lan:
Total Colorings of Planar Graphs without Small Cycles. Graphs Comb. 24(2): 91-100 (2008) - [j34]Jiansheng Cai, Guizhen Liu, Jianfeng Hou:
Binding number and Hamiltonian (g, f)-factors in graphs II. Int. J. Comput. Math. 85(9): 1325-1331 (2008) - [j33]Guizhen Liu, Jianbo Qian, Jonathan Z. Sun, Rui Xu:
Bipartite Toughness and k-Factors in Bipartite Graphs. Int. J. Math. Math. Sci. 2008: 597408:1-597408:8 (2008) - [j32]Meijie Ma, Guizhen Liu, Jun-Ming Xu:
The super connectivity of augmented cubes. Inf. Process. Lett. 106(2): 59-63 (2008) - [j31]Bin Liu, Jianfeng Hou, Guizhen Liu:
List edge and list total colorings of planar graphs without short cycles. Inf. Process. Lett. 108(6): 347-351 (2008) - [j30]Guizhen Liu, Ping Li:
Paths in circuit graphs of matroids. Theor. Comput. Sci. 396(1-3): 258-263 (2008) - [j29]Meijie Ma, Guizhen Liu, Jun-Ming Xu:
Fault-tolerant embedding of paths in crossed cubes. Theor. Comput. Sci. 407(1-3): 110-116 (2008) - 2007
- [j28]Meijie Ma, Guizhen Liu, Xiangfeng Pan:
Path embedding in faulty hypercubes. Appl. Math. Comput. 192(1): 233-238 (2007) - [j27]Guizhen Liu, Qinglin Yu, Lanju Zhang:
Maximum fractional factors in graphs. Appl. Math. Lett. 20(12): 1237-1243 (2007) - [j26]Jin Yan, Guizhen Liu:
On 2-Factors with Quadrilaterals Containing Specified Vertices in a Bipartite Graph. Ars Comb. 82 (2007) - [j25]Jihui Wang, Guizhen Liu:
Some Results on Fractional Edge Coloring of Graphs. Ars Comb. 83 (2007) - [j24]Ping Li, Guizhen Liu:
Cycles in Circuit Graphs of Matroids. Graphs Comb. 23(4): 425-431 (2007) - [j23]Guizhen Liu, Jianfeng Hou, Jiansheng Cai:
Some results about f-critical graphs. Networks 50(3): 197-202 (2007) - [j22]Meijie Ma, Guizhen Liu, Jun-Ming Xu:
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes. Parallel Comput. 33(1): 36-42 (2007) - [j21]Jianliang Wu, Jianfeng Hou, Guizhen Liu:
The linear arboricity of planar graphs with no short cycles. Theor. Comput. Sci. 381(1-3): 230-233 (2007) - [c10]Jiguo Yu, Guizhen Liu:
Notes on Fractional (1, f )-Odd Factors of Graphs. FAW 2007: 310-316 - [c9]Jiansheng Cai, Guizhen Liu, Jianfeng Hou:
Binding Number and Connected ( g , f + 1)-Factors in Graphs. International Conference on Computational Science (3) 2007: 313-319 - [c8]Jianfeng Hou, Guizhen Liu, Jianliang Wu:
Some Results on List Total Colorings of Planar Graphs. International Conference on Computational Science (3) 2007: 320-328 - [c7]Xia Zhang, Guizhen Liu:
A Class of Graphs of f -Class 1. International Conference on Computational Science (3) 2007: 362-369 - [c6]Ping Li, Guizhen Liu:
The Edge Connectivity of Circuit Graphs of Matroids. International Conference on Computational Science (3) 2007: 440-443 - [c5]Huimin Song, Jianliang Wu, Guizhen Liu:
The Equitable Edge-Coloring of Series-Parallel Graphs. International Conference on Computational Science (3) 2007: 457-460 - [c4]Jiguo Yu, Na Wang, Xingjian Feng, Guizhen Liu:
A Note on Factional Extendable Graphs. IMECS 2007: 2270-2273 - [c3]Guizhen Liu:
Some Results on Fractional Graph Theory. KyotoCGGT 2007: 108-118 - 2006
- [j20]Xia Zhang, Guizhen Liu:
Some sufficient conditions for a graph to be of Cf 1. Appl. Math. Lett. 19(1): 38-44 (2006) - [j19]Jiansheng Cai, Guizhen Liu:
Stability Number and Fractional F-factors in Graphs. Ars Comb. 80 (2006) - [j18]Kefeng Diao, Guizhen Liu, Dieter Rautenbach, Ping Zhao:
A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. Discret. Math. 306(7): 670-672 (2006) - [j17]Jianfeng Hou, Guizhen Liu, Jiansheng Cai:
List edge and list total colorings of planar graphs without 4-cycles. Theor. Comput. Sci. 369(1-3): 250-255 (2006) - 2005
- [c2]Guizhen Liu, Changqing Xu:
Some Topics on Edge-Coloring. CJCDGCGT 2005: 101-108 - 2004
- [j16]Guizhen Liu, Wenan Zang:
f-Factors in bipartite (mf)-graphs. Discret. Appl. Math. 136(1): 45-54 (2004) - [j15]Yan Liu, Guizhen Liu:
Number of maximum matchings of bipartite graphs with positive surplus. Discret. Math. 274(1-3): 311-318 (2004) - 2003
- [j14]Guizhen Liu, Binhai Zhu:
Some Problems on Factorizations with Constraints in Bipartite Graphs. Discret. Appl. Math. 128(2-3): 421-434 (2003) - 2002
- [j13]Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu:
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. Int. J. Found. Comput. Sci. 13(6): 817-827 (2002) - [j12]Haodi Feng, Guizhen Liu:
Orthogonal factorizations of graphs. J. Graph Theory 40(4): 267-276 (2002) - [j11]Yan Liu, Guizhen Liu:
The fractional matching numbers of graphs. Networks 40(4): 228-231 (2002) - [c1]Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu:
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. IPCO 2002: 304-314 - 2001
- [j10]Guizhen Liu, Qinglin Yu:
Generalization of matching extensions in graphs. Discret. Math. 231(1-3): 311-320 (2001) - 2000
- [j9]Peter Che Bor Lam, Guizhen Liu, Guojun Li, Wai Chee Shiu:
Orthogonal (g, f)-factorizations in networks. Networks 35(4): 274-278 (2000)
1990 – 1999
- 1998
- [j8]Guizhen Liu, Qinglin Yu:
Toughness and Perfect Matchings in Graphs. Ars Comb. 48 (1998) - [j7]Litong Xie, Guizhen Liu, Baogang Xu:
On endo-homology of complexes of graphs. Discret. Math. 188(1-3): 285-291 (1998) - 1995
- [j6]Guizhen Liu:
Orthogonal (g, f)-factorizations in graphs. Discret. Math. 143(1-3): 153-158 (1995) - 1990
- [j5]Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu:
A simple existence criterion for (g<f)- factors. Discret. Math. 85(3): 313-317 (1990)
1980 – 1989
- 1989
- [j4]Brian Alspach, Guizhen Liu:
Paths and cycles in matroid base graphs. Graphs Comb. 5(1): 207-211 (1989) - 1988
- [j3]Guizhen Liu:
A lower bound on connectivities of matroid base graphs. Discret. Math. 69(1): 55-60 (1988) - [j2]Katherine Heinrich, Guizhen Liu:
A lower bound on the number of spanning trees with k end-vertices. J. Graph Theory 12(1): 95-100 (1988) - [j1]Guizhen Liu:
On connectivities of tree graphs. J. Graph Theory 12(3): 453-459 (1988)
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-08-06 21:06 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:
