Henning Fernau
- Computational Theory and Mathematics top 0.5%
- semigroups and automata theory 72
- Advanced Graph Theory Research 61
- Complexity and Algorithms in Graphs 44
- Graph Labeling and Dimension Problems 21
-
- Optimization and Search Problems 15
- Artificial Intelligence top 5%
- Algorithms and Data Compression 56
- Machine Learning and Algorithms 16
-
- DNA and Biological Computing 60
- Co-authors
- Rolf NiedermeierSergio BermudoJochen AlberJosé M. SigarretaTon KloksHans L. BodlaenderDaniel RaibleJuan A. Rodríguez‐Velázquez
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
In The Last Decade
Henning Fernau
172 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 65
- Computational Theory and Mathematics 1.0k
- Discrete Mathematics and Combinatorics 70
- Computer Graphics and Computer-Aided Design 65
- Computer Networks and Communications 354
- Artificial Intelligence 394
Countries citing papers authored by Henning Fernau
This map shows the geographic impact of Henning Fernau'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 Henning Fernau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Henning Fernau more than expected).
Fields of papers citing papers by Henning Fernau
This network shows the impact of papers produced by Henning Fernau. 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 Henning Fernau. The network helps show where Henning Fernau may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Henning Fernau, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2025 | 0 | |
| 2 | 2024 | 0 | |
| 3 | 2023 | 0 | |
| 4 | 2023 | 0 | |
| 5 | 2023 | 0 | |
| 6 | 2022 | 4 | |
| 7 | 2020 | 1 | |
| 8 | A fixed-parameter algorithm for string-to-string correction | 2010 | 1 |
| 9 | Local elimination-strategies in automata for shorter regular expressions. | 2008 | 5 |
| 10 | Blind Counter Automata on ω-Words | 2008 | 2 |
| 11 | 2008 | 2 | |
| 12 | Alliances in Graphs: a Complexity-Theoretic Study. | 2007 | 16 |
| 13 | Refining the Nonterminal Complexity of Graph-controlled Grammars. | 2005 | 3 |
| 14 | Complexity of a {0, 1}-matrix problem. | 2004 | 2 |
| 15 | Fixed parameter algorithms for planar dominating set | 2000 | 1 |
| 16 | How powerful is unconditional transfer? -When UT meets AC.- | 1997 | 1 |
| 17 | Accepting Multi-Agent Systems | 1996 | 1 |
| 18 | Closure Properties of Ordered Languages. | 1996 | 4 |
| 19 | Accepting multi-agent systems II | 1996 | 5 |
| 20 | Accepting Grammars and Systems: An Overview. | 1995 | 2 |
About Henning Fernau
Henning Fernau is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Graphics and Computer-Aided Design, having authored 190 papers that have together received 1.3k indexed citations. Recurring topics across this work include semigroups and automata theory (72 papers), Advanced Graph Theory Research (61 papers), DNA and Biological Computing (60 papers), Algorithms and Data Compression (56 papers), Complexity and Algorithms in Graphs (44 papers), Graph Labeling and Dimension Problems (21 papers), Machine Learning and Algorithms (16 papers) and Optimization and Search Problems (15 papers). The work is most often cited by research in Computational Theory and Mathematics (1.0k citations), Discrete Mathematics and Combinatorics (70 citations) and Computer Graphics and Computer-Aided Design (65 citations). Henning Fernau has collaborated with scholars based in Germany, Australia and France. Frequent co-authors include Rolf Niedermeier, Sergio Bermudo, Jochen Alber, José M. Sigarreta, Ton Kloks, Hans L. Bodlaender, Daniel Raible, Juan A. Rodríguez‐Velázquez, Yngve Villanger and Jianer Chen. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.
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.