default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLukás Chrpa
Lukáš Chrpa
Person information
- affiliation: Czech Technical University in Prague
- unicode name: Lukáš Chrpa
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c89]Lukás Chrpa, Erez Karpas:
On Verifying Linear Execution Strategies in Planning Against Nature. ICAPS 2024: 86-94- [c88]Jakub Med
, Lukás Chrpa, Michael Morak, Wolfgang Faber:
Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity. ICAPS 2024: 369-377 - [c87]Matyás Svadlenka, Lukás Chrpa:
A Framework for Centralized Traffic Routing in Urban Areas. IJCAI 2024: 8810-8814 - [i5]Slavomír Svancár, Lukás Chrpa, Filip Dvorák, Tomás Balyo:
Cloud Kitchen: Using Planning-based Composite AI to Optimize Food Delivery Process. CoRR abs/2402.10725 (2024) - [i4]Tomás Balyo, Martin Suda, Lukás Chrpa, Dominik Safránek, Filip Dvorák, Roman Barták, G. Michael Youngblood:
Learning Planning Action Models from State Traces. CoRR abs/2402.10726 (2024) - 2023
- [c86]Matyás Svadlenka, Lukás Chrpa:
Towards a Framework for Intelligent Urban Traffic Routing. FLAIRS 2023 - [c85]Lukás Chrpa, Roman Barták, Jindrich Vodrázka, Marta Vomlelová:
Attributed Transition-Based Domain Control Knowledge for Domain-Independent Planning (Extended Abstract). ICDE 2023: 3879-3880 - [c84]Mauro Vallati, Lukás Chrpa:
In Defence of Good Old-Fashioned Artificial Intelligence Approaches in Intelligent Transportation Systems. ITSC 2023: 4913-4918 - [c83]Lukás Chrpa, Mauro Vallati:
Centralised Vehicle Routing for Optimising Urban Traffic: A Scalability Perspective. IV 2023: 1-6 - [c82]Lukás Chrpa, Carmine Dodaro, Marco Maratea, Marco Mochi, Mauro Vallati:
Comparing Planning Domain Models Using Answer Set Programming. JELIA 2023: 227-242 - [c81]Marco De Bortoli, Lukás Chrpa, Martin Gebser, Gerald Steinbauer-Wagner:
Enhancing Temporal Planning by Sequential Macro-Actions. JELIA 2023: 595-604 - [c80]Matyás Svadlenka, Lukás Chrpa, Mauro Vallati:
Improving the Scalability of Automated Planning-based Vehicle Routing via Smart Routes Identification. MT-ITS 2023: 1-6 - [c79]Marco De Bortoli, Lukás Chrpa, Martin Gebser, Gerald Steinbauer-Wagner:
Improving Applicability of Planning in the RoboCup Logistics League Using Macro-actions Refinement. RoboCup 2023: 287-298 - [c78]Andrii Nyporko, Lukás Chrpa:
Towards an Effective Framework Combining Planning and Scheduling [Extended Abstract]. SOCS 2023: 173-174 - [i3]Marco De Bortoli, Lukás Chrpa, Martin Gebser, Gerald Steinbauer-Wagner:
Enhancing Temporal Planning Domains by Sequential Macro-actions (Extended Version). CoRR abs/2307.12081 (2023) - 2022
- [j19]Lukás Chrpa, Mauro Vallati:
Planning with Critical Section Macros: Theory and Practice. J. Artif. Intell. Res. 74: 691-732 (2022) - [j18]Lukás Chrpa, Martin Pilát, Jakub Gemrot:
Planning and acting in dynamic environments: identifying and avoiding dangerous situations. J. Exp. Theor. Artif. Intell. 34(6): 925-948 (2022) - [j17]Lukás Chrpa, Roman Barták, Jindrich Vodrázka, Marta Vomlelová:
Attributed Transition-Based Domain Control Knowledge for Domain-Independent Planning. IEEE Trans. Knowl. Data Eng. 34(9): 4089-4101 (2022) - [c77]Lukás Chrpa, Pavel Rytír, Rostislav Horcík, Stefan Edelkamp:
Competing for Resources: Estimating Adversary Strategy for Effective Plan Generation. AAAI 2022: 9707-9715 - [c76]Rostislav Horcík, Álvaro Torralba, Pavel Rytír, Lukás Chrpa, Stefan Edelkamp:
Optimal Mixed Strategies for Cost-Adversarial Planning Games. ICAPS 2022: 160-168 - [c75]Jakub Med, Lukás Chrpa:
On Speeding Up Methods for Identifying Redundant Actions in Plans. ICAPS 2022: 252-260 - [c74]Ron Alford, Lukás Chrpa, Mauro Vallati, Andy Applebaum:
Knowledge Reformulation and Deception as a Defense Against Automated Cyber Adversaries. FLAIRS 2022 - [c73]Wolfgang Faber, Michael Morak, Lukás Chrpa:
Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers. PADL 2022: 42-56 - [c72]Lukás Chrpa, Pavel Rytír, Andrii Nyporko, Rostislav Horcík, Stefan Edelkamp:
Effective Planning in Resource-Competition Problems by Task Decomposition. SOCS 2022: 47-55 - [c71]Franc Ivankovic, Mauro Vallati, Lukás Chrpa, Marco Roveri:
Urban Traffic Control via Planning with Global State Constraints (Extended Abstract). SOCS 2022: 291-293 - [c70]Xuzhe Dang, Lukás Chrpa, Stefan Edelkamp:
Deep RRT. SOCS 2022: 333-335 - [e2]Lukás Chrpa, Alessandro Saetti:
Proceedings of the Fifteenth International Symposium on Combinatorial Search, SOCS 2022, Vienna, Austria, July 21-23, 2022. AAAI Press 2022, ISBN 1-57735-873-2 [contents] - 2021
- [j16]Mauro Vallati, Lukás Chrpa, Thomas Leo McCluskey, Frank Hutter:
On the Importance of Domain Model Configuration for Automated Planning Engines. J. Autom. Reason. 65(6): 727-773 (2021) - [j15]Wolfgang Faber, Michael Morak, Lukás Chrpa:
Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming. Theory Pract. Log. Program. 21(5): 646-662 (2021) - [c69]Mauro Vallati, Enrico Scala, Lukás Chrpa:
A Hybrid Automated Planning Approach for Urban Real-time Routing of Connected Vehicles. ITSC 2021: 3821-3826 - [c68]Lukás Chrpa, Martin Pilát, Jakub Med:
On Eventual Applicability of Plans in Dynamic Environments with Cyclic Phenomena. KR 2021: 184-193 - [c67]Lukás Chrpa, Wolfgang Faber, Michael Morak:
Universal and Uniform Action Reversibility. KR 2021: 651-654 - [c66]Mauro Vallati, Lukás Chrpa:
Effective Real-Time Urban Traffic Routing: An Automated Planning Approach. MT-ITS 2021: 1-6 - [c65]Lukás Chrpa, Pavel Rytír, Rostislav Horcík, Jan Cuhel, Anastasiia Livochka, Stefan Edelkamp:
Adversary Strategy Sampling for Effective Plan Generation. SOCS 2021: 164-166 - [i2]Wolfgang Faber, Michael Morak, Lukás Chrpa:
Determining ActionReversibility in STRIPS Using Answer Set and Epistemic Logic Programming. CoRR abs/2108.05428 (2021) - 2020
- [j14]Mauro Vallati, Lukás Chrpa, Ivan Serina:
MEvo: a framework for effective macro sets evolution. J. Exp. Theor. Artif. Intell. 32(4): 685-703 (2020) - [c64]Lukás Chrpa, Jakub Gemrot, Martin Pilát:
Planning and Acting with Non-Deterministic Events: Navigating between Safe States. AAAI 2020: 9802-9809 - [c63]Mauro Vallati, Lukás Chrpa:
Reducing Traffic Congestion in Urban Areas via Real-Time Re-Routing: A Simulation Study. Australasian Conference on Artificial Intelligence 2020: 69-81 - [c62]Mauro Vallati, Lukás Chrpa:
A Mixed-Integer Programming Approach for Scheduling Roadworks in Urban Regions. Australasian Conference on Artificial Intelligence 2020: 82-93 - [c61]Marta Vomlelová, Jindrich Vodrázka, Roman Barták, Lukás Chrpa:
Automated Acquisition of Control Knowledge for Classical Planners. ICAART (2) 2020: 959-966 - [c60]Lukás Chrpa, Wolfgang Faber, Daniel Fiser, Michael Morak:
Determining Action Reversibility in STRIPS Using Answer Set Programming. ICLP Workshops 2020 - [c59]Michael Morak, Lukás Chrpa, Wolfgang Faber, Daniel Fiser:
On the Reversibility of Actions in Planning. KR 2020: 652-661 - [c58]Lukás Chrpa, Pavel Rytír, Rostislav Horcík:
Planning Against Adversary in Zero-Sum Games: Heuristics for Selecting and Ordering Critical Actions. SOCS 2020: 20-28 - [p2]Lukás Chrpa:
Modeling Planning Tasks: Representation Matters. Knowledge Engineering Tools and Techniques for AI Planning 2020: 107-123 - [p1]Lukás Chrpa:
Planning in a Real-World Application: An AUV Case Study. Knowledge Engineering Tools and Techniques for AI Planning 2020: 249-259 - [i1]Mauro Vallati, Lukás Chrpa, Thomas Leo McCluskey, Frank Hutter:
On the Importance of Domain Model Configuration for Automated Planning Engines. CoRR abs/2010.07710 (2020)
2010 – 2019
- 2019
- [j13]Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey:
Inner entanglements: Narrowing the search in classical planning by problem reformulation. Comput. Intell. 35(2): 395-429 (2019) - [j12]Isabel Cenamor, Mauro Vallati, Lukás Chrpa:
On the predictability of domain-independent temporal planners. Comput. Intell. 35(4): 745-773 (2019) - [c57]Lukás Chrpa, Mauro Vallati:
Improving Domain-Independent Planning via Critical Section Macro-Operators. AAAI 2019: 7546-7553 - [c56]Lukás Chrpa, Martin Pilát, Jakub Gemrot:
Compiling Planning Problems with Non-deterministic Events into FOND Planning. RCRA/RiCeRcA@AI*IA 2019 - [c55]Mauro Vallati, Lukás Chrpa, Diane E. Kitchin:
How to Plan Roadworks in Urban Regions? A Principled Approach Based on AI Planning. ICCS (5) 2019: 453-460 - [c54]Pavel Rytír, Lukás Chrpa, Branislav Bosanský:
Using Classical Planning in Adversarial Problems. ICTAI 2019: 1335-1340 - [c53]Mauro Vallati, Lukás Chrpa:
On the Robustness of Domain-Independent Planning Engines: The Impact of Poorly-Engineered Knowledge. K-CAP 2019: 197-204 - [c52]Leah A. Chrestien, Lukás Chrpa:
Appropriate Expressiveness of Planning Domain Models: An Urban Traffic Control Case Study. K-CAP 2019: 247-250 - [c51]Lukás Chrpa, Mauro Vallati, Simon Parkinson:
Exploiting automated planning for efficient centralized vehicle routing and mitigating congestion in urban road networks. SAC 2019: 191-194 - 2018
- [j11]Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey:
Outer entanglements: a general heuristic technique for improving the efficiency of planning algorithms. J. Exp. Theor. Artif. Intell. 30(6): 831-856 (2018) - [j10]Mauro Vallati, Lukás Chrpa, Thomas Leo McCluskey:
What you always wanted to know about the deterministic part of the International Planning Competition (IPC) 2014 (but were too afraid to ask). Knowl. Eng. Rev. 33: e3 (2018) - [c50]Mauro Vallati, Lukás Chrpa, Diane E. Kitchin:
On the Configuration of Robust Static Parallel Portfolios for Efficient Plan Generation. ICCS (1) 2018: 15-27 - [c49]Lukás Chrpa, Mauro Vallati:
Determining Representativeness of Training Plans: A Case of Macro-Operators. ICTAI 2018: 488-492 - [c48]Mauro Vallati, Lukás Chrpa:
A Principled Analysis of the Interrelation between Vehicular Communication and Reasoning Capabilities of Autonomous Vehicles. ITSC 2018: 3761-3766 - [c47]Tomás Skerík, Lukás Chrpa, Wolfgang Faber, Mauro Vallati:
Automated Training Plan Generation for Athletes. SMC 2018: 3865-3870 - [c46]Tomás Balyo, Lukás Chrpa:
Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks. SOCS 2018: 133-137 - 2017
- [j9]Lukás Chrpa, Thomas Leo McCluskey, Mauro Vallati, Tiago Vaquero:
The Fifth International Competition on Knowledge Engineering for Planning and Scheduling: Summary and Trends. AI Mag. 38(1): 104-106 (2017) - [j8]Roman Barták, Lukás Chrpa, Agostino Dovier, Jindrich Vodrázka, Neng-Fa Zhou:
Modeling and solving planning problems in tabled logic programming: Experience from the Cave Diving domain. Sci. Comput. Program. 147: 54-77 (2017) - [c45]Mauro Vallati, Lukás Chrpa, Ivan Serina:
On the Evolution of Planner-Specific Macro Sets. AI*IA 2017: 443-454 - [c44]Simon Parkinson, Andrew Longstaff, Simon Fletcher, Mauro Vallati, Lukás Chrpa:
On the Exploitation of Automated Planning for Reducing Machine Tools Energy Consumption between Manufacturing Operations. ICAPS 2017: 400-408 - [c43]Lukás Chrpa, Jakub Gemrot, Martin Pilát:
Towards a Safer Planning and Execution Concept. ICTAI 2017: 972-976 - [c42]Lukás Chrpa, Nir Lipovetzky, Sebastian Sardiña:
Handling non-local dead-ends in Agent Planning Programs. IJCAI 2017: 971-978 - [c41]Lukás Chrpa, José Pinto, Tiago Sa Marques, Manuel A. Ribeiro, João Borges de Sousa:
Mixed-initiative planning, replanning and execution: From concept to field testing using AUV fleets. IROS 2017: 6825-6830 - [c40]Mauro Vallati, Lukás Chrpa, Thomas Leo McCluskey:
Improving a Planner's Performance through Online Heuristic Configuration of Domain Models. SOCS 2017: 171-172 - [e1]Lukás Chrpa, Simon Parkinson, Mauro Vallati:
Proceedings of the 34th Workshop of the UK Planning and Scheduling Special Interest Group, PlanSIG 2016, Huddersfield, UK, December 15-16, 2016. CEUR Workshop Proceedings 1782, CEUR-WS.org 2017 [contents] - 2016
- [j7]Lukás Chrpa, Thomas Leo McCluskey, Hugh Osborne:
On the completeness of replacing primitive actions with macro-actions and its generalization to planning operators and macro-operators. AI Commun. 29(1): 163-183 (2016) - [j6]Lukás Chrpa, Daniele Magazzeni, Keith McCabe, Thomas Leo McCluskey, Mauro Vallati:
Automated planning for Urban traffic control: Strategic vehicle routing to respect air quality limitations. Intelligenza Artificiale 10(2): 113-128 (2016) - [c39]Mauro Vallati, Daniele Magazzeni, Bart De Schutter, Lukás Chrpa, Thomas Leo McCluskey:
Efficient Macroscopic Urban Traffic Models for Reducing Congestion: A PDDL+ Planning Approach. AAAI 2016: 3188-3194 - [c38]Lukás Chrpa, Mauro Vallati:
On the exploitation of Automated Planning for efficient decision making in road traffic accident management. CDC 2016: 6607-6612 - [c37]Lukás Chrpa, Roman Barták:
Guiding Planning Engines by Transition-Based Domain Control Knowledge. KR 2016: 545-548 - [c36]Tomás Skerík, Wolfgang Faber, Lukás Chrpa:
Proposing of Planning System for Sports Domain: A Tool for Professional Coaches. PlanSIG 2016 - 2015
- [j5]Mauro Vallati, Lukás Chrpa, Diane E. Kitchin:
Portfolio-based planning: State of the art, common practice and open challenges. AI Commun. 28(4): 717-733 (2015) - [j4]Mauro Vallati, Lukás Chrpa, Marek Grzes, Thomas Leo McCluskey, Mark Roberts, Scott Sanner:
The 2014 International Planning Competition: Progress and Trends. AI Mag. 36(3): 90-98 (2015) - [c35]Lukás Chrpa, Daniele Magazzeni, Keith McCabe, Thomas Leo McCluskey, Mauro Vallati:
Automated Planning for Urban Traffic Control: Strategic Vehicle Routing to Respect Air Quality Limitations. IPS@AI*IA 2015: 65-79 - [c34]Lukás Chrpa, Fazlul Hasan Siddiqui:
Exploiting Block Deordering for Improving Planners Efficiency. IJCAI 2015: 1537-1543 - [c33]Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey:
On the Online Generation of Effective Macro-Operators. IJCAI 2015: 1544-1550 - [c32]Mauro Vallati, Frank Hutter, Lukás Chrpa, Thomas Leo McCluskey:
On the Effective Configuration of Planning Domain Models. IJCAI 2015: 1704-1711 - [c31]Lukás Chrpa, José Pinto, Manuel A. Ribeiro, Frederic Py, João Borges de Sousa, Kanna Rajan:
On mixed-initiative planning and control for Autonomous underwater vehicles. IROS 2015: 1685-1690 - [c30]Raquel Fuentetaja, Lukás Chrpa, Thomas Leo McCluskey, Mauro Vallati:
Exploring the Synergy between Two Modular Learning Techniques for Automated Planning. SOCS 2015: 35-43 - [c29]Lukás Chrpa, Enrico Scala, Mauro Vallati:
Towards a Reformulation Based Approach for Efficient Numeric Planning: Numeric Outer Entanglements. SOCS 2015: 166-170 - 2014
- [j3]Mauro Vallati, Lukás Chrpa, Diane E. Kitchin:
ASAP: An Automatic Algorithm Selection Approach for Planning. Int. J. Artif. Intell. Tools 23(6) (2014) - [j2]Lukás Chrpa, Hugh Osborne:
Towards a Trajectory Planning Concept: Augmenting Path Planning Methods by Considering Speed Limit Constraints. J. Intell. Robotic Syst. 75(2): 243-270 (2014) - [c28]Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey:
MUM: A Technique for Maximising the Utility of Macro-operators by Constrained Generation and Use. ICAPS 2014 - [c27]Gerhard Wickler, Lukás Chrpa, Thomas Leo McCluskey:
KEWI - A Knowledge Engineering Tool for Modelling AI Planning Tasks. KEOD 2014: 36-47 - [c26]Gerhard Wickler, Lukás Chrpa, Thomas Leo McCluskey:
Ontological Support for Modelling Planning Knowledge. IC3K (Selected Papers) 2014: 293-312 - [c25]Tomás Balyo, Lukás Chrpa, Asma Kilani:
On Different Strategies for Eliminating Redundant Actions from Plans. SOCS 2014: 10-18 - 2013
- [c24]Mauro Vallati, Lukás Chrpa, Andrew Crampton:
Underestimation vs. Overestimation in SAT-Based Planning. AI*IA 2013: 276-287 - [c23]Mauro Vallati, Lukás Chrpa, Diane E. Kitchin:
An Automatic Algorithm Selection Approach for Planning. ICTAI 2013: 1-8 - [c22]Lukás Chrpa, Mauro Vallati, Hugh Osborne:
Learnability of Specific Structural Patterns of Planning Problems. ICTAI 2013: 18-23 - [c21]Falilat Jimoh, Lukás Chrpa, Mauro Vallati:
Autonomic System Architecture: An Automated Planning Perspective. AIAI 2013: 121-130 - [c20]Mohammad Munshi Shahin Shah, Lukás Chrpa, Diane E. Kitchin, Thomas Leo McCluskey, Mauro Vallati:
Exploring Knowledge Engineering Strategies in Designing and Modelling a Road Traffic Accident Management Domain. IJCAI 2013: 2373-2379 - [c19]Falilat Jimoh, Lukás Chrpa, Thomas Leo McCluskey, Shahin Shah:
Towards application of automated planning in urban traffic control. ITSC 2013: 985-990 - [c18]Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey:
Determining Linearity of Optimal Plans by Operator Schema Analysis. SARA 2013 - [c17]Lukás Chrpa, Mauro Vallati, Thomas Leo McCluskey, Diane E. Kitchin:
Generating Macro-Operators by Exploiting Inner Entanglements. SARA 2013 - [c16]Lukás Chrpa, Mauro Vallati:
Revisiting Inner Entanglements in Classical Planning. SCAI 2013: 75-84 - 2012
- [c15]Lukás Chrpa, Thomas Leo McCluskey, Hugh Osborne:
Optimizing Plans through Analysis of Action Dependencies and Independencies. ICAPS 2012 - [c14]Munir Naveed, Diane E. Kitchin, Andrew Crampton, Lukás Chrpa, Peter Gregory:
A Monte-Carlo path planner for dynamic and partially observable environments. CIG 2012: 211-218 - [c13]Lukás Chrpa, Thomas Leo McCluskey:
On Exploiting Structures of Classical Planning Problems: Generalizing Entanglements. ECAI 2012: 240-245 - [c12]Lukás Chrpa, Thomas Leo McCluskey, Hugh Osborne:
Reformulating Planning Problems: A Theoretical Point of View. FLAIRS 2012 - [c11]Lukás Chrpa, Thomas Leo McCluskey, Hugh Osborne:
Determining Redundant Actions in Sequential Plans. ICTAI 2012: 484-491 - [c10]Shahin Shah, Lukás Chrpa, Peter Gregory, Thomas Leo McCluskey, Falilat Jimoh:
OCL Plus: Processes and Events in Object-Centred Planning. STAIRS 2012: 282-293 - 2011
- [c9]Lukás Chrpa, Peter Novák:
Dynamic Trajectory Replanning for Unmanned Aircrafts Supporting Tactical Missions in Urban Environments. HoloMAS 2011: 256-265 - [c8]Lukás Chrpa, Antonín Komenda:
Smoothed Hex-grid Trajectory Planning using Helicopter Dynamics. ICAART (1) 2011: 629-632 - [c7]Lukás Chrpa:
Trajectory Planning on Grids: Considering Speed Limit Constraints. SCAI 2011: 60-69 - 2010
- [j1]Lukás Chrpa:
Generation of macro-operators via investigation of action dependencies in plans. Knowl. Eng. Rev. 25(3): 281-297 (2010) - [c6]Lukás Chrpa:
Combining Learning Techniques for Classical Planning: Macro-operators and Entanglements. ICTAI (2) 2010: 79-86
2000 – 2009
- 2009
- [c5]Lukás Chrpa, Roman Barták:
Reformulating Planning Problems by Eliminating Unpromising Actions. SARA 2009 - 2008
- [c4]Lukás Chrpa, Roman Barták:
Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies. FLAIRS 2008: 531-536 - [c3]Lukás Chrpa, Roman Barták:
Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action Dependencies. SCAI 2008: 175-180 - 2007
- [c2]Pavel Surynek, Lukás Chrpa, Jirí Vyskocil:
Solving Difficult Problems by Viewing them as Structured Dense Graphs. IICAI 2007: 84-103 - [c1]Lukás Chrpa, Pavel Surynek, Jirí Vyskocil:
Encoding of Planning Problems and Their Optimizations in Linear Logic. INAP/WLP 2007: 54-68
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-10-21 21:31 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:
