M. Mundhenk

447 total citations
11 papers, 201 citations indexed

About

M. Mundhenk is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, M. Mundhenk has authored 11 papers receiving a total of 201 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 6 papers in Artificial Intelligence and 2 papers in Computer Networks and Communications. Recurrent topics in M. Mundhenk's work include Machine Learning and Algorithms (4 papers), Complexity and Algorithms in Graphs (4 papers) and Formal Methods in Verification (3 papers). M. Mundhenk is often cited by papers focused on Machine Learning and Algorithms (4 papers), Complexity and Algorithms in Graphs (4 papers) and Formal Methods in Verification (3 papers). M. Mundhenk collaborates with scholars based in Germany, India and United States. M. Mundhenk's co-authors include Judy Goldsmith, Michael L. Littman, Johannes Köbler, V. Arvind, Uwe Schöning, Lane A. Hemachandra, Mitsunori Ogiwara, Riccardo Silvestri, Thomas Thierauf and Thomas Schneider and has published in prestigious journals such as Lecture notes in computer science, Journal of Artificial Intelligence Research and Information Processing Letters.

In The Last Decade

M. Mundhenk

9 papers receiving 179 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
M. Mundhenk Germany	5	166	70	35	25	18	11	201
Michel de Rougemont France	6	89 0.5×	65 0.9×	42 1.2×	16 0.6×	6 0.3×	28	134
Mikhail Soutchanski Canada	7	216 1.3×	24 0.3×	25 0.7×	10 0.4×	16 0.9×	17	232
Stephen M. Majercik United States	8	220 1.3×	60 0.9×	78 2.2×	12 0.5×	13 0.7×	16	253
Robert Mattmüller Germany	10	268 1.6×	65 0.9×	72 2.1×	11 0.4×	36 2.0×	29	302
M. Rifqi France	5	80 0.5×	28 0.4×	17 0.5×	37 1.5×	13 0.7×	8	129
Oded Lachish United Kingdom	8	79 0.5×	112 1.6×	44 1.3×	23 0.9×	8 0.4×	26	164
Hirohisa Seki Japan	7	106 0.6×	103 1.5×	24 0.7×	3 0.1×	10 0.6×	36	178
Markus N. Rabe United States	6	100 0.6×	62 0.9×	22 0.6×	6 0.2×	6 0.3×	18	151
Ming Tan United States	6	216 1.3×	32 0.5×	20 0.6×	7 0.3×	32 1.8×	13	241

Countries citing papers authored by M. Mundhenk

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

11 of 11 papers shown

1.

Meier, Arne, et al.. (2010). The Complexity of Satisfiability for Fragments of Hybrid Logic---Part II. Research Explorer (The University of Manchester). 1 indexed citations

2.

Mundhenk, M. & Thomas Schneider. (2007). The Complexity of Hybrid Logics over Equivalence Relations. Research Explorer (The University of Manchester). 1 indexed citations

3.

Beckstein, Clemens, Peter Dittrich, Dietmar Fey, et al.. (2006). SOGOS - A Distributed Meta Level Architecture for the Self-Organizing Grid of Services. 82–82. 3 indexed citations

4.

Goldsmith, Judy & M. Mundhenk. (2002). Complexity issues in Markov decision processes. 272–280. 10 indexed citations

5.

Goldsmith, Judy, et al.. (2001). Nonapproximability Results for Partially Observable Markov Decision Processes. Journal of Artificial Intelligence Research. 14. 83–103. 52 indexed citations

6.

Littman, Michael L., Judy Goldsmith, & M. Mundhenk. (1998). The Computational Complexity of Probabilistic Planning. Journal of Artificial Intelligence Research. 9. 1–36. 104 indexed citations

7.

Arvind, V., Johannes Köbler, & M. Mundhenk. (1996). Upper bounds for the complexity of sparse and tally descriptions. Theory of Computing Systems. 29(1). 63–94. 8 indexed citations

8.

Köbler, Johannes, et al.. (1996). Upper Bounds for the Complexity of Sparse and Tally Descriptions. Mathematical Systems Theory. 29(1). 63–63. 1 indexed citations

9.

Arvind, V., Johannes Köbler, & M. Mundhenk. (1996). Monotonous and randomized reductions to sparse sets. RAIRO - Theoretical Informatics and Applications. 30(2). 155–179. 1 indexed citations

10.

Arvind, V., Johannes Köbler, & M. Mundhenk. (1995). On reductions to sets that avoid EXPSPACE. Information Processing Letters. 56(2). 109–114. 1 indexed citations

11.

Arvind, V., Lane A. Hemachandra, Johannes Köbler, et al.. (1992). Reductions to sets of low information content. Lecture notes in computer science. 162–173. 19 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