Exact Elimination of Cycles in Graphs. - Daniel Raible 001; Henning Fernau (Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 2007)

Alliances in Graphs: a Complexity-Theoretic Study. - Henning Fernau; Daniel Raible 001 (SOFSEM (2), 2007)

Power Domination in O*(1.7548n) Using Reference Search Trees. - Daniel Raible 001; Henning Fernau (ISAAC, 2008)

Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. - Henning Fernau; Daniel Raible 001 (WALCOM, 2008)

Improved Algorithms and Complexity Results for Power Domination in Graphs. - Jiong Guo; Rolf Niedermeier; Daniel Raible 001 (Algorithmica, 2008)

A Parameterized Perspective on P2-Packings - Jianer Chen; Henning Fernau; Dan Ning; Daniel Raible 001; Jianxin Wang 001 (CoRR, 2008)

Exact Exponential Time Algorithms for Max Internal Spanning Tree - Henning Fernau; Daniel Raible 001; Serge Gaspers; Alexey A. Stepanov (CoRR, 2008)

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. - Henning Fernau; Serge Gaspers; Dieter Kratsch; Mathieu Liedloff; Daniel Raible 001 (CTW, 2009)

Searching Trees: An Essay. - Henning Fernau; Daniel Raible 001 (TAMC, 2009)

Exact and Parameterized Algorithms for Max Internal Spanning Tree. - Henning Fernau; Serge Gaspers; Daniel Raible 001 (WG, 2009)

Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles - Ljiljana Brankovic; Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Daniel Raible 001; Peter Rossmanith (CoRR, 2009)

A parameterized perspective on packing paths of length two. - Henning Fernau; Daniel Raible 001 (J. Comb. Optim., 2009)

A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance. - Daniel Binkele-Raible; Ljiljana Brankovic; Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Peter Rossmanith (CIAC, 2010)

A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem. - Daniel Binkele-Raible; Henning Fernau (CSR, 2010)

Enumerate and Measure: Improving Parameter Budget Management. - Daniel Binkele-Raible; Henning Fernau (IPEC, 2010)

An Amortized Search Tree Analysis for k-Leaf Spanning Tree. - Daniel Raible 001; Henning Fernau (SOFSEM, 2010)

Exact exponential-time algorithms for finding bicliques. - Daniel Binkele-Raible; Henning Fernau; Serge Gaspers; Mathieu Liedloff (Inf. Process. Lett., 2010)

A new upper bound for Max-2-SAT: A graph-theoretic approach. - Daniel Binkele-Raible; Henning Fernau (J. Discrete Algorithms, 2010)

Breaking the 2n-barrier for Irredundance: Two lines of attack. - Daniel Binkele-Raible; Ljiljana Brankovic; Marek Cygan; Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Marcin Pilipczuk; Peter Rossmanith; Jakub Onufry Wojtaszczyk (J. Discrete Algorithms, 2011)

An exact algorithm for the Maximum Leaf Spanning Tree problem. - Henning Fernau; Joachim Kneis; Dieter Kratsch; Alexander Langer; Mathieu Liedloff; Daniel Raible 001; Peter Rossmanith (Theor. Comput. Sci., 2011)

An Exact Exponential Time Algorithm for Power Dominating Set. - Daniel Binkele-Raible; Henning Fernau (Algorithmica, 2012)

Parameterized Measure & Conquer for Problems with No Small Kernels. - Daniel Binkele-Raible; Henning Fernau (Algorithmica, 2012)

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem. - Daniel Binkele-Raible; Henning Fernau (J. Discrete Algorithms, 2012)

Kernel(s) for problems with no kernel: On out-trees with many leaves. - Daniel Binkele-Raible; Henning Fernau; Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Yngve Villanger (ACM Trans. Algorithms, 2012)

Exact and Parameterized Algorithms for Max Internal Spanning Tree. - Daniel Binkele-Raible; Henning Fernau; Serge Gaspers; Mathieu Liedloff (Algorithmica, 2013)

Packing paths: Recycling saves time. - Daniel Binkele-Raible; Henning Fernau (Discret. Appl. Math., 2013)

The complexity of probabilistic lobbying. - Daniel Binkele-Raible; Gábor Erdélyi; Henning Fernau; Judy Goldsmith; Nicholas Mattei; Jörg Rothe (Discret. Optim., 2014)

A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph. - Daniel Binkele-Raible; Henning Fernau (Discret. Math. Theor. Comput. Sci., 2014)