default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Harabor
Daniel Damir Harabor
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
[j11]Sajjad K. Moghadam
, Morteza Ebrahimi, Daniel Damir Harabor:
Guards: Benchmarks for weighted grid-based pathfinding. Expert Syst. Appl. 249: 123719 (2024)- [j10]Hassan Afzaal, Mark Wallace, Irene Moser, Daniel Damir Harabor:
Snapshot-Optimal Real-Time Ride Sharing. Inf. 15(4): 174 (2024) - [c82]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. AAAI 2024: 20674-20682 - [c81]Shao-Hung Chan, Zhe Chen, Dian-Lun Lin, Yue Zhang, Daniel Harabor, Sven Koenig, Tsung-Wei Huang, Thomy Phan:
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search. AAMAS 2024: 2183-2185 - [c80]Saman Ahmadi, Nathan R. Sturtevant, Daniel Harabor, Mahdi Jalili:
Exact Multi-objective Path Finding with Negative Weights. ICAPS 2024: 11-19 - [c79]Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey:
Planning and Execution in Multi-Agent Path Finding: Models and Algorithms. ICAPS 2024: 707-715 - [c78]Abdallah Abu-Aisha, Mark Wallace, Daniel Harabor, Bojie Shen:
Efficient and Exact Public Transport Routing via a Transfer Connection Database. SOCS 2024: 2-10 - [c77]Mark Carlson, Daniel Harabor, Peter J. Stuckey:
Avoiding Node Re-Expansions Can Break Symmetry Breaking. SOCS 2024: 20-27 - [c76]Jonathan Morag, Yue Zhang, Daniel Koyfman, Zhe Chen, Ariel Felner, Daniel Harabor, Roni Stern:
Prioritised Planning with Guarantees. SOCS 2024: 82-90 - [c75]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding (Extended Abstract). SOCS 2024: 265-266 - [c74]Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey:
Planning and Exection in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract). SOCS 2024: 303-304 - [i18]Shao-Hung Chan, Zhe Chen, Dian-Lun Lin, Yue Zhang, Daniel Harabor, Tsung-Wei Huang, Sven Koenig, Thomy Phan:
Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search. CoRR abs/2402.01961 (2024) - 2023
- [c73]Mark Carlson, Sajjad K. Moghadam, Daniel Damir Harabor, Peter J. Stuckey, Morteza Ebrahimi:
Optimal Pathfinding on Weighted Grid Maps. AAAI 2023: 12373-12380 - [c72]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 - [c71]Bojie Shen, Zhe Chen, Jiaoyang Li, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Beyond Pairwise Reasoning in Multi-Agent Path Finding. ICAPS 2023: 384-392 - [c70]Ali Davoodi, Mark Wallace, Daniel Harabor, Dong Ngoduy:
Optimal Routing for Autonomous Vehicles in a Mixed Congested Network Considering Fairness. ITSC 2023: 1870-1875 - [c69]Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh:
Voxel Benchmarks for 3D Pathfinding: Sandstone, Descent, and Industrial Plants. SOCS 2023: 56-64 - [c68]Yue Zhang, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey:
Efficient Multi Agent Path Finding with Turn Actions. SOCS 2023: 119-127 - [c67]Shizhe Zhao, Daniel Harabor, Peter J. Stuckey:
Reducing Redundant Work in Jump Point Search. SOCS 2023: 128-136 - [i17]Bojie Shen, Zhe Chen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Tracking Progress in Multi-Agent Path Finding. CoRR abs/2305.08446 (2023) - [i16]Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey:
Scalable Rail Planning and Replanning with Soft Deadlines. CoRR abs/2306.06455 (2023) - [i15]Shizhe Zhao, Daniel Harabor, Peter J. Stuckey:
Reducing Redundant Work in Jump Point Search. CoRR abs/2306.15928 (2023) - [i14]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding. CoRR abs/2308.11234 (2023) - 2022
- [j9]Bojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Fast optimal and bounded suboptimal Euclidean pathfinding. Artif. Intell. 302: 103624 (2022) - [j8]Edward Lam, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey:
Branch-and-cut-and-price for multi-agent path finding. Comput. Oper. Res. 144: 105809 (2022) - [c66]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 - [c65]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 - [c64]Shuli Hu, Daniel Damir Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant:
Multi-Agent Path Finding with Temporal Jump Point Search. ICAPS 2022: 169-173 - [c63]Bojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Improving Time-Dependent Contraction Hierarchies. ICAPS 2022: 338-347 - [c62]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Weight Constrained Path Finding with Bidirectional A. SOCS 2022: 2-10 - [c61]Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Multi-Train Path Finding Revisited. SOCS 2022: 38-46 - [c60]Thomas K. Nobes, Daniel Harabor, Michael Wybrow, Stuart D. C. Walsh:
The JPS Pathfinding System in 3D. SOCS 2022: 145-152 - [c59]Daniel Harabor, Ryan Hechenberger, Thomas Jahn:
Benchmarks for Pathfinding Search: Iron Harvest. SOCS 2022: 218-222 - [c58]Ali Davoodi, Mark Wallace, Daniel Harabor:
Fast Traffic Assignment by Focusing on Changing Edge Flows (Extended Abstract). SOCS 2022: 267-269 - [c57]Ryan Hechenberger, Peter J. Stuckey, Pierre Le Bodic, Daniel Damir Harabor:
Dual Euclidean Shortest Path Search (Extended Abstract). SOCS 2022: 285-287 - [i13]Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic:
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version). CoRR abs/2207.02436 (2022) - [i12]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Enhanced Methods for the Weight Constrained Shortest Path Problem: Constrained Path Finding Meets Bi-objective Search. CoRR abs/2207.14744 (2022) - 2021
- [j7]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) - [j6]Daniel Harabor, Mauro Vallati:
Organizing a Successful Artificial Intelligence Online Conference: Lessons from the 13th Symposium on Combinatorial Search. AI Mag. 42(1): 76-82 (2021) - [j5]Yue Hu, Daniel Harabor, Long Qin, Quanjun Yin:
Regarding Goal Bounding and Jump Point Search. J. Artif. Intell. Res. 70: 631-681 (2021) - [j4]Zhe Chen, Javier Alonso-Mora, Xiaoshan Bai, Daniel Damir Harabor, Peter J. Stuckey:
Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery. IEEE Robotics Autom. Lett. 6(3): 5816-5823 (2021) - [c56]Saman Ahmadi, Guido Tack, Daniel Damir Harabor, Philip Kilby:
A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem. AAAI 2021: 12217-12224 - [c55]Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey, Sven Koenig:
f-Aware Conflict Prioritization & Improved Heuristics For Conflict-Based Search. AAAI 2021: 12241-12248 - [c54]Zhe Chen, Daniel Damir Harabor, Jiaoyang Li, Peter J. Stuckey:
Symmetry Breaking for k-Robust Multi-Agent Path Finding. AAAI 2021: 12267-12274 - [c53]Shuli Hu, Daniel Damir Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant:
Jump Point Search with Temporal Obstacles. ICAPS 2021: 184-191 - [c52]Bojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Contracting and Compressing Shortest Path Databases. ICAPS 2021: 322-330 - [c51]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 - [c50]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. AAMAS 2021: 1581-1583 - [c49]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles. CP 2021: 11:1-11:17 - [c48]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-Objective Search with Bi-Directional A. ESA 2021: 3:1-3:15 - [c47]Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Anytime Multi-Agent Path Finding via Large Neighborhood Search. IJCAI 2021: 4127-4135 - [c46]Arthur Mahéo, Shizhe Zhao, Hassan Afzaal, Daniel Harabor, Peter J. Stuckey, Mark Wallace:
Customised Shortest Paths Using a Distributed Reverse Oracle. SOCS 2021: 79-87 - [c45]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-Objective Search with Bi-directional A* (Extended Abstract). SOCS 2021: 142-144 - [c44]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 - [c43]Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema, Peter J. Stuckey, Pierre Le Bodic:
Multi-Target Search in Euclidean Space with Ray Shooting. SOCS 2021: 176-178 - [c42]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 - [c41]Eli Boyarski, Ariel Felner, Pierre Le Bodic, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Further Improved Heuristics For Conflict-Based Search. SOCS 2021: 213-215 - [i11]Zhe Chen, Daniel Harabor, Jiaoyang Li, Peter J. Stuckey:
Symmetry Breaking for k-Robust Multi-Agent Path Finding. CoRR abs/2102.08689 (2021) - [i10]Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Sven Koenig:
Pairwise Symmetry Reasoning for Multi-Agent Path Finding Search. CoRR abs/2103.07116 (2021) - [i9]Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-objective Search with Bi-directional A. CoRR abs/2105.11888 (2021) - [i8]Zhe Chen, Javier Alonso-Mora, Xiaoshan Bai, Daniel Damir Harabor, Peter J. Stuckey:
Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery. CoRR abs/2110.14891 (2021) - 2020
- [c40]Ryan Hechenberger, Peter J. Stuckey, Daniel Harabor, Pierre Le Bodic, Muhammad Aamir Cheema:
Online Computation of Euclidean Shortest Paths in Two Dimensions. ICAPS 2020: 134-142 - [c39]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 - [c38]Shizhe Zhao, Mattia Chiari, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Peter J. Stuckey:
Bounded Suboptimal Path Planning with Compressed Path Databases. ICAPS 2020: 333-342 - [c37]Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen, Jiaoyang Li, Sven Koenig:
Iterative-Deepening Conflict-Based Search. IJCAI 2020: 4084-4090 - [c36]Bojie Shen, Muhammad Aamir Cheema, Daniel Harabor, Peter J. Stuckey:
Euclidean Pathfinding with Compressed Path Databases. IJCAI 2020: 4229-4235 - [c35]Gleb Belov, Wenbo Du, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei:
From Multi-Agent Pathfinding to 3D Pipe Routing. SOCS 2020: 11-19 - [c34]Eli Boyarski, Daniel Harabor, Peter J. Stuckey, Pierre Le Bodic, Ariel Felner:
F-Cardinal Conflicts in Conflict-Based Search. SOCS 2020: 123-124 - [c33]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 - [e1]Daniel Harabor, Mauro Vallati:
Proceedings of the Thirteenth International Symposium on Combinatorial Search, SOCS 2020, Online Conference [Vienna, Austria], 26-28 May 2020. AAAI Press 2020, ISBN 978-1-57735-822-0 [contents] - [i7]Daniel Harabor, Mauro Vallati:
Organising a Successful AI Online Conference: Lessons from SoCS 2020. CoRR abs/2006.12129 (2020)
2010 – 2019
- 2019
- [c32]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 - [c31]Hang Ma, Daniel Harabor, Peter J. Stuckey, Jiaoyang Li, Sven Koenig:
Searching with Consistent Prioritization for Multi-Agent Path Finding. AAAI 2019: 7643-7650 - [c30]Mattia Chiari, Shizhe Zhao, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Matteo Salvetti, Peter J. Stuckey:
Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols. ICAPS 2019: 106-113 - [c29]Graeme Gange, Daniel Harabor, Peter J. Stuckey:
Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation. ICAPS 2019: 155-162 - [c28]Yue Hu, Daniel Harabor, Long Qin, Quanjun Yin, Cong Hu:
Improving the Combination of JPS and Geometric Containers. ICAPS 2019: 209-213 - [c27]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 - [c26]John M. Betts, David L. Dowe, Daniel Guimarans, Daniel Damir Harabor, Heshan Kumarage, Peter J. Stuckey, Michael Wybrow:
Peak-Hour Rail Demand Shifting with Discrete Optimisation. CP 2019: 748-763 - [c25]Massimo Bono, Alfonso Emilio Gerevini, Daniel Damir Harabor, Peter J. Stuckey:
Path Planning with CPD Heuristics. IJCAI 2019: 1199-1205 - [c24]Daniel Damir Harabor, Tansel Uras, Peter J. Stuckey, Sven Koenig:
Regarding Jump Point Search and Subgoal Graphs. IJCAI 2019: 1241-1248 - [c23]Edward Lam, Pierre Le Bodic, Daniel Damir Harabor, Peter J. Stuckey:
Branch-and-Cut-and-Price for Multi-Agent Pathfinding. IJCAI 2019: 1289-1296 - [c22]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 - [c21]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 - [i6]Gleb Belov, Liron Cohen, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei:
Position Paper: From Multi-Agent Pathfinding to Pipe Routing. CoRR abs/1905.08412 (2019) - 2018
- [c20]Matteo Salvetti, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti:
Two-Oracle Optimal Path Planning on Grid Maps. ICAPS 2018: 227-231 - [c19]Daniel Damir Harabor, Peter J. Stuckey:
Forward Search in Contraction Hierarchies. SOCS 2018: 55-62 - [c18]Shizhe Zhao, David Taniar, Daniel Damir Harabor:
Fast k-Nearest Neighbor on a Navigation Mesh. SOCS 2018: 124-131 - [i5]Shizhe Zhao, Daniel Damir Harabor, David Taniar:
Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour. CoRR abs/1808.04043 (2018) - [i4]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
- [c17]Michael Cui, Daniel Damir Harabor, Alban Grastien:
Compromise-free Pathfinding on a Navigation Mesh. IJCAI 2017: 496-502 - 2016
- [j3]Daniel Damir Harabor, Alban Grastien, Dindar Öz, Vural Aksakalli:
Optimal Any-Angle Pathfinding In Practice. J. Artif. Intell. Res. 56: 89-118 (2016) - [c16]Daniel Harabor, Peter J. Stuckey:
Rail Capacity Modelling with Constraint Programming. CPAIOR 2016: 170-186 - 2015
- [j2]Ben Strasser, Adi Botea, Daniel Harabor:
Compressing Optimal Paths with Run Length Encoding. J. Artif. Intell. Res. 54: 593-629 (2015) - [j1]Jorge A. Baier, Adi Botea, Daniel Harabor, Carlos Hernández:
Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps. IEEE Trans. Comput. Intell. AI Games 7(2): 193-199 (2015) - [c15]Adi Botea, Ben Strasser, Daniel Harabor:
Complexity Results for Compressing Optimal Paths. AAAI 2015: 1100-1106 - [c14]Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin:
The Grid-Based Path Planning Competition: 2014 Entries and Results. SOCS 2015: 241-250 - [i3]Daniel Guimarans, Daniel Harabor, Pascal Van Hentenryck:
Simulation and Analysis of Container Freight Train Operations at Port Botany. CoRR abs/1512.03476 (2015) - 2014
- [c13]Daniel Damir Harabor, Alban Grastien:
Improving Jump Point Search. ICAPS 2014 - [c12]Ben Strasser, Daniel Harabor, Adi Botea:
Fast First-Move Queries through Run-Length Encoding. SOCS 2014: 157-165 - 2013
- [c11]Adi Botea, Jorge A. Baier, Daniel Harabor, Carlos Hernández:
Moving Target Search with Compressed Path Databases. ICAPS 2013 - [c10]Adi Botea, Daniel Harabor:
Path Planning with Compressed All-Pairs Shortest Paths Data. ICAPS 2013 - [c9]Daniel Damir Harabor, Alban Grastien:
An Optimal Any-Angle Pathfinding Algorithm. ICAPS 2013 - 2012
- [c8]Leonid Antsfeld, Daniel Damir Harabor, Philip Kilby, Toby Walsh:
TRANSIT Routing on Video Game Maps. AIIDE 2012 - [c7]Daniel Damir Harabor, Alban Grastien:
The JPS Pathfinding System. SOCS 2012: 207-208 - 2011
- [c6]Daniel Damir Harabor, Alban Grastien:
Online Graph Pruning for Pathfinding On Grid Maps. AAAI 2011: 1114-1119 - [c5]Daniel Harabor:
Graph Pruning and Symmetry Breaking on Grid Maps. IJCAI 2011: 2816-2817 - [c4]Daniel Damir Harabor, Adi Botea, Philip Kilby:
Path Symmetries in Undirected Uniform-Cost Grids. SARA 2011 - [i2]Daniel Harabor, Philip Kilby:
Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains. CoRR abs/1103.3904 (2011) - [i1]Daniel Harabor, Adi Botea, Philip Kilby:
Symmetry-Based Search Space Reduction For Grid Maps. CoRR abs/1106.4083 (2011) - 2010
- [c3]Daniel Harabor, Adi Botea:
Breaking Path Symmetries on 4-Connected Grid Maps. AIIDE 2010 - [c2]Andreas Bauer, Viorica Botea, Mark Brown, Matt Gray, Daniel Harabor, John K. Slaney:
An Integrated Modelling, Debugging, and Visualisation Environment for G12. CP 2010: 522-536
2000 – 2009
Coauthor Index
[c82] [c79] [c77] [c75] [c74] [c73] [c72] [c71] [c68] [c67] [i17] [i16] [i15] [i14] [j9] [j8] [c66] [c65] [c64] [c63] [c61] [c57] [i13] [j7] [j4] [c55] [c54] [c53] [c52] [c51] [c50] [c47] [c46] [c44] [c43] [c42] [c41] [i11] [i10] [i8] [c40] [c39] [c38] [c37] [c36] [c34] [c33] [c32] [c31] [c30] [c29] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [c19] [i4] [c16]
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-10-17 21:32 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:
