World's Best Scientists 2026 revealed!
Henning Fernau

Henning Fernau

D-Index & Metrics

Computer Science

D-Index
38
Citations
5526
World Ranking
10323
National Ranking
517

Mathematics

D-Index
38
Citations
5482
World Ranking
2370
National Ranking
146

Overview

Henning Fernau is affiliated with the University of Trier in Germany and has contributed extensively to the field of computer science. Their research primarily focuses on computational theory and mathematics, with further involvement in molecular biology and artificial intelligence. The breadth of their work spans over diverse subfields, including computer networks and communications as well as discrete mathematics and combinatorics.

Fernau's scholarly output includes numerous publications in both journals and books. Key papers authored or co-authored by them include:

  • Pattern Matching with Variables, 2020, ACM Transactions on Computation Theory
  • Improved descriptional complexity results on generalized forbidding grammars, 2021, Discrete Applied Mathematics

In addition to journal articles, Fernau has contributed to book publications with the publisher Springer Science+Business Media. Notable book titles include:

  • Combinatorial Algorithms, 2022
  • SOFSEM 2024: Theory and Practice of Computer Science, 2024
  • Fundamentals of Computation Theory, 2023
  • Computer Science - Theory and Applications, 2020

Their collaboration network features several frequent co-authors. These include Lakshmanan Kuppusamy, Petra Wolf, Kevin Mann, and Indhumathi Raman.

Fernau's common publication venues reflect a focus on theoretical and applied computer science, with frequent contributions to:

  • arXiv (Cornell University)
  • Theoretical Computer Science
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Acta Informatica
  • Algorithms

Their research topics cover a range of areas within algorithmic and theoretical computer science, including:

  • Semigroups and automata theory
  • Advanced graph theory research
  • DNA and biological computing
  • Algorithms and data compression
  • Complexity and algorithms in graphs
  • Graph labeling and dimension problems
  • Formal methods in verification

Henning Fernau has produced a significant body of work with 179 publications classified under computer science and 37 under biochemistry, genetics, and molecular biology. This multidisciplinary engagement illustrates an intersection between computational methods and biological applications. The presence of multiple works on topics such as DNA and biological computing highlights this cross-disciplinary approach.

Best Publications

  • Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs

    Jochen Alber;Hans L. Bodlaender;Henning Fernau;Ton Kloks

  • Parameterized complexity: exponential speed-up for planar graph problems

    Jochen Alber;Henning Fernau;Rolf Niedermeier

  • Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size

    Jianer Chen;Henning Fernau;Iyad A. Kanj;Ge Xia

  • Kernel(s) for problems with no kernel: On out-trees with many leaves

    Daniel Binkele-Raible;Henning Fernau;Fedor V. Fomin;Daniel Lokshtanov

  • A refined search tree technique for Dominating Set on planar graphs

    Jochen Alber;Hongbing Fan;Michael R. Fellows;Henning Fernau

  • Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves

    Henning Fernau;Fedor V. Fomin;Daniel Lokshtanov;Daniel Raible

  • Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems

    Jochen Alber;Hans L. Bodlaender;Henning Fernau;Rolf Niedermeier

  • Parameterized Algorithmics: A Graph-Theoretic Approach

    Henning Fernau

  • Vertex and edge covers with clustering properties: Complexity and algorithms

    Henning Fernau;David F. Manlove

  • Algorithms for learning regular expressions from positive data

    Henning Fernau

  • The differential and the roman domination number of a graph

    Sergio Bermudo;Henning Fernau;José M. Sigarreta

  • A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set

    Henning Fernau

  • Infinite Iterated Function Systems

    Henning Fernau

  • Graph separators: a parameterized view

    Jochen Alber;Henning Fernau;Rolf Niedermeier

  • An exact algorithm for the Maximum Leaf Spanning Tree problem

    Henning Fernau;Joachim Kneis;Dieter Kratsch;Alexander Langer

  • Edge dominating set : Efficient enumeration-based exact algorithms

    Henning Fernau

  • Refined Search Tree Technique for DOMINATING SET on Planar Graphs

    Jochen Alber;Hongbing Fan;Michael R. Fellows;Henning Fernau

  • Identification of function distinguishable languages

    Henning Fernau

  • An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

    Henning Fernau;Rolf Niedermeier

  • On Parameterized Enumeration

    Henning Fernau

  • Nonblocker: parameterized algorithmics for minimum dominating set

    Frank Dehne;Michael Fellows;Henning Fernau;Elena Prieto

Frequent Co-Authors

Rolf Niedermeier
Rolf Niedermeier Technical University of Berlin
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Fedor V. Fomin
Fedor V. Fomin University of Bergen
Dieter Kratsch
Dieter Kratsch University of Lorraine
Jianer Chen
Jianer Chen Texas A&M University
Michael Kaufmann
Michael Kaufmann University of Tübingen
Michael R. Fellows
Michael R. Fellows Lebanese American University
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Michael A. Langston
Michael A. Langston University of Tennessee at Knoxville

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can open up diverse career opportunities. Fields like marketing and business analytics increasingly rely on strong quantitative skills, making advanced degrees valuable complements to a math background.

Students interested in blending analytical skills with business strategy might consider pursuing a masters in marketing, which emphasizes data-driven decision-making and consumer insights. Another popular option is the best 1 year mba programs, designed to accelerate leadership skills alongside quantitative coursework.

Many online MBA programs offer flexibility to students through credit transfers, making it easy to build on prior coursework. This is especially beneficial for math graduates, who can leverage specialized knowledge when selecting programs with mba transfer credits policies.

Additionally, with the rise of big data, a masters data analytics degree offers an excellent path to apply mathematical expertise in extracting actionable insights across industries. Choosing the right program can enhance career prospects in tech, finance, and consulting.

Best Scientists Citing Henning Fernau

Trending Scientists

Recently Published Articles