Stefan Edelkamp
About
In The Last Decade
Stefan Edelkamp
99 papers receiving 1.3k citations
Peers
Comparison fields: 5 of 76
- Artificial Intelligence 946
- Computer Networks and Communications 433
- Computational Theory and Mathematics 323
- Software 262
- Computer Vision and Pattern Recognition 259
Countries citing papers authored by Stefan Edelkamp
This map shows the geographic impact of Stefan Edelkamp's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stefan Edelkamp with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefan Edelkamp more than expected).
Fields of papers citing papers by Stefan Edelkamp
This network shows the impact of papers produced by Stefan Edelkamp. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stefan Edelkamp. The network helps show where Stefan Edelkamp may publish in the future.
Co-authorship network of co-authors of Stefan Edelkamp
This figure shows the co-authorship network connecting the top 25 collaborators of Stefan Edelkamp. A scholar is included among the top collaborators of Stefan Edelkamp based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Stefan Edelkamp. Stefan Edelkamp is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | The weak-heap family of priority queues in theory and praxis | 4 |
| 2 | Solving games in parallel with linear-time perfect hash functions | 1 |
| 3 | External Memory Search for Verification of Multi-threaded C++ Programs. | 1 |
| 4 | Optimal metric planning with state sets in automata representation | 1 |
| 5 | Model Checking and Artificial Intelligence: 4th Workshop, MoChArt IV, Riva del Garda, Italy, August 29, 2006, Revised Selected and Invited Papers | 6 |
| 6 | Automated Planning: Theory and Practice. | 16 |
| 7 | Cost-Optimal Symbolic Planning with State Trajectory and Preference Constraints | 3 |
| 8 | On the compilation of plan constraints and preferences | 39 |
| 9 | Cost-optimal external planning | 9 |
| 10 | Action Planning for Graph Transition Systems | 4 |
| 11 | Cost-algebraic heuristic search | 18 |
| 12 | External symbolic heuristic search with pattern databases | 10 |
| 13 | Abstraction in directed model checking | 1 |
| 14 | 31 | |
| 15 | Protocol verification with heuristic search | 27 |
| 16 | First Solutions to PDDL+ Planning Problems | 5 |
| 17 | Deterministic State Space Planning with BDDs | 4 |
| 18 | Datenstrukturen und Lernverfahren in der Zustandsraumsuche. | 0 |
| 19 | The branching factor of regular search spaces | 6 |
| 20 | Updating Shortest Paths. | 11 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.