| 2009 |
|---|
| 13 | EE | Henning Fernau,
Fedor V. Fomin,
Daniel Lokshtanov,
Daniel Raible,
Saket Saurabh,
Yngve Villanger:
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.
STACS 2009: 421-432 |
| 2008 |
|---|
| 12 | EE | Henning Fernau,
Daniel Raible:
A Parameterized Perspective on Packing Paths of Length Two.
COCOA 2008: 54-63 |
| 11 | EE | Daniel Raible,
Henning Fernau:
Power Domination in O*(1.7548n) Using Reference Search Trees.
ISAAC 2008: 136-147 |
| 10 | EE | Daniel Raible,
Henning Fernau:
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach.
MFCS 2008: 551-562 |
| 9 | EE | Henning Fernau,
Daniel Raible:
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.
WALCOM 2008: 144-156 |
| 8 | EE | Jiong Guo,
Rolf Niedermeier,
Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs.
Algorithmica 52(2): 177-202 (2008) |
| 7 | EE | Daniel Raible,
Henning Fernau:
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
CoRR abs/0803.3531: (2008) |
| 6 | EE | Jianer Chen,
Henning Fernau,
Dan Ning,
Daniel Raible,
Jianxin Wang:
A Parameterized Perspective on P2-Packings
CoRR abs/0804.0570: (2008) |
| 5 | EE | Henning Fernau,
Fedor V. Fomin,
Daniel Lokshtanov,
Daniel Raible,
Saket Saurabh,
Yngve Villanger:
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves
CoRR abs/0810.4796: (2008) |
| 4 | EE | Henning Fernau,
Daniel Raible,
Serge Gaspers,
Alexey A. Stepanov:
Exact Exponential Time Algorithms for Max Internal Spanning Tree
CoRR abs/0811.1875: (2008) |
| 2007 |
|---|
| 3 | | Henning Fernau,
Daniel Raible:
Alliances in Graphs: a Complexity-Theoretic Study.
SOFSEM (2) 2007: 61-70 |
| 2 | EE | Daniel Raible,
Henning Fernau:
Exact Elimination of Cycles in Graphs.
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 |
| 2005 |
|---|
| 1 | EE | Jiong Guo,
Rolf Niedermeier,
Daniel Raible:
Improved Algorithms and Complexity Results for Power Domination in Graphs.
FCT 2005: 172-184 |
