| 2010 | SOFSEM | An Amortized Search Tree Analysis for | Daniel Raible, Henning Fernau |
| 2009 | STACS | Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. | Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger |
| 2009 | TAMC | Searching Trees: An Essay. | Henning Fernau, Daniel Raible |
| 2009 | WG | Exact and Parameterized Algorithms for Max Internal Spanning Tree. | Henning Fernau, Serge Gaspers, Daniel Raible |
| 2008 | COCOA | A Parameterized Perspective on Packing Paths of Length Two. | Henning Fernau, Daniel Raible |
| 2008 | ISAAC | Power Domination in O | Daniel Raible, Henning Fernau |
| 2008 | MFCS | A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. | Daniel Raible, Henning Fernau |
| 2008 | WALCOM | Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. | Henning Fernau, Daniel Raible |
| 2007 | SOFSEM | Alliances in Graphs: a Complexity-Theoretic Study. | Henning Fernau, Daniel Raible |
| 2005 | FCT | Improved Algorithms and Complexity Results for Power Domination in Graphs. | Jiong Guo, Rolf Niedermeier, Daniel Raible |