default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMei Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j102]Hao Li, Liting Chen
, Mei Lu:
Two-disjoint-cycle-cover pancyclicity of split-star networks. Appl. Math. Comput. 487: 129085 (2025)- 2024
- [j101]Zequn Lv, Zhen He, Mei Lu:
Many triangles in C5-free graphs. Adv. Appl. Math. 159: 102740 (2024) - [j100]Mengyu Cao, Ke Liu, Mei Lu, Zequn Lv:
Treewidth of the q-Kneser graphs. Discret. Appl. Math. 342: 174-180 (2024) - [j99]Yi Zhang, Mei Lu:
Vertex degree sums for matchings in 3-uniform hypergraphs. Discret. Math. 347(6): 113959 (2024) - [j98]Mengyu Cao, Mei Lu, Benjian Lv, Kaishun Wang:
Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families. Eur. J. Comb. 120: 103958 (2024) - [j97]Jiaqi Liao, Zequn Lv, Mengyu Cao, Mei Lu:
Erdős-Ko-Rado theorem for bounded multisets. J. Comb. Theory, Ser. A 206: 105888 (2024) - [c11]Yichen Wang, Mei Lu:
A Polynomial Time Algorithm to Find Star Chromatic Index on Bounded Treewidth Graphs with Given Maximum Degree. AAIM (2) 2024: 76-85 - 2023
- [j96]Jiaqi Liao, Mengyu Cao, Mei Lu:
On the P3-hull numbers of q-Kneser graphs and Grassmann graphs. Appl. Math. Comput. 437: 127536 (2023) - [j95]Huiqing Liu, Mei Lu, Jing Zhao:
Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index. Appl. Math. Comput. 453: 128098 (2023) - [j94]Zhen He, Mei Lu, Zequn Lv:
Minimum tP3-saturation graphs. Discret. Appl. Math. 327: 148-156 (2023) - [j93]Yu Luan, Mei Lu, Yi Zhang:
Fractional matching preclusion numbers of Cartesian product graphs. Discret. Appl. Math. 338: 100-112 (2023) - [j92]Yu Yang, Bang-Bang Jin, Mei Lu, Zhihao Hui, Lu-Xuan Zhao, Hua Wang:
Computing the expected subtree number of random hexagonal and phenylene chains based on probability matrices. Discret. Appl. Math. 339: 184-201 (2023) - [j91]Jianfeng Wang, Xingyu Lei, Mei Lu, Sezer Sorgun, Hakan Küçük:
On graphs with exactly one anti-adjacency eigenvalue and beyond. Discret. Math. 346(6): 113373 (2023) - [j90]Jiaqi Liao, Mengyu Cao, Mei Lu:
Triangles in r-wise t-intersecting families. Eur. J. Comb. 112: 103731 (2023) - [j89]Zequn Lv, Zhen He, Mei Lu:
Saturation numbers for disjoint stars. J. Comb. Optim. 45(1): 11 (2023) - [j88]Mengyu Cao, Mei Lu, Benjian Lv, Kaishun Wang:
r-cross t-intersecting families for vector spaces. J. Comb. Theory A 193: 105688 (2023) - [c10]Carmen A. Van Ommen, Barbara S. Chaparro, Joseph Roland Keebler, Sanjay Batra, Mei Lu:
Validation of the PTPI Scale for Technology Products Among Users with Disabilities. HCI (10) 2023: 185-196 - 2022
- [j87]Jianfeng Wang, Mei Lu, Maurizio Brunetti, Lu Lu, Xueyi Huang:
Spectral determinations and eccentricity matrix of graphs. Adv. Appl. Math. 139: 102358 (2022) - [j86]Jia Guo, Mei Lu, Xin Wang:
The (strong) structure connectivity and (strong) substructure connectivity of the (n, k)-bubble-sort network. Appl. Math. Comput. 425: 127078 (2022) - [j85]Huiqing Liu, Mei Lu, Shunzhe Zhang:
Anti-Ramsey numbers for cycles in the generalized Petersen graphs. Appl. Math. Comput. 430: 127277 (2022) - [j84]Ke Liu, Mengyu Cao, Mei Lu:
Treewidth of the Generalized Kneser Graphs. Electron. J. Comb. 29(1) (2022) - [j83]Zequn Lv, Mei Lu, Chunqiu Fang:
Density of Balanced 3-Partite Graphs without 3-Cycles or 4-Cycles. Electron. J. Comb. 29(4) (2022) - [j82]Yu Luan, Mei Lu, Yi Zhang:
The fractional matching preclusion number of complete n-balanced k-partite graphs. J. Comb. Optim. 44(2): 1323-1329 (2022) - [j81]Zequn Lv, Mei Lu, Yi Zhang:
Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs. SIAM J. Discret. Math. 36(1): 241-251 (2022) - [j80]Mei Lu, Li Zhang, Fanzhang Li:
Adaptively local consistent concept factorization for multi-view clustering. Soft Comput. 26(3): 1043-1055 (2022) - [c9]He Ma, Yu Ji, Ye Zhu, Mei Lu, Zhiguo He, Li Li:
Precipitation Prediction Caused by Typhoon Based on LSTM network. ICCDA 2022: 43-48 - 2021
- [j79]Yisheng Jiang, Mei Lu:
Maximal augmented Zagreb index of trees with given diameter. Appl. Math. Comput. 395: 125855 (2021) - [j78]Jiale Xu, Mei Lu, Ke Liu:
Anti-Ramsey problems for cycles. Appl. Math. Comput. 408: 126345 (2021) - [j77]Zhen He, Mei Lu:
Saturation Number of $tK_{l, l, l}$ in the Complete Tripartite Graph. Electron. J. Comb. 28(4) (2021) - [j76]Xiaokang Han, Wenzhou Yan, Mei Lu:
Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling. Complex. 2021: 9930113:1-9930113:8 (2021) - [j75]Zequn Lv, Mei Lu:
The terminal-pairability problem in complete bipartite graphs. Discret. Appl. Math. 291: 64-67 (2021) - [j74]Chunqiu Fang, Ervin Györi, Mei Lu, Jimeng Xiao:
On the anti-Ramsey number of forests. Discret. Appl. Math. 291: 129-142 (2021) - [j73]Jia Guo, Mei Lu:
Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs. Discret. Appl. Math. 297: 109-119 (2021) - [j72]Yisheng Jiang, Mei Lu:
A note on the minimum inverse sum indeg index of cacti. Discret. Appl. Math. 302: 123-128 (2021) - [j71]Ke Liu, Mei Lu:
The treewidth of 2-section of hypergraphs. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j70]Yuxing Jia, Mei Lu, Yi Zhang:
Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees. Graphs Comb. 37(2): 409-433 (2021) - [j69]Ke Liu, Mei Lu:
Complete-Subgraph-Transversal-Sets problem on bounded treewidth graphs. J. Comb. Optim. 41(4): 923-933 (2021) - [j68]Yu Luan, Mei Lu, Yi Zhang:
The fractional (strong) matching preclusion number of complete k-partite graph. Theor. Comput. Sci. 893: 176-182 (2021) - 2020
- [j67]Yi Zhang, Mei Lu, Ke Liu:
Perfect matching and Hamilton cycle decomposition of complete balanced (k+1)-partite k-uniform hypergraphs. Appl. Math. Comput. 386: 125492 (2020) - [j66]Mei Lu, Fanzhang Li:
Survey on lie group machine learning. Big Data Min. Anal. 3(4): 235-258 (2020) - [j65]Jianfeng Wang, Mei Lu, Lu Lu, Francesco Belardo:
Spectral properties of the eccentricity matrix of graphs. Discret. Appl. Math. 279: 168-177 (2020) - [j64]Mei Lu, Wenjie Ning, Kun Wang:
Bounds on the locating-total domination number in trees. Discuss. Math. Graph Theory 40(1): 25-34 (2020) - [j63]Zhihong He, Mei Lu:
Super edge-connectivity and zeroth-order Randiæ index. Discuss. Math. Graph Theory 40(4): 971-984 (2020) - [j62]Jiao-Hong Yi, Mei Lu, Xiang-Jun Zhao:
Quantum inspired monarch butterfly optimisation for UCAV path planning navigation problem. Int. J. Bio Inspired Comput. 15(2): 75-89 (2020) - [c8]Zhiyi Gao, Fujiang Yu, Yongliang Wei, Hengxing Lu, Liangsong Zhang, Mei Lu, Ying Xu:
An Estimate of the Decay rate of Swells using Altimeter Data. IGARSS 2020: 5831-5834
2010 – 2019
- 2019
- [j61]Jia Guo, Mei Lu:
Edge-Bipancyclicity of Bubble-Sort Star Graphs. IEEE Access 7: 134158-134163 (2019) - [j60]Yi Zhang, Yi Zhao, Mei Lu:
Vertex Degree Sums for Matchings in 3-Uniform Hypergraphs. Electron. J. Comb. 26(4): 4 (2019) - [j59]Mei Lu, Jiale Xu, Yi Zhang:
Identifying codes in the direct product of a complete graph and some special graphs. Discret. Appl. Math. 254: 175-182 (2019) - [j58]Yisheng Jiang, Mei Lu:
Game total domination for cyclic bipartite graphs. Discret. Appl. Math. 265: 120-127 (2019) - [j57]Yi Zhang, Mei Lu:
Matching in 3-uniform hypergraphs. Discret. Math. 342(6): 1731-1737 (2019) - [j56]Mei Lu, Wenjie Ning, Kun Wang:
Bounding the locating-total domination number of a tree in terms of its annihilation number. Discuss. Math. Graph Theory 39(1): 31-40 (2019) - [j55]Yuxing Jia, Mei Lu, Yi Zhang:
Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles and Matchings. Graphs Comb. 35(5): 1011-1021 (2019) - [j54]Jia Guo, Desai Li, Mei Lu:
The g-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model. Theor. Comput. Sci. 755: 81-88 (2019) - [e1]Yijia Chen, Xiaotie Deng, Mei Lu:
Frontiers in Algorithmics - 13th International Workshop, FAW 2019, Sanya, China, April 29 - May 3, 2019, Proceedings. Lecture Notes in Computer Science 11458, Springer 2019, ISBN 978-3-030-18125-3 [contents] - 2018
- [j53]Yuxuan Yang, Mei Lu:
Matching of 5-γ-critical leafless graph with a cut edge. Appl. Math. Comput. 323: 58-63 (2018) - [j52]Jia Guo, Mei Lu:
Conditional diagnosability of the SPn graphs under the comparison diagnosis model. Appl. Math. Comput. 336: 249-256 (2018) - [j51]Yi Zhang, Yi Zhao, Mei Lu:
Vertex Degree Sums for Perfect Matchings in 3-Uniform Hypergraphs. Electron. J. Comb. 25(3): 3 (2018) - [j50]Kun Wang, Wenjie Ning, Mei Lu:
On the signless Laplacian Estrada index of bicyclic graphs. Discret. Appl. Math. 235: 169-174 (2018) - [j49]Jianfeng Wang, Mei Lu, Francesco Belardo, Milan Randic:
The anti-adjacency matrix of a graph: Eccentricity matrix. Discret. Appl. Math. 251: 299-309 (2018) - [j48]Yi Zhang, Mei Lu:
d-matching in 3-uniform hypergraphs. Discret. Math. 341(3): 748-758 (2018) - [j47]Yanhong Feng, Juan Yang, Congcong Wu, Mei Lu, Xiang-Jun Zhao:
Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation. Memetic Comput. 10(2): 135-150 (2018) - 2017
- [j46]Wenjie Ning, Mei Lu, Jia Guo:
Locating and differentiating-total dominating sets in unicyclic graphs. Ars Comb. 132: 241-255 (2017) - [j45]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) - [j44]Wei Meng, Jia Guo, Mei Lu, Yubao Guo, Lutz Volkmann:
Universal arcs in local tournaments. Discret. Math. 340(12): 2900-2915 (2017) - [j43]Yi Zhang, Mei Lu:
d-matching in k-uniform hypergraphs. Discret. Math. Algorithms Appl. 9(6): 1750072:1-1750072:8 (2017) - [j42]Yanhong Feng, Gai-Ge Wang, Suash Deb, Mei Lu, Xiang-Jun Zhao:
Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization. Neural Comput. Appl. 28(7): 1619-1634 (2017) - [j41]Jia Guo, Mei Lu:
Conditional diagnosability of the round matching composition networks. Theor. Comput. Sci. 657: 163-172 (2017) - [j40]Desai Li, Mei Lu:
The g-good-neighbor conditional diagnosability of star graphs under the PMC and MM* model. Theor. Comput. Sci. 674: 53-59 (2017) - 2016
- [j39]Wenjie Ning, Mei Lu, Jia Guo:
Bounds on the differentiating-total domination number of a tree. Discret. Appl. Math. 200: 153-160 (2016) - [j38]Jia Guo, Mei Lu:
Conditional diagnosability of bubble-sort star graphs. Discret. Appl. Math. 201: 141-149 (2016) - [j37]Hongwei Li, Wenjie Ning, Yubao Guo, Mei Lu:
On pancyclic arcs in hypertournaments. Discret. Appl. Math. 215: 164-170 (2016) - [j36]Zhe Han, Mei Lu:
Two coloring problems on matrix graphs. Discret. Math. Algorithms Appl. 8(3): 1650053:1-1650053:9 (2016) - [j35]Mei Lu, Xiang-Jun Zhao, Li Zhang, Fanzhang Li:
Semi-supervised concept factorization for document clustering. Inf. Sci. 331: 86-98 (2016) - [j34]Mei Lu, Li Zhang, Xiang-Jun Zhao, Fanzhang Li:
Constrained neighborhood preserving concept factorization for data representation. Knowl. Based Syst. 102: 127-139 (2016) - [j33]Gaige Wang, Mei Lu, Yong-Quan Dong, Xiang-Jun Zhao:
Self-adaptive extreme learning machine. Neural Comput. Appl. 27(2): 291-303 (2016) - [j32]Jia Guo, Mei Lu:
The extra connectivity of bubble-sort star graphs. Theor. Comput. Sci. 645: 91-99 (2016) - [c7]Gaige Wang, Mei Lu, Xiang-Jun Zhao:
An improved bat algorithm with variable neighborhood search for global optimization. CEC 2016: 1773-1778 - 2015
- [j31]Wei-Guo Chen, Zhi-Hong Chen, Mei Lu:
Lai's Conditions for Spanning and Dominating Closed Trails. Electron. J. Comb. 22(1): 1 (2015) - [j30]Hongyan Cai, Huiqing Liu, Mei Lu:
Fault-tolerant maximal local-connectivity on Bubble-sort star graphs. Discret. Appl. Math. 181: 33-40 (2015) - [j29]Xiwang Cao, Mei Lu, Daqing Wan, Li-Ping Wang, Qiang Wang:
Linearized Wenger graphs. Discret. Math. 338(9): 1595-1602 (2015) - 2014
- [j28]Fan Li, Mei Lu:
Maximum Randic Index on Unicyclic Graphs with k Pendant Vertices. Ars Comb. 116: 385-394 (2014) - [j27]Mei Lu, Daqing Wan, Li-Ping Wang, Xiao-Dong Zhang:
Algebraic Cayley graphs over finite fields. Finite Fields Their Appl. 28: 43-56 (2014) - [j26]Kan Yu, Mei Lu:
2-Distance paired-dominating number of graphs. J. Comb. Optim. 28(4): 827-836 (2014) - [c6]Mei Lu, Philip J. Corriveau, Luke Koons, Donna Boyer:
Information Technology Service Delivery to Small Businesses. HCI (18) 2014: 60-67 - 2013
- [j25]Fan Li, Mei Lu:
On the zeroth-order general Randic index of unicycle graphs with k pendant vertices. Ars Comb. 109: 229-237 (2013) - [j24]Mei Lu, Yubao Guo, Michel Surmacs:
Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs. Discret. Math. 313(23): 2667-2672 (2013) - [j23]Xiangjun Zhao, Mei Lu:
3D Object Retrieval Based on PSO-K-Modes Method. J. Softw. 8(4): 963-970 (2013) - 2012
- [j22]Huiqing Liu, Mei Lu:
A Unified Approach to the Extremal Trees without Perfect Matching for Different Indices. Ars Comb. 103: 505-518 (2012) - [j21]Liang Lin, Mei Lu:
On the zeroth-order general Randic index of cacti. Ars Comb. 106: 381-393 (2012) - [j20]Yubao Guo, Mei Lu, Michel Surmacs:
Weakly quasi-Hamiltonian-set-connected multipartite tournaments. Discret. Appl. Math. 160(10-11): 1561-1566 (2012) - [j19]Dongye Wang, Mei Lu:
Edge fault tolerance of super edge connectivity for three families of interconnection networks. Inf. Sci. 188: 260-268 (2012) - [j18]Tongliang Shi, Mei Lu:
Fault-tolerant diameter for three family interconnection networks. J. Comb. Optim. 23(4): 471-482 (2012) - 2011
- [c5]Mei Lu, Philip J. Corriveau:
From Personal to Collaborative Information Management: A Design Science's Approach. HCI (12) 2011: 36-45
2000 – 2009
- 2009
- [j17]Hao Li, Mei Lu:
Bi-cycle extendable through a given set in balanced bipartite graphs. Discret. Appl. Math. 157(5): 1009-1015 (2009) - [j16]Liming Xiong, Mei Lu, Longsheng Han:
The structure of even factors in claw-free graphs. Discret. Math. 309(8): 2417-2423 (2009) - [j15]Mei Lu, Huiqing Liu, Feng Tian:
An improved upper bound for the Laplacian spectral radius of graphs. Discret. Math. 309(21): 6318-6321 (2009) - 2007
- [j14]Huiqing Liu, Mei Lu, Feng Tian:
Relative Length of Longest Paths and Cycles in Graphs. Graphs Comb. 23(4): 433-443 (2007) - [j13]Mei Lu, Huiqing Liu, Feng Tian:
Laplacian spectral bounds for clique and independence numbers of graphs. J. Comb. Theory B 97(5): 726-732 (2007) - 2006
- [j12]Huiqing Liu, Mei Lu, Feng Tian:
Trees of extremal connectivity index. Discret. Appl. Math. 154(1): 106-119 (2006) - [j11]Quan Jiang, Zheng Gang Zhang, Guang Liang Ding, Brian Silver, Li Zhang, He Meng, Mei Lu, Siamak Pourabdillah-Nejed-D., Lei Wang, Smita Savant-Bhonsale, Lian Li, Hassan Bagher-Ebadian, Jiani Hu, Ali S. Arbab, Padmavathy Vanguri, James R. Ewing, Karyn Alayne Ledbetter, Michael Chopp:
MRI detects white matter reorganization after neural progenitor cell treatment of stroke. NeuroImage 32(3): 1080-1089 (2006) - 2005
- [j10]Jinwu Gao, Mei Lu:
Fuzzy quadratic minimum spanning tree problem. Appl. Math. Comput. 164(3): 773-788 (2005) - [j9]Mei Lu, Huiqing Liu, Feng Tian:
Fan-Type Theorem for Long Cycles Containing a Specified Edge. Graphs Comb. 21(4): 489-501 (2005) - [j8]Katherine M. Chudoba, Eleanor Wynn, Mei Lu, Mary Beth Watson-Manheim:
How virtual are we? Measuring virtuality and understanding its impact in a global organization. Inf. Syst. J. 15(4): 279-306 (2005) - [j7]Mei Lu, Huiqing Liu, Feng Tian:
Two sufficient conditions for dominating cycles. J. Graph Theory 49(2): 135-150 (2005) - [j6]Quan Jiang, Zheng Gang Zhang, Guang Liang Ding, Li Zhang, James R. Ewing, Lei Wang, RuiLan Zhang, Lian Li, Mei Lu, He Meng, Ali S. Arbab, Jiani Hu, Qing Jiang Li, Siamak Pourabdollah-Nejad D, Hemanthkumar Athiraman, Michael Chopp:
Investigation of neural progenitor cell induced angiogenesis after embolic stroke in rat using MRI. NeuroImage 28(3): 698-707 (2005) - [c4]Mei Lu, Charles H. House, Mary Beth Watson-Manheim, Tamar Matzkevich:
Does Distance Matter? - Bridging the Discontinuities in Distributed Organizations. HICSS 2005 - 2004
- [j5]Huiqing Liu, Mei Lu, FengFeng Tian:
Neighborhood unions and cyclability of graphs. Discret. Appl. Math. 140(1-3): 91-101 (2004) - [c3]Jinwu Gao, Mei Lu, Linzhong Liu:
Chance-constrained programming for fuzzy quadratic minimum spanning tree problem. FUZZ-IEEE 2004: 983-987 - 2002
- [j4]Guojun Li, Mei Lu, Zhenghong Liu:
Hamiltonian cycles in 3-connected Claw-free graphs. Discret. Math. 250(1-3): 137-151 (2002) - 2001
- [j3]Mei Lu, Zhengguang Yu:
Cycles of length 1 modulo 3 in graph. Discret. Appl. Math. 113(2-3): 329-336 (2001)
1990 – 1999
- 1999
- [c2]Mei Lu, Xinpei Zhao, Mingshu Li:
Object-Oriented Requirements Modeling Based on UML. TOOLS (31) 1999: 133- - 1998
- [j2]Hao Li, Mei Lu, Zhiren Sun:
Hamiltonicity in 2-connected graphs with claws. Discret. Math. 183(1-3): 223-236 (1998) - 1997
- [j1]Hao Li, Mei Lu, Feng Tian, Bing Wei:
Hamiltonicity of 2-connected claw-center independent graphs. Discret. Math. 165-166: 469-479 (1997) - 1995
- [c1]Michael J. Swain, Charles H. Frankel, Mei Lu:
View-Based Techniques for Searching for Objects and Textures. ACCV 1995: 551-560
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-11-07 21:30 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:
