Marcel Steinmetz

487 total citations
37 papers, 199 citations indexed

About

Marcel Steinmetz is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Marcel Steinmetz has authored 37 papers receiving a total of 199 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Artificial Intelligence, 13 papers in Computer Networks and Communications and 8 papers in Computational Theory and Mathematics. Recurrent topics in Marcel Steinmetz's work include AI-based Problem Solving and Planning (22 papers), Logic, Reasoning, and Knowledge (15 papers) and Formal Methods in Verification (8 papers). Marcel Steinmetz is often cited by papers focused on AI-based Problem Solving and Planning (22 papers), Logic, Reasoning, and Knowledge (15 papers) and Formal Methods in Verification (8 papers). Marcel Steinmetz collaborates with scholars based in Germany, Denmark and United States. Marcel Steinmetz's co-authors include Jörg Hoffmann, Jöerg Hoffmann, Olivier Buffet, Jörg Hoffmann, Michael Backes, Daniele Magazzeni, Holger Hermanns, Michael Cashmore, Michael Backes and Álvaro Torralba and has published in prestigious journals such as Artificial Intelligence, Journal of Artificial Intelligence Research and International Journal on Software Tools for Technology Transfer.

In The Last Decade

Marcel Steinmetz

34 papers receiving 195 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Marcel Steinmetz Germany 9 138 50 33 30 26 37 199
Qiwen Xu China 6 104 0.8× 43 0.9× 78 2.4× 19 0.6× 25 1.0× 29 169
Liang Feng Zhang China 8 123 0.9× 34 0.7× 32 1.0× 72 2.4× 11 0.4× 34 173
Manuel Serrano France 8 104 0.8× 48 1.0× 36 1.1× 44 1.5× 24 0.9× 30 150
Fernando Sáenz-Pérez Spain 6 91 0.7× 52 1.0× 33 1.0× 20 0.7× 11 0.4× 43 134
Victor Vu United States 5 206 1.5× 46 0.9× 56 1.7× 79 2.6× 6 0.2× 7 229
Olivier Gruber France 8 83 0.6× 107 2.1× 18 0.5× 59 2.0× 22 0.8× 15 168
Panagiotis Kouvaros United Kingdom 9 154 1.1× 27 0.5× 87 2.6× 8 0.3× 22 0.8× 18 190
Paul B. Jackson United Kingdom 7 99 0.7× 62 1.2× 59 1.8× 23 0.8× 13 0.5× 20 173
Sela Mador-Haim United States 4 51 0.4× 48 1.0× 23 0.7× 62 2.1× 63 2.4× 7 145

Countries citing papers authored by Marcel Steinmetz

Since Specialization
Citations

This map shows the geographic impact of Marcel Steinmetz'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 Marcel Steinmetz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marcel Steinmetz more than expected).

Fields of papers citing papers by Marcel Steinmetz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Marcel Steinmetz. 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 Marcel Steinmetz. The network helps show where Marcel Steinmetz may publish in the future.

Co-authorship network of co-authors of Marcel Steinmetz

This figure shows the co-authorship network connecting the top 25 collaborators of Marcel Steinmetz. A scholar is included among the top collaborators of Marcel Steinmetz 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 Marcel Steinmetz. Marcel Steinmetz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Behnke, Gregor & Marcel Steinmetz. (2024). On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification. Proceedings of the International Conference on Automated Planning and Scheduling. 34. 20–24. 1 indexed citations
2.
Steinmetz, Marcel, et al.. (2023). Lifted Stackelberg Planning. Proceedings of the International Conference on Automated Planning and Scheduling. 33(1). 370–374. 2 indexed citations
3.
Steinmetz, Marcel, et al.. (2022). Classical Planning with Avoid Conditions. Proceedings of the AAAI Conference on Artificial Intelligence. 36(9). 9944–9952.
4.
Steinmetz, Marcel, Daniel Fišer, Daniel Höller, et al.. (2022). Debugging a Policy: Automatic Action-Policy Testing in AI Planning. Proceedings of the International Conference on Automated Planning and Scheduling. 32. 353–361. 3 indexed citations
5.
Steinmetz, Marcel, et al.. (2022). Glyph-Based Visual Analysis of Q-Learning Based Action Policy Ensembles on Racetrack. 1–10. 1 indexed citations
6.
Steinmetz, Marcel, et al.. (2022). Neural Network Action Policy Verification via Predicate Abstraction. Proceedings of the International Conference on Automated Planning and Scheduling. 32. 371–379. 1 indexed citations
7.
Hermanns, Holger, et al.. (2022). Analyzing neural network behavior through deep statistical model checking. International Journal on Software Tools for Technology Transfer. 25(3). 407–426. 4 indexed citations
8.
Steinmetz, Marcel & Álvaro Torralba. (2021). Bridging the Gap between Abstractions and Critical-Path Heuristics via Hypergraphs. Proceedings of the International Conference on Automated Planning and Scheduling. 29. 473–481. 2 indexed citations
9.
Torralba, Álvaro, et al.. (2021). Faster Stackelberg Planning via Symbolic Search and Information Sharing. Proceedings of the AAAI Conference on Artificial Intelligence. 35(13). 11998–12006. 6 indexed citations
10.
Cashmore, Michael, et al.. (2020). A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning. Proceedings of the AAAI Conference on Artificial Intelligence. 34(6). 9818–9826. 17 indexed citations
11.
Steinmetz, Marcel, et al.. (2020). Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties. 4091–4097. 2 indexed citations
12.
Hoffmann, Jörg, et al.. (2020). Let's Learn Their Language? A Case for Planning with Automata-Network Languages from Model Checking. Proceedings of the AAAI Conference on Artificial Intelligence. 34(9). 13569–13575. 4 indexed citations
13.
Steinmetz, Marcel, et al.. (2019). Towards automated network mitigation analysis. Figshare. 1971–1978. 10 indexed citations
14.
Shani, Guy, et al.. (2018). Simulated Penetration Testing as Contingent Planning. Proceedings of the International Conference on Automated Planning and Scheduling. 28. 241–249. 9 indexed citations
15.
Steinmetz, Marcel & Jörg Hoffmann. (2017). Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning. 4398–4404. 5 indexed citations
16.
Steinmetz, Marcel, et al.. (2017). Beyond Red-Black Planning: Limited-Memory State Variables. Proceedings of the International Conference on Automated Planning and Scheduling. 27. 269–273. 3 indexed citations
17.
Steinmetz, Marcel & Jöerg Hoffmann. (2016). Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends. Proceedings of the AAAI Conference on Artificial Intelligence. 30(1). 13 indexed citations
18.
Steinmetz, Marcel, et al.. (2016). Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization. Journal of Artificial Intelligence Research. 56. 269–327. 8 indexed citations
19.
Steinmetz, Marcel & Jörg Hoffmann. (2016). State space search nogood learning: Online refinement of critical-path dead-end detectors in planning. Artificial Intelligence. 245. 1–37. 15 indexed citations
20.
Brunner, B., K. Landzettel, G. Schreiber, Marcel Steinmetz, & G. Hirzinger. (1999). A Universal Task-Level Ground Control and Programming System for Space Robot Applications. ESASP. 440. 507. 9 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Qiwen Xu Breakdown of academic impact, for papers by Liang Feng Zhang Breakdown of academic impact, for papers by Manuel Serrano Breakdown of academic impact, for papers by Fernando Sáenz-Pérez Breakdown of academic impact, for papers by Victor Vu Breakdown of academic impact, for papers by Olivier Gruber Breakdown of academic impact, for papers by Panagiotis Kouvaros Breakdown of academic impact, for papers by Paul B. Jackson Breakdown of academic impact, for papers by Sela Mador-Haim
Rankless by CCL
2026