M. Mundhenk
- Artificial Intelligence top 10%
- Computational Theory and Mathematics top 10%
- Computer Networks and Communications
- Management Science and Operations Research
- Computer Vision and Pattern Recognition
- Co-authors
- Judy GoldsmithMichael L. LittmanJohannes KöblerV. ArvindThomas ThieraufUwe SchöningLane A. HemachandraMitsunori Ogiwara
- Topics
- Machine Learning and Algorithms (4 papers)Complexity and Algorithms in Graphs (4 papers)Formal Methods in Verification (3 papers)
- Journals
- Lecture notes in computer scienceJournal of Artificial Intelligence ResearchInformation Processing Letters
- Partner nations
- GermanyIndiaUnited States
In The Last Decade
M. Mundhenk
9 papers receiving 179 citations
Peers
Comparison fields: 5 of 35
- Artificial Intelligence 166
- Computational Theory and Mathematics 70
- Computer Networks and Communications 35
- Management Science and Operations Research 25
- Computer Vision and Pattern Recognition 18
Countries citing papers authored by M. Mundhenk
This map shows the geographic impact of M. Mundhenk'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 M. Mundhenk with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. Mundhenk more than expected).
Fields of papers citing papers by M. Mundhenk
This network shows the impact of papers produced by M. Mundhenk. 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 M. Mundhenk. The network helps show where M. Mundhenk may publish in the future.
Co-authorship network of co-authors of M. Mundhenk
This figure shows the co-authorship network connecting the top 25 collaborators of M. Mundhenk. A scholar is included among the top collaborators of M. Mundhenk 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 M. Mundhenk. M. Mundhenk 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 Complexity of Satisfiability for Fragments of Hybrid Logic---Part II | 1 |
| 2 | The Complexity of Hybrid Logics over Equivalence Relations | 1 |
| 3 | 3 | |
| 4 | 10 | |
| 5 | 52 | |
| 6 | 104 | |
| 7 | 1 | |
| 8 | 1 | |
| 9 | 8 | |
| 10 | 1 | |
| 11 | 19 |
About M. Mundhenk
M. Mundhenk is a scholar working on Computational Theory and Mathematics, Software and Artificial Intelligence, having authored 11 papers that have together received 201 indexed citations. Recurring topics across this work include Machine Learning and Algorithms (4 papers), Complexity and Algorithms in Graphs (4 papers) and Formal Methods in Verification (3 papers). The work is most often cited by research in Artificial Intelligence (166 citations), Computational Theory and Mathematics (70 citations) and Software (9 citations). M. Mundhenk has collaborated with scholars based in Germany, India and United States. Frequent co-authors include Judy Goldsmith, Michael L. Littman, Johannes Köbler, V. Arvind, Thomas Thierauf, Uwe Schöning, Lane A. Hemachandra, Mitsunori Ogiwara, Riccardo Silvestri and Thomas Schneider. Their work appears in journals such as Lecture notes in computer science, Journal of Artificial Intelligence Research and Information Processing Letters.
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.