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
Fernau, Henning; Alberto Rodríguez-Velázquez, Juan; María Sigarreta, José
Offensive r-alliances in graphs.Discret. Appl. Math. Bd. 157. H. 1. 2009 S. 177 - 182
María Sigarreta, José; Bermudo, Sergio; Fernau, Henning
On the complement graph and defensive k-alliances.Discret. Appl. Math. Bd. 157. H. 8. 2009 S. 1687 - 1695
Fernau, Henning; Raible, Daniel
Packing Paths: Recycling Saves Time.CTW. 2009 S. 79 - 83
Fernau, Henning; Raible, Daniel
Searching Trees: An Essay.TAMC. 2009 S. 59 - 70
Erdélyi, Gábor; Fernau, Henning; Goldsmith, Judy et al.
The Complexity of Probabilistic LobbyingCoRR. Bd. abs/0906.4431. 2009
Erdélyi, Gábor; Fernau, Henning; Goldsmith, Judy et al.
The Complexity of Probabilistic Lobbying.ADT. 2009 S. 86 - 97
Fernau, Henning; F. Manlove, David
Vertex and edge covers with clustering properties: Complexity and algorithms.J. Discrete Algorithms. Bd. 7. H. 2. 2009 S. 149 - 167
N. Abu-Khzam, Faisal; Fernau, Henning; A. Langston, Michael
A bounded search tree algorithm for parameterized face cover.J. Discrete Algorithms. Bd. 6. H. 4. 2008 S. 541 - 552
Raible, Daniel; Fernau, Henning
A New Upper Bound for Max-2-Sat: A Graph-Theoretic ApproachCoRR. Bd. abs/0803.3531. 2008