Fernau, Henning; V. Fomin, Fedor; Lokshtanov, Daniel et al.
Kernel(s) for Problems With no Kernel: On Out-Trees With Many LeavesCoRR. Bd. abs/0810.4796. 2008
Martín-Vide, Carlos; Otto, Friedrich; Fernau, Henning
Language and Automata Theory and Applications, Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised PapersSpringer 2008
Gulan, Stefan; Fernau, Henning
Local elimination-strategies in automata for shorter regular expressions.SOFSEM (2). 2008 S. 46 - 57
Fernau, Henning
Parameterized algorithmics for linear arrangement problems.Discret. Appl. Math. Bd. 156. H. 17. 2008 S. 3166 - 3177
Fernau, Henning
Parameterized Algorithms for Drawing Graphs.Encyclopedia of Algorithms. 2008
Raible, Daniel; Fernau, Henning
Power Domination in O(1.7548) Using Reference Search Trees.ISAAC. 2008 S. 136 - 147
Fernau, Henning
ROMAN DOMINATION: a parameterized perspective.Int. J. Comput. Math. Bd. 85. H. 1. 2008 S. 25 - 38
Fernau, Henning; Raible, Daniel
Alliances in Graphs: a Complexity-Theoretic Study.SOFSEM (2). 2007 S. 61 - 70
Dassow, Jürgen; Fernau, Henning
Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach.LATA. 2007 S. 249 - 260
Fernau, Henning; Reinhardt, Klaus; Staiger, Ludwig
Decidability of code properties.RAIRO Theor. Informatics Appl. Bd. 41. H. 3. 2007 S. 243 - 259