default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWeidong Li 0002
Person information
- affiliation: Yunnan University, Department of Mathematics, Kunming, China
Other persons with the same name
- Weidong Li — disambiguation page
- Weidong Li 0001 — Coventry University, Faculty of Engineering and Computing, United Kingdom
- Weidong Li 0003
![[0000-0002-4558-3292]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-4558-3292")
— University of Connecticut, Department of Geography, Storrs, CT, USA (and 1 more) - Weidong Li 0004 — Old Dominion University, Norfolk, VA, USA
- Weidong Li 0005 — Beijing Jiaotong University, School of Economy and Management, China
- Weidong Li 0006 — Beijing Institute of Technology, School of Information and Electronics, Radar Research Lab, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j66]Man Xiao, Xiaoqiao Liu, Weidong Li, Xin Chen, Malgorzata Sterna, Jacek Blazewicz:
Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work. Int. J. Appl. Math. Comput. Sci. 34(2) (2024)- [j65]Ning Xie, Jixian Zhang, Xuejie Zhang, Weidong Li:
Double auction mechanisms in edge computing resource allocation for blockchain networks. Clust. Comput. 27(3): 3017-3035 (2024) - [j64]Minzhi Xu, Weidong Li, Xuejie Zhang, Qian Su:
A discrete dwarf mongoose optimization algorithm to solve task assignment problems on smart farms. Clust. Comput. 27(5): 6185-6204 (2024) - [j63]Xi Liu, Jun Liu, Weidong Li:
Truthful mechanism for joint resource allocation and task offloading in mobile edge computing. Comput. Networks 254: 110796 (2024) - [j62]Xi Liu, Jun Liu, Weidong Li:
A truthful double auction mechanism for resource provisioning and elastic service in vehicle computing. Comput. Networks 254: 110806 (2024) - [j61]Yaru Yang, Man Xiao, Weidong Li:
Semi-Online Algorithms for the Hierarchical Extensible Bin-Packing Problem and Early Work Problem. Comput. 12(4): 68 (2024) - [j60]Weidong Li, Jinwen Ou:
Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing. Eur. J. Oper. Res. 314(3): 882-893 (2024) - [j59]Weidong Li, Jinwen Ou:
Machine scheduling with restricted rejection: An Application to task offloading in cloud-edge collaborative computing. Eur. J. Oper. Res. 314(3): 912-919 (2024) - [j58]Jixian Zhang, Hao Sun, Zhemin Wang, Qian Su, Weidong Li:
A Novel Clinching Auction Mechanism for Edge Computing Resource Allocation With Budget Limits. Trans. Emerg. Telecommun. Technol. 35(11) (2024) - [j57]Xingxing Li, Guangqin Hu, Weidong Li, Xuejie Zhang:
Fair multiresource allocation with access constraint in cloud-edge systems. Future Gener. Comput. Syst. 159: 395-410 (2024) - [j56]Jixian Zhang, Xiyi Liao, Hao Wu, Weidong Li:
A two-stage budget-feasible mechanism for mobile crowdsensing based on maximum user revenue routing. Future Gener. Comput. Syst. 161: 201-213 (2024) - [j55]Hao Guo, Weidong Li:
Dynamic Multi-Resource Fair Allocation with Elastic Demands. J. Grid Comput. 22(1): 35 (2024) - [j54]Jixian Zhang, Zhemin Wang, Athanasios V. Vasilakos, Weidong Li:
A resource competition-based truthful mechanism for IoV edge computing resource allocation with a lowest revenue limit. J. Cloud Comput. 13(1): 11 (2024) - [j53]Xiaofei Liu, Weidong Li:
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties. Math. Struct. Comput. Sci. 34(3): 193-210 (2024) - [j52]Jixian Zhang, Hao Sun, Weidong Li:
Lowest revenue limit-based truthful auction mechanism for cloud resource allocation. J. Supercomput. 80(8): 10637-10666 (2024) - [j51]Jixian Zhang, Yi Zhang, Hao Wu, Weidong Li:
An Ordered Submodularity-Based Budget-Feasible Mechanism for Opportunistic Mobile Crowdsensing Task Allocation and Pricing. IEEE Trans. Mob. Comput. 23(2): 1278-1294 (2024) - [j50]Qian Su, Qinghui Zhang, Weidong Li, Xuejie Zhang:
Primal-Dual-Based Computation Offloading Method for Energy-Aware Cloud-Edge Collaboration. IEEE Trans. Mob. Comput. 23(2): 1534-1549 (2024) - [j49]Jixian Zhang, Zhemin Wang, Hao Wu, Weidong Li:
Ordered Submodularity-Based Value Maximization of UAV Data Collection in Earthquake Areas. IEEE Trans. Netw. Sci. Eng. 11(5): 4886-4897 (2024) - [j48]Jixian Zhang, Mingyi Zong, Athanasios V. Vasilakos, Weidong Li:
UAV Base Station Network Transmission-Based Reverse Auction Mechanism for Digital Twin Utility Maximization. IEEE Trans. Netw. Serv. Manag. 21(1): 324-340 (2024) - 2023
- [j47]Weidong Li:
Bag-of-Tasks Scheduling with Rejection in Large Computing Systems. Asia Pac. J. Oper. Res. 40(4): 2340011:1-2340011:13 (2023) - [j46]Xingxing Li, Weidong Li, Xuejie Zhang:
Multi-resource fair allocation with bandwidth requirement compression in the cloud-edge system. Comput. Electr. Eng. 105: 108510 (2023) - [j45]Xingxing Li, Weidong Li, Xuejie Zhang:
Extended efficiency and soft-fairness multiresource allocation in a cloud computing system. Computing 105(6): 1217-1245 (2023) - [j44]Xiaofei Liu, Weidong Li, Jinhua Yang:
A primal-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties. Frontiers Comput. Sci. 17(3): 173404 (2023) - [j43]Xiaofei Liu, Yajie Li, Weidong Li, Jinhua Yang:
Combinatorial approximation algorithms for the maximum bounded connected bipartition problem. J. Comb. Optim. 45(1): 51 (2023) - [j42]Xiaofei Liu, Man Xiao, Weidong Li, Yaoyu Zhu, Lei Ma:
Algorithms for single machine scheduling problem with release dates and submodular penalties. J. Comb. Optim. 45(4): 105 (2023) - [j41]Man Xiao, Shu Zhao, Weidong Li, Jinhua Yang:
Online bottleneck matching on a line. J. Comb. Optim. 45(4): 108 (2023) - [j40]Man Xiao, Xiaoqiao Liu, Weidong Li:
Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time. J. Comb. Optim. 46(3): 21 (2023) - [j39]Man Xiao, Weidong Li, Xiaofei Liu:
Online Mixed Ring Covering Problem with Two Nodes. Oper. Res. Forum 4(1): 1-20 (2023) - [j38]Xingxing Li, Weidong Li, Xuejie Zhang:
Multiresource fair allocation with time window constraints. J. Supercomput. 79(14): 15927-15954 (2023) - 2022
- [j37]Ran Ding, Bin Deng, Weidong Li:
Meta-Heuristic Algorithms for the Generalized Extensible Bin Packing Problem With Overload Cost. IEEE Access 10: 124858-124873 (2022) - [j36]Xuejie Zhang, Jie Li, Guibing Li, Weidong Li:
Generalized asset fairness mechanism for multi-resource fair allocation mechanism with two different types of resources. Clust. Comput. 25(5): 3389-3403 (2022) - [j35]Man Xiao, Yaru Yang, Weidong Li:
Online Bottleneck Matching Problem with Two Heterogeneous Sensors in a Metric Space. Comput. 10(12): 217 (2022) - [j34]Jixian Zhang, Laixin Chi, Ning Xie, Xutao Yang, Xuejie Zhang, Weidong Li:
Strategy-proof mechanism for online resource allocation in cloud and edge collaboration. Computing 104(2): 383-412 (2022) - [j33]Jixian Zhang, Wenlu Lou, Hao Sun, Qian Su, Weidong Li:
Truthful auction mechanisms for resource allocation in the Internet of Vehicles with public blockchain networks. Future Gener. Comput. Syst. 132: 11-24 (2022) - [j32]Han Dai, Bin Deng, Weidong Li, Xiaofei Liu:
A note on the minimum power partial cover problem on the plane. J. Comb. Optim. 44(2): 970-978 (2022) - [j31]Xiaofei Liu, Weidong Li:
Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties. J. Comb. Optim. 44(3): 1964-1976 (2022) - [j30]Xiaofei Liu, Weidong Li, Runtao Xie:
A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem. Optim. Lett. 16(8): 2373-2385 (2022) - [j29]Qinghui Zhang, Weidong Li, Qian Su, Xuejie Zhang:
A Primal-Dual-Based Power Control Approach for Capacitated Edge Servers. Sensors 22(19): 7582 (2022) - [j28]Xiaofei Liu, Weidong Li, Han Dai:
Approximation algorithms for the minimum power cover problem with submodular/linear penalties. Theor. Comput. Sci. 923: 256-270 (2022) - [c34]Man Xiao, Xihua Bai, Weidong Li:
Online Early Work Maximization Problem on Two Hierarchical Machines with Buffer or Rearrangements. AAIM 2022: 46-54 - [c33]Xiaofei Liu, Yaoyu Zhu, Weidong Li, Lei Ma:
On-line Single Machine Scheduling with Release Dates and Submodular Rejection Penalties. AAIM 2022: 55-65 - [c32]Man Xiao, Weidong Li:
Online Semi-matching Problem with Two Heterogeneous Sensors in a Metric Space. COCOON 2022: 444-451 - [c31]Han Dai, Weidong Li, Xiaofei Liu:
An Approximation Algorithm for the H-Prize-Collecting Power Cover Problem. FAW 2022: 89-98 - [c30]Man Xiao, Weidong Li:
Online Early Work Maximization on Three Hierarchical Machines with a Common Due Date. FAW 2022: 99-109 - [c29]Qinghui Zhang, Weidong Li, Qian Su, Xuejie Zhang:
A Local-Ratio-Based Power Control Approach for Capacitated Access Points in Mobile Edge Computing. HP3C 2022: 175-182 - [c28]Man Xiao, Weidong Li:
A Modified List Scheduling Algorithm for the Online Hierarchical Load Balancing Problem with Bounded Processing Times. NCTCS 2022: 209-215 - [c27]Xingxing Li, Weidong Li, Xuejie Zhang:
Multi-resource Allocation in Mobile Edge Computing Systems: A Trade-Off on Fairness and Efficiency. NCTCS 2022: 248-262 - [c26]Bin Deng, Weidong Li:
Maximin Share Based Mechanisms for Multi-resource Fair Allocation with Divisible and Indivisible Tasks. NCTCS 2022: 263-272 - [c25]Xiaofei Liu, Weidong Li:
An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees. TAMC 2022: 262-271 - [i6]Qinghui Zhang, Weidong Li, Qian Su, Xuejie Zhang:
A Local-Ratio-Based Power Control Approach for Capacitated Access Points in Mobile Edge Computing. CoRR abs/2208.00372 (2022) - [i5]Qinghui Zhang, Weidong Li, Xuejie Zhang:
A Primal-Dual Based Power Control Approach for Capacitated Edge Servers. CoRR abs/2208.02431 (2022) - [i4]Man Xiao, Xiaoqiao Liu, Weidong Li, Xin Chen, Malgorzata Sterna, Jacek Blazewicz:
Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work. CoRR abs/2209.08704 (2022) - 2021
- [j27]Jixian Zhang, Ning Xie, Xutao Yang, Xuejie Zhang, Weidong Li:
Strategy-proof mechanism for time-varying batch virtual machine allocation in clouds. Clust. Comput. 24(4): 3709-3724 (2021) - [j26]Jixian Zhang, Ning Xie, Xuejie Zhang, Weidong Li:
Strategy-Proof Mechanism for Online Time-Varying Resource Allocation with Restart. J. Grid Comput. 19(3): 25 (2021) - [j25]Li Guan, Weidong Li, Man Xiao:
Online algorithms for the mixed ring loading problem with two nodes. Optim. Lett. 15(4): 1229-1239 (2021) - [j24]Xiaofei Liu, Weidong Li:
Approximation algorithms for the multiprocessor scheduling with submodular penalties. Optim. Lett. 15(6): 2165-2180 (2021) - [c24]Yajie Li, Weidong Li, Xiaofei Liu, Jinhua Yang:
Approximation Algorithms for the Maximum Bounded Connected Bipartition Problem. AAIM 2021: 27-37 - [c23]Man Xiao, Xiaoqiao Liu, Weidong Li:
Semi-online Early Work Maximization Problem on Two Hierarchical Machines with Partial Information of Processing Time. AAIM 2021: 146-156 - [c22]Man Xiao, Shu Zhao, Weidong Li, Jinhua Yang:
Online Bottleneck Semi-matching. COCOA 2021: 445-455 - 2020
- [j23]Jixian Zhang, Xutao Yang, Ning Xie, Xuejie Zhang, Athanasios V. Vasilakos, Weidong Li:
An online auction mechanism for time-varying multidimensional resource allocation in clouds. Future Gener. Comput. Syst. 111: 27-38 (2020) - [j22]Bingfei Dai, Weidong Li:
Vector scheduling with rejection on two machines. Int. J. Comput. Math. 97(12): 2507-2515 (2020) - [c21]Xutao Yang, Xuejie Zhang, Weidong Li, Jixian Zhang:
A Truthful Auction Mechanism for Cumulative Resource Allocation in Mobile Edge Computing. HP3C 2020: 63-69 - [c20]Man Xiao, Lu Ding, Shu Zhao, Weidong Li:
Semi-online Algorithms for Hierarchical Scheduling on Three Parallel Machines with a Buffer Size of 1. NCTCS 2020: 47-56 - [i3]Weidong Li:
Improved approximation schemes for early work scheduling on identical parallel machines with common due date. CoRR abs/2007.12388 (2020)
2010 – 2019
- 2019
- [j21]Li Guan, Jianping Li, Weidong Li, Junran Lichen:
Improved approximation algorithms for the combination problem of parallel machine scheduling and path. J. Comb. Optim. 38(3): 689-697 (2019) - [j20]Weidong Li, Xi Liu, Xiaobo Cai, Xuejie Zhang:
Approximation algorithm for the energy-aware profit maximizing problem in heterogeneous computing systems. J. Parallel Distributed Comput. 124: 70-77 (2019) - [c19]Xiaofei Liu, Weidong Li:
A Primal Dual Approximation Algorithm for the Multicut Problem in Trees with Submodular Penalties. AAIM 2019: 203-211 - [c18]Xiaolu Zhang, Xi Liu, Weidong Li, Xuejie Zhang:
Trade-off Between Energy Consumption and Makespan in the Mapreduce Resource Allocation Problem. ICAIS (2) 2019: 239-250 - [c17]Man Xiao, Gangxiong Wu, Weidong Li:
Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs. NCTCS 2019: 95-108 - 2018
- [j19]Weidong Li, Qianna Cui:
Vector scheduling with rejection on a single machine. 4OR 16(1): 95-104 (2018) - [j18]Jixian Zhang, Ning Xie, Xuejie Zhang, Weidong Li:
An online auction mechanism for cloud computing resource allocation and pricing based on user evaluation and cost. Future Gener. Comput. Syst. 89: 286-299 (2018) - [j17]Xi Liu, Weidong Li, Xuejie Zhang:
Strategy-Proof Mechanism for Provisioning and Allocation Virtual Machines in Heterogeneous Clouds. IEEE Trans. Parallel Distributed Syst. 29(7): 1650-1663 (2018) - [c16]Bingfei Dai, Jianping Li, Weidong Li:
Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines. CSAI/ICIMT 2018: 609-614 - [c15]Jixian Zhang, Ning Xie, Xuejie Zhang, Weidong Li:
Multi-choice Virtual Machine Allocation with Time Windows in Cloud Computing. GPC 2018: 182-195 - [c14]Gangxiong Wu, Weidong Li:
Semi-online Machine Covering on Two Hierarchical Machines with Discrete Processing Times. NCTCS 2018: 1-7 - 2017
- [j16]Weidong Li, Lusheng Wang, Wenjuan Cui:
A Polynomial Time Approximation Scheme for the Closest Shared Center Problem. Algorithmica 77(1): 65-83 (2017) - [j15]Xi Liu, Xiaolu Zhang, Weidong Li, Xuejie Zhang:
Swarm optimization algorithms applied to multi-resource fair allocation in heterogeneous cloud computing systems. Computing 99(12): 1231-1255 (2017) - [c13]Xi Liu, Xiaolu Zhang, Qianna Cui, Weidong Li:
Implementation of Ant Colony Optimization Combined with Tabu Search for Multi-resource Fair Allocation in Heterogeneous Cloud Computing. BigDataSecurity/HPSC/IDS 2017: 196-201 - [c12]Jianping Li, Xiaofei Liu, Weidong Li, Li Guan, Junran Lichen:
Approximation Algorithms for the Generalized Stacker Crane Problem. COCOA (1) 2017: 95-102 - [c11]Weidong Li, Xi Liu, Xiaolu Zhang, Xuejie Zhang:
A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism. FAW 2017: 163-174 - [c10]Xiaolu Zhang, Weidong Li, Xi Liu, Xuejie Zhang:
A Profit-Maximum Resource Allocation Approach for Mapreduce in Data Centers. GPC 2017: 460-474 - [c9]Weidong Li, Xi Liu, Xiaolu Zhang, Xuejie Zhang:
Multi-resource Fair Allocation with Bounded Number of Tasks in Cloud Computing Systems. NCTCS 2017: 3-17 - 2016
- [j14]Jianping Li, Li Guan, Honglin Ding, Weidong Li:
Approximations for constructing tree-form structures using specific material with fixed length. Optim. Lett. 10(6): 1337-1345 (2016) - [j13]Weidong Li, Jianping Li, Li Guan, Yaomin Shi:
The Prize-collecting Call Control Problem on Weighted Lines and Rings. RAIRO Oper. Res. 50(1): 39-46 (2016) - [c8]Xi Liu, Xiaolu Zhang, Weidong Li, Xuejie Zhang:
Discrete Interior Search Algorithm for Multi-resource Fair Allocation in Heterogeneous Cloud Computing Systems. ICIC (1) 2016: 615-626 - 2015
- [j12]Weidong Li, Xi Liu, Xiaolu Zhang, Xuejie Zhang:
Dynamic fair allocation of multiple resources with bounded number of tasks in cloud computing systems. Multiagent Grid Syst. 11(4): 245-257 (2015) - [j11]Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen:
Penalty cost constrained identical parallel machine scheduling problem. Theor. Comput. Sci. 607: 181-192 (2015) - [c7]Xi Liu, Xiaolu Zhang, Xuejie Zhang, Weidong Li:
Dynamic Fair Division of Multiple Resources with Satiable Agents in Cloud Computing Systems. BDCloud 2015: 131-136 - [c6]Weidong Li, Xi Liu, Xuejie Zhang, Xiaobo Cai:
A Task-Type-Based Algorithm for the Energy-Aware Profit Maximizing Scheduling Problem in Heterogeneous Computing Systems. CCGRID 2015: 1107-1110 - [c5]Li Guan, Jianping Li, Xuejie Zhang, Weidong Li:
The Directed Ring Loading with Penalty Cost. WALCOM 2015: 20-31 - [i2]Weidong Li, Xi Liu, Xuejie Zhang, Xiaobo Cai:
A Task-Type-Based Algorithm for the Energy-Aware Profit Maximizing Scheduling Problem in Heterogeneous Computing Systems. CoRR abs/1501.05414 (2015) - [i1]Weidong Li, Xi Liu, Xiaolu Zhang, Xuejie Zhang:
A note on dynamic fair division of multiple resources. CoRR abs/1509.07935 (2015) - 2014
- [j10]Weidong Li, Jianping Li, Li Guan:
Approximation algorithms for the ring loading problem with penalty cost. Inf. Process. Lett. 114(1-2): 56-59 (2014) - [j9]Jianping Li, Weidong Li, Junran Lichen:
The subdivision-constrained routing requests problem. J. Comb. Optim. 27(1): 152-163 (2014) - [j8]Weidong Li, Jianping Li:
Approximation algorithms for $k$ -partitioning problems with partition matroid constraint. Optim. Lett. 8(3): 1093-1099 (2014) - [c4]Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen:
Parallel-Machine Scheduling Problem under the Job Rejection Constraint - (Extended Abstract). FAW 2014: 158-169 - 2013
- [c3]Weidong Li, Lusheng Wang, Wenjuan Cui:
A Polynomial Time Approximation Scheme for the Closest Shared Center Problem. COCOON 2013: 385-396 - 2012
- [j7]Weidong Li, Jianping Li, Tongquan Zhang:
Two Approximation Schemes for Scheduling on Parallel Machines under a grade of Service Provision. Asia Pac. J. Oper. Res. 29(5) (2012) - [j6]Jianping Li, Weidong Li, Lusheng Wang:
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring. J. Comb. Optim. 24(3): 319-328 (2012) - [j5]Weidong Li, Yaomin Shi:
On the maximum TSP with γ-parameterized triangle inequality. Optim. Lett. 6(3): 415-420 (2012)
2000 – 2009
- 2009
- [j4]Jianping Li, Weidong Li, Jianbo Li:
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a grade of Service Provision. Discret. Math. Algorithms Appl. 1(3): 355-368 (2009) - [j3]Tongquan Zhang, Weidong Li, Jianping Li:
An improved approximation algorithm for the ATSP with parameterized triangle inequality. J. Algorithms 64(2-3): 74-78 (2009) - [j2]Jianping Li, Weidong Li, Tongquan Zhang, Zhongxu Zhang:
The subdivision-constrained minimum spanning tree problem. Theor. Comput. Sci. 410(8-10): 877-885 (2009) - [c2]Jianping Li, Weidong Li, Jianbo Li:
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision. COCOA 2009: 1-13 - 2007
- [j1]Mingxia Chen, Jianbo Li, Jianping Li, Weidong Li, Lusheng Wang:
Some approximation algorithms for the clique partition problem in weighted interval graphs. Theor. Comput. Sci. 381(1-3): 124-133 (2007) - 2006
- [c1]Jianbo Li, Mingxia Chen, Jianping Li, Weidong Li:
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs. COCOON 2006: 459-468
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-12-23 19:35 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:
