Fernau, Henning; L. Schmid, Markus; Villanger, Yngve
On the Parameterised Complexity of String Morphism Problems.FSTTCS. 2013 S. 55 - 66
Binkele-Raible, Daniel; Fernau, Henning
Packing paths: Recycling saves time.Discret. Appl. Math. Bd. 161. H. 12. 2013 S. 1686 - 1698
Fernau, Henning; L. Schmid, Markus
Pattern Matching with Variables: A Multivariate Complexity Analysis.CPM. 2013 S. 83 - 94
Fernau, Henning; L. Schmid, Markus; G. Subramanian, K.
Two-dimensional pattern languages.NCMA. 2013 S. 117 - 132
Binkele-Raible, Daniel; Fernau, Henning
An Exact Exponential Time Algorithm for Power Dominating Set.Algorithmica. Bd. 63. H. 1-2. 2012 S. 323 - 346
Binkele-Raible, Daniel; Fernau, Henning
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem.J. Discrete Algorithms. Bd. 15. 2012 S. 43 - 55
Bai, Guoqiang; Fernau, Henning
Constraint bipartite vertex cover: simpler exact algorithms and implementations.J. Comb. Optim. Bd. 23. H. 3. 2012 S. 331 - 355
Fernau, Henning
Cooperating Distributed Tree Automata.Languages Alive. 2012 S. 75 - 85
Fernau, Henning; Martín-Vide, Carlos
From the Guest Editors.J. Comput. Syst. Sci. Bd. 78. H. 6. 2012 S. 1793 - 1794
Binkele-Raible, Daniel; Fernau, Henning; V. Fomin, Fedor et al.
Kernel(s) for problems with no kernel: On out-trees with many leaves.ACM Trans. Algorithms. Bd. 8. H. 4. 2012 S. 38:1 - 38:19