This map shows the geographic impact of Markus Holzer'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 Markus Holzer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Markus Holzer more than expected).
This network shows the impact of papers produced by Markus Holzer. 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 Markus Holzer. The network helps show where Markus Holzer may publish in the future.
Co-authorship network of co-authors of Markus Holzer
This figure shows the co-authorship network connecting the top 25 collaborators of Markus Holzer.
A scholar is included among the top collaborators of Markus Holzer 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 Markus Holzer. Markus Holzer is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bordihn, Henning, Markus Holzer, & Martin Kutrib. (2008). State Complexity of NFA to DFA Conversion of Subregular Language Families.. 85–96.
9.
Gruber, Hermann & Markus Holzer. (2008). Language Operations with Regular Expressions of Polynomial Size.. 182–193.
10.
Gruber, Hermann & Markus Holzer. (2007). Computational Complexity of NFA Minimization for Finite and Unary Languages.. 261–272.11 indexed citations
11.
Gruber, Hermann & Markus Holzer. (2006). Finding lower bounds for nondeterministic state complexity is hard : (Extended abstract). 363–374.5 indexed citations
12.
Holzer, Markus, et al.. (2005). Descriptional Complexity of Deterministic Restarting Automata.. 158–169.2 indexed citations
13.
Holzer, Markus & Barbara König. (2004). Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory).. Bulletin of the European Association for Theoretical Computer Science. 83. 139–155.
Fernau, Henning, et al.. (1998). The Generative Power of d -Dimensional #-Context-Free Array Grammars.. 43–56.1 indexed citations
16.
Fernau, Henning, et al.. (1997). Bounding resources in Cooperating Distributed Grammar Systems.. 261–272.6 indexed citations
17.
Fernau, Henning, Markus Holzer, & Henning Bordihn. (1996). Accepting Multi-Agent Systems. Computing and Informatics / Computers and Artificial Intelligence. 15. 123–139.1 indexed citations
18.
Fernau, Henning & Markus Holzer. (1996). Accepting multi-agent systems II. Acta Cybernetica. 12(4). 361–379.5 indexed citations
19.
Holzer, Markus. (1995). On Emptiness and Counting for Alternating Finite Automata.. 88–97.11 indexed citations
20.
Damm, Carsten, Markus Holzer, Klaus-Jörn Lange, & Peter Rossmanith. (1993). Deterministic OL Languages are of Very Low Complexity: DOL is in AC 0 .. 305–313.2 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.