Miki Hermann
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Formal Methods in Verification
- Advanced Algebra and Logic
- semigroups and automata theory
Papers in
-
- semigroups and automata theory 8
- Advanced Algebra and Logic 6
- Advanced Graph Theory Research 5
- Formal Methods in Verification 5
- Rough Sets and Fuzzy Logic 3
-
- Logic, Reasoning, and Knowledge 11
- Logic, programming, and type systems 4
- Co-authors
- Nadia Creignou (4 shared papers)Arnaud Durand (5 shared papers)Phokion G. Kolaitis (3 shared papers)F. Brglez (2 shared papers)Ulf Schlichtmann (3 shared papers)Reinhard Pichler (2 shared papers)Gernot Salzer (4 shared papers)Andrei Krokhin (1 shared paper)
- Journals
- Theory of Computing Systems (3 papers)Theoretical Computer Science (2 papers)European Journal of Combinatorics (1 paper)Journal of Computer and System Sciences (1 paper)Discrete Mathematics (1 paper)
- Partner nations
- FranceAustriaUnited States
In The Last Decade
Miki Hermann
24 papers receiving 232 citations
Peers
Comparison fields: 5 of 29
- Computational Theory and Mathematics 185
- Discrete Mathematics and Combinatorics 15
- Software 16
- Statistics and Probability 32
- Artificial Intelligence 126
Countries citing papers authored by Miki Hermann
This map shows the geographic impact of Miki Hermann'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 Miki Hermann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Miki Hermann more than expected).
Fields of papers citing papers by Miki Hermann
This network shows the impact of papers produced by Miki Hermann. 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 Miki Hermann. The network helps show where Miki Hermann may publish in the future.
Co-authors
The 15 scholars most cited alongside Miki Hermann, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 24 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1996 | 107 | |
| 2 | 2000 | 36 | |
| 3 | 1992 | 26 | |
| 4 | 1997 | 9 | |
| 5 | 2007 | 8 | |
| 6 | Counting complexity of propositional abduction | 2007 | 7 |
| 7 | 2009 | 7 | |
| 8 | 2007 | 6 | |
| 9 | 2007 | 6 | |
| 10 | 1995 | 5 | |
| 11 | 1991 | 5 | |
| 12 | On P completeness of some counting problems | 1993 | 5 |
| 13 | 2018 | 3 | |
| 14 | 2009 | 3 | |
| 15 | 2008 | 3 | |
| 16 | 2003 | 3 | |
| 17 | 1990 | 2 | |
| 18 | 1999 | 2 | |
| 19 | 2017 | 2 | |
| 20 | 2002 | 2 |
About Miki Hermann
Miki Hermann is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Molecular Biology and Signal Processing, having authored 24 papers that have together received 252 indexed citations. Recurring topics across this work include Logic, Reasoning, and Knowledge (11 papers), semigroups and automata theory (8 papers), Advanced Algebra and Logic (6 papers), Advanced Graph Theory Research (5 papers), Formal Methods in Verification (5 papers), Logic, programming, and type systems (4 papers), Rough Sets and Fuzzy Logic (3 papers) and Constraint Satisfaction and Optimization (3 papers). The work is most often cited by research in Computational Theory and Mathematics (185 citations), Discrete Mathematics and Combinatorics (15 citations), Software (16 citations), Statistics and Probability (32 citations) and Artificial Intelligence (126 citations). Miki Hermann has collaborated with scholars based in France, Austria and United States. Frequent co-authors include Nadia Creignou, Arnaud Durand, Phokion G. Kolaitis, F. Brglez, Ulf Schlichtmann, Reinhard Pichler, Gernot Salzer, Andrei Krokhin, Bruno Zanuttini and Андрей Воронков. Their work appears in journals such as Theory of Computing Systems, Theoretical Computer Science, European Journal of Combinatorics, Journal of Computer and System Sciences and Discrete Mathematics.
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.