


Остановите войну!
for scientists:


default search action
Jiaoyang Li 0001
Person information

- affiliation: Carnegie Mellon University, PA, USA
- affiliation (former): University of Southern California, CA, USA
Other persons with the same name
- Jiaoyang Li 0002 — Fudan University, School of Management, Shanghai, China
- Jiaoyang Li 0003
— Michigan State University, Department of Electrical and Computer Engineering, East Lansing, MI, USA (and 1 more)
- Jiaoyang Li 0004 — Shandong University of Traditional Chinese Medicine, Jinan, China
- Jiaoyang Li 0005 — Southwestern University of Finance and Economics, School of Business Administration, Chengdu, China
- Jiaoyang Li 0006 — Chinese Academy of Sciences, Institute of Information Engineering, Beijing, China
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]Dor Atzmon, Ariel Felner, Jiaoyang Li
, Shahaf S. Shperberg
, Nathan R. Sturtevant
, Sven Koenig
:
Conflict-tolerant and conflict-free multi-agent meeting. Artif. Intell. 322: 103950 (2023) - [c61]Jiaoyang Li, The Anh Hoang, Eugene Lin, Hai L. Vu, Sven Koenig:
Intersection Coordination with Priority-Based Search for Autonomous Vehicles. AAAI 2023: 11578-11585 - [c60]Jiaoyang Li:
Intelligent Planning for Large-Scale Multi-Robot Coordination. AAAI 2023: 15445 - [c59]Cheng Ge, Han Zhang, Jiaoyang Li, Sven Koenig:
Cost Splitting for Multi-Objective Conflict-Based Search. ICAPS 2023: 128-137 - [c58]Taoan Huang, Vikas Shivashankar, Michael Caldara, Joseph W. Durham, Jiaoyang Li, Bistra Dilkina, Sven Koenig:
Deadline-Aware Multi-Agent Tour Planning. ICAPS 2023: 189-197 - [c57]Edward Lam, Daniel Damir Harabor, Peter J. Stuckey, Jiaoyang Li:
Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search. ICAPS 2023: 254-258 - [c56]Zhongqiang Ren, Jiaoyang Li, Han Zhang, Sven Koenig, Sivakumar Rathinam, Howie Choset:
Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding. ICAPS 2023: 361-369 - [c55]Bojie Shen, Zhe Che 0016n, Jiaoyang Li, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Beyond Pairwise Reasoning in Multi-Agent Path Finding. ICAPS 2023: 384-392 - [c54]Yulun Zhang, Matthew C. Fontaine, Varun Bhatt, Stefanos Nikolaidis, Jiaoyang Li:
Multi-Robot Coordination and Layout Design for Automated Warehousing. IJCAI 2023: 5503-5511 - [c53]Adittyo Paul, Ying Feng, Jiaoyang Li:
A Fast Rescheduling Algorithm for Real-Time Multi-Robot Coordination [Extended Abstract]. SOCS 2023: 175-176 - [i22]Yulun Zhang, Matthew C. Fontaine, Varun Bhatt, Stefanos Nikolaidis, Jiaoyang Li:
Multi-Robot Coordination and Layout Design for Automated Warehousing. CoRR abs/2305.06436 (2023) - [i21]Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey:
Scalable Rail Planning and Replanning with Soft Deadlines. CoRR abs/2306.06455 (2023) - [i20]Yimin Tang, Zhongqiang Ren, Jiaoyang Li, Katia P. Sycara:
Solving Multi-Agent Target Assignment and Path Finding with a Single Constraint Tree. CoRR abs/2307.00663 (2023) - [i19]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. CoRR abs/2308.11234 (2023) - 2022
- [j2]Han Zhang
, Jiaoyang Li
, Pavel Surynek
, T. K. Satish Kumar, Sven Koenig
:
Multi-agent path finding with mutex propagation. Artif. Intell. 311: 103766 (2022) - [c52]Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. AAAI 2022: 9313-9322 - [c51]Taoan Huang, Jiaoyang Li, Sven Koenig, Bistra Dilkina:
Anytime Multi-Agent Path Finding via Machine Learning-Guided Large Neighborhood Search. AAAI 2022: 9368-9376 - [c50]Christopher Leet, Jiaoyang Li, Sven Koenig:
Shard Systems: Scalable, Robust and Persistent Multi-Agent Path Finding with Performance Guarantees. AAAI 2022: 9386-9395 - [c49]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search. AAAI 2022: 10256-10265 - [c48]Han Zhang, Jingkai Chen, Jiaoyang Li, Brian C. Williams, Sven Koenig:
Multi-Agent Path Finding for Precedence-Constrained Goal Sequences. AAMAS 2022: 1464-1472 - [c47]Hejia Zhang, Shao-Hung Chan, Jie Zhong, Jiaoyang Li, Sven Koenig, Stefanos Nikolaidis:
A MIP-Based Approach for Multi-Robot Geometric Task-and-Motion Planning. CASE 2022: 2102-2109 - [c46]Xinyi Zhong, Jiaoyang Li, Sven Koenig, Hang Ma:
Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding. ICRA 2022: 10731-10737 - [c45]Qinghong Xu, Jiaoyang Li, Sven Koenig, Hang Ma:
Multi-Goal Multi-Agent Pickup and Delivery. IROS 2022: 9964-9971 - [c44]Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Multi-Train Path Finding Revisited. SOCS 2022: 38-46 - [c43]Sumanth Varambally, Jiaoyang Li, Sven Koenig:
Which MAPF Model Works Best for Automated Warehousing? SOCS 2022: 190-198 - [c42]Shuyang Zhang, Jiaoyang Li, Taoan Huang, Sven Koenig, Bistra Dilkina:
Learning a Priority Ordering for Prioritized Planning in Multi-Agent Path Finding. SOCS 2022: 208-216 - [c41]Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Mutex Propagation in Multi-Agent Path Finding for Large Agents. SOCS 2022: 249-253 - [i18]Jingkai Chen, Jiaoyang Li, Yijiang Huang, Caelan Reed Garrett, Dawei Sun, Chuchu Fan, Andreas G. Hofmann, Caitlin Mueller, Sven Koenig, Brian C. Williams:
Cooperative Task and Motion Planning for Multi-Arm Assembly Systems. CoRR abs/2203.02475 (2022) - [i17]Xinyi Zhong, Jiaoyang Li, Sven Koenig, Hang Ma:
Optimal and Bounded-Suboptimal Multi-Goal Task Assignment and Path Finding. CoRR abs/2208.01222 (2022) - [i16]Qinghong Xu, Jiaoyang Li, Sven Koenig, Hang Ma:
Multi-Goal Multi-Agent Pickup and Delivery. CoRR abs/2208.01223 (2022) - [i15]Hejia Zhang, Shao-Hung Chan, Jie Zhong, Jiaoyang Li, Sven Koenig, Stefanos Nikolaidis:
A MIP-Based Approach for Multi-Robot Geometric Task-and-Motion Planning. CoRR abs/2210.08005 (2022) - [i14]Cheng Ge, Han Zhang, Jiaoyang Li, Sven Koenig:
Cost Splitting for Multi-Objective Conflict-Based Search. CoRR abs/2211.12885 (2022) - 2021
- [j1]Jiaoyang Li
, Daniel Harabor
, Peter J. Stuckey, Hang Ma
, Graeme Gange, Sven Koenig
:
Pairwise symmetry reasoning for multi-agent path finding search. Artif. Intell. 301: 103574 (2021) - [c40]Jingkai Chen, Jiaoyang Li, Chuchu Fan, Brian C. Williams:
Scalable and Safe Multi-Agent Motion Planning with Nonlinear Dynamics and Bounded Disturbances. AAAI 2021: 11237-11245 - [c39]Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. AAAI 2021: 11272-11281 - [c38]Zhe Chen, Daniel Damir Harabor, Jiaoyang Li, Peter J. Stuckey:
Symmetry Breaking for k-Robust Multi-Agent Path Finding. AAAI 2021: 12267-12274 - [c37]Jiaoyang Li, Wheeler Ruml, Sven Koenig:
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. AAAI 2021: 12353-12362 - [c36]Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K. Satish Kumar:
Conflict-Based Increasing Cost Search. ICAPS 2021: 385-395 - [c35]Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. ICAPS 2021: 477-485 - [c34]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. AAMAS 2021: 1581-1583 - [c33]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. IJCAI 2021: 4127-4135 - [c32]Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
ECBS with Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding. SOCS 2021: 159-161 - [c31]Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. SOCS 2021: 179-181 - [c30]Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig:
A Hierarchical Approach to Multi-Agent Path Finding. SOCS 2021: 209-211 - [i13]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Symmetry Breaking for k-Robust Multi-Agent Path Finding. CoRR abs/2102.08689 (2021) - [i12]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search. CoRR abs/2103.07116 (2021) - [i11]Naveed Haghani, Jiaoyang Li, Sven Koenig, Gautam Kunapuli, Claudio Contardo, Amelia Regan, Julian Yarkony:
Multi-Robot Routing with Time Windows: A Column Generation Approach. CoRR abs/2103.08835 (2021) - [i10]Florian Laurent, Manuel Schneider, Christian Scheller, Jeremy D. Watson, Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Konstantin Makhnev, Oleg Svidchenko, Vladimir Egorov, Dmitry Ivanov, Aleksei Shpilman, Evgenija Spirovska, Oliver Tanevski, Aleksandar Nikov, Ramon Grunder, David Galevski, Jakov Mitrovski, Guillaume Sartoretti, Zhiyao Luo, Mehul Damani, Nilabha Bhattacharya, Shivam Agarwal, Adrian Egli, Erik Nygren, Sharada P. Mohanty:
Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World. CoRR abs/2103.16511 (2021) - 2020
- [c29]Todd W. Neller, Stephen Keeley, Michael Guerzhoy, Wolfgang Hönig, Jiaoyang Li, Sven Koenig, Ameet Soni, Krista Thomason, Lisa Zhang, Bibin Sebastian, Cinjon Resnick, Avital Oliver, Surya Bhupatiraju, Kumar Krishna Agrawal, James Allingham, Sejong Yoon, Jonathan Chen, Tom Larsen, Marion Neumann, Narges Norouzi, Ryan Hausen, Matthew Evett:
Model AI Assignments 2020. AAAI 2020: 13509-13511 - [c28]Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. ICAPS 2020: 193-201 - [c27]Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar:
Multi-Agent Path Finding with Mutex Propagation. ICAPS 2020: 323-332 - [c26]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. AAMAS 2020: 726-734 - [c25]Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. AAMAS 2020: 1898-1900 - [c24]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Heuristic Search. IJCAI 2020: 4062-4068 - [c23]Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen, Jiaoyang Li, Sven Koenig:
Iterative-Deepening Conflict-Based Search. IJCAI 2020: 4084-4090 - [c22]Florian Laurent, Manuel Schneider, Christian Scheller, Jeremy D. Watson, Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Konstantin Makhnev, Oleg Svidchenko, Vladimir Egorov, Dmitry Ivanov, Aleksei Shpilman, Evgenija Spirovska, Oliver Tanevski, Aleksandar Nikov, Ramon Grunder, David Galevski, Jakov Mitrovski, Guillaume Sartoretti, Zhiyao Luo, Mehul Damani, Nilabha Bhattacharya, Shivam Agarwal, Adrian Egli, Erik Nygren, Sharada P. Mohanty:
Flatland Competition 2020: MAPF and MARL for Efficient Train Coordination on a Grid World. NeurIPS (Competition and Demos) 2020: 275-301 - [c21]Pavel Surynek
, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig:
Mutex Propagation for SAT-based Multi-agent Path Finding. PRIMA 2020: 248-258 - [c20]Dor Atzmon, Jiaoyang Li, Ariel Felner, Eliran Nachmani, Shahaf S. Shperberg, Nathan R. Sturtevant, Sven Koenig:
Multi-Directional Search. SOCS 2020: 121-122 - [c19]Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding. SOCS 2020: 129-130 - [c18]Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Moving Agents in Formation in Congested Environments. SOCS 2020: 131-132 - [i9]Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. CoRR abs/2005.07371 (2020) - [i8]Naveed Haghani, Jiaoyang Li, Sven Koenig, Gautam Kunapuli, Claudio Contardo, Julian Yarkony:
Integer Programming for Multi-Robot Planning: A Column Generation Approach. CoRR abs/2006.04856 (2020) - [i7]Jiaoyang Li, Wheeler Ruml, Sven Koenig:
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding. CoRR abs/2010.01367 (2020) - [i6]Jingkai Chen, Jiaoyang Li, Chuchu Fan, Brian Charles Williams:
Scalable and Safe Multi-Agent Motion Planning with Nonlinear Dynamics and Bounded Disturbances. CoRR abs/2012.09052 (2020)
2010 – 2019
- 2019
- [c17]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. AAAI 2019: 6087-6095 - [c16]Jiaoyang Li, Pavel Surynek
, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. AAAI 2019: 7627-7634 - [c15]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Searching with Consistent Prioritization for Multi-Agent Path Finding. AAAI 2019: 7643-7650 - [c14]Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar:
Using FastMap to Solve Graph Problems in a Euclidean Space. ICAPS 2019: 273-278 - [c13]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search. ICAPS 2019: 279-283 - [c12]Minghua Liu, Hang Ma, Jiaoyang Li, Sven Koenig:
Task and Path Planning for Multi-Agent Pickup and Delivery. AAMAS 2019: 1152-1160 - [c11]Jiangxing Wang, Jiaoyang Li, Hang Ma, Sven Koenig, T. K. Satish Kumar:
A New Constraint Satisfaction Perspective on Multi-Agent Path Finding: Preliminary Results. AAMAS 2019: 2253-2255 - [c10]Jiaoyang Li, Ariel Felner, Eli Boyarski, Hang Ma, Sven Koenig:
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search. IJCAI 2019: 442-449 - [c9]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS 2019: 151-159 - [c8]Jiaoyang Li, Eli Boyarski, Ariel Felner, Hang Ma, Sven Koenig:
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results. SOCS 2019: 182-183 - [c7]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding. SOCS 2019: 184-185 - [c6]Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding for Large Agents. SOCS 2019: 186-187 - [c5]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Extended Abstract: Searching with Consistent Prioritization for Multi-Agent Path Finding. SOCS 2019: 188-189 - [i5]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Barták:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. CoRR abs/1906.08291 (2019) - 2018
- [c4]Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. ICAPS 2018: 83-87 - [c3]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. AAMAS 2018: 2004-2006 - [c2]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. IJCAI 2018: 417-423 - [i4]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines: Preliminary Results. CoRR abs/1805.04961 (2018) - [i3]Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Multi-Agent Path Finding with Deadlines. CoRR abs/1806.04216 (2018) - [i2]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Searching with Consistent Prioritization for Multi-Agent Path Finding. CoRR abs/1812.06356 (2018) - 2017
- [c1]Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. AAMAS 2017: 837-845 - [i1]Hang Ma, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig:
Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. CoRR abs/1705.10868 (2017)
Coauthor Index
aka: Daniel Damir Harabor

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 2023-09-21 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint