Fernau, Henning; V. Fomin, Fedor; Lokshtanov, Daniel et al.
Ranking and Drawing in Subexponential Time.IWOCA. 2010 S. 337 - 348
Fernau, Henning; V. Fomin, Fedor; Philip, Geevarghese et al.
The Curse of Connectivity: -Total Vertex (Edge) Cover.COCOON. 2010 S. 34 - 43
Raible, Daniel; Fernau, Henning
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree ProblemCoRR. Bd. abs/0911.1900. 2009
Fernau, Henning; Raible, Daniel
A parameterized perspective on packing paths of length two.J. Comb. Optim. Bd. 18. H. 4. 2009 S. 319 - 341
Fernau, Henning
Algorithms for learning regular expressions from positive data.Inf. Comput. Bd. 207. H. 4. 2009 S. 521 - 541
Fernau, Henning; Kneis, Joachim; Kratsch, Dieter et al.
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.IWPEC. 2009 S. 161 - 172
Brankovic, Ljiljana; Fernau, Henning; Kneis, Joachim et al.
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact PuzzlesCoRR. Bd. abs/0909.4224. 2009
Fernau, Henning; Gaspers, Serge; Raible, Daniel
Exact and Parameterized Algorithms for Max Internal Spanning Tree.WG. 2009 S. 100 - 111
Fernau, Henning; Gaspers, Serge; Kratsch, Dieter et al.
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.CTW. 2009 S. 205 - 209
Fernau, Henning; V. Fomin, Fedor; Lokshtanov, Daniel et al.
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.STACS. 2009 S. 421 - 432