| 181 |  | Daniel Binkele-Raible,
Ljiljana Brankovic,
Marek Cygan,
Henning Fernau,
Joachim Kneis,
Dieter Kratsch,
Alexander Langer,
Mathieu Liedloff,
Marcin Pilipczuk,
Peter Rossmanith,
Jakub Onufry Wojtaszczyk:
Breaking the 2n-barrier for Irredundance: Two lines of attack.
J. Discrete Algorithms 9(3): 214-230 (2011) |
| 180 |  | Henning Fernau,
Joachim Kneis,
Dieter Kratsch,
Alexander Langer,
Mathieu Liedloff,
Daniel Raible,
Peter Rossmanith:
An exact algorithm for the Maximum Leaf Spanning Tree problem.
Theor. Comput. Sci. 412(45): 6290-6302 (2011) |
| 178 |  | Daniel Binkele-Raible,
Ljiljana Brankovic,
Henning Fernau,
Joachim Kneis,
Dieter Kratsch,
Alexander Langer,
Mathieu Liedloff,
Peter Rossmanith:
A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance.
CIAC 2010: 311-322 |
| 159 |  | Henning Fernau,
Joachim Kneis,
Dieter Kratsch,
Alexander Langer,
Mathieu Liedloff,
Daniel Raible,
Peter Rossmanith:
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.
IWPEC 2009: 161-172 |
| 154 |  | Ljiljana Brankovic,
Henning Fernau,
Joachim Kneis,
Dieter Kratsch,
Alexander Langer,
Mathieu Liedloff,
Daniel Raible,
Peter Rossmanith:
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
CoRR abs/0909.4224: (2009) |