Fernau, Henning; L. Schmid, Markus; Villanger, Yngve
On the Parameterised Complexity of String Morphism Problems.Theory Comput. Syst. Bd. 59. H. 1. 2016 S. 24 - 51
Fernau, Henning
Parameterized Algorithms for Drawing Graphs.Encyclopedia of Algorithms. 2016 S. 1520 - 1525
Fernau, Henning; Paramasivan, Meenakshi; Gnanaraj Thomas, D.
Picture Scanning Automata.CompIMAGE. 2016 S. 132 - 147
Björklund, Johanna; Fernau, Henning; Kasprzik, Anna
Polynomial inference of universal automata from membership and equivalence queries.Inf. Comput. Bd. 246. 2016 S. 3 - 19
Fernau, Henning; Krebs, Andreas
Problems on Finite Automata and the Exponential Time Hypothesis.CIAA. 2016 S. 89 - 100
Fernau, Henning
Theorietage der Gesellschaft für Informatik in Speyer 2015 - Special Issue.Algorithms. Bd. 9. H. 4. 2016 S. 64
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.
Upper Domination: Complexity and Approximation.IWOCA. 2016 S. 241 - 252
Casel, Katrin; Estrada-Moreno, Alejandro; Fernau, Henning et al.
Weak total resolvability in graphs.Discuss. Math. Graph Theory. Bd. 36. H. 1. 2016 S. 185 - 210
Fernau, Henning; Heggernes, Pinar; Villanger, Yngve
A multi-parameter analysis of hard problems on deterministic finite automata.J. Comput. Syst. Sci. Bd. 81. H. 4. 2015 S. 747 - 765
Bazgan, Cristina; Brankovic, Ljiljana; Casel, Katrin et al.
Algorithmic Aspects of Upper Domination.CoRR. Bd. abs/1506.07260. 2015