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
Chen, Jianer; Fernau, Henning; Shaw, Peter et al.
Kernels for Packing and Covering Problems - (Extended Abstract).FAW-AAIM. 2012 S. 199 - 211
Bermudo, Sergio; Fernau, Henning
Lower bounds on the differential of a graph.Discrete Mathematics. Bd. 312. H. 22. 2012 S. 3236 - 3250
Costa Florêncio, Christophe; Fernau, Henning
On families of categorial grammars of bounded value, their learnability and related complexity questions.Theor. Comput. Sci. Bd. 452. 2012 S. 21 - 38
Binkele-Raible, Daniel; Fernau, Henning
Parameterized Measure & Conquer for Problems with No Small Kernels.Algorithmica. Bd. 64. H. 1. 2012 S. 189 - 212
Fernau, Henning
Saving on Phases: Parameterized Approximation for Total Vertex Cover.IWOCA. 2012 S. 20 - 31
Fernau, Henning; Kneis, Joachim; Kratsch, Dieter et al.
An exact algorithm for the Maximum Leaf Spanning Tree problem.Theor. Comput. Sci. Bd. 412. H. 45. 2011 S. 6290 - 6302
Binkele-Raible, Daniel; Brankovic, Ljiljana; Cygan, Marek et al.
Breaking the 2-barrier for Irredundance: Two lines of attack.J. Discrete Algorithms. Bd. 9. H. 3. 2011 S. 214 - 230
N. Abu-Khzam, Faisal; Fernau, Henning; A. Langston, Michael et al.
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction.Discrete Optimization. Bd. 8. H. 1. 2011 S. 41 - 49