Daniel Raible

Publication Activity (10 Years)

Years Active: 2005-2011
Publications (10 Years): 0

Publications

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) (2011)
Daniel Raible, Henning Fernau
-Leaf Spanning Tree. SOFSEM (2010)
Henning Fernau, Daniel Raible
Packing Paths: Recycling Saves Time. CTW (2009)
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)
Henning Fernau, Serge Gaspers, Daniel Raible
Exact and Parameterized Algorithms for Max Internal Spanning Tree. WG (2009)
Daniel Raible, Henning Fernau
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem CoRR (2009)
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 (2009)
Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible
Exact Exponential-Time Algorithms for Finding Bicliques in a Graph. CTW (2009)
Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
The Complexity of Probabilistic Lobbying CoRR (2009)
Henning Fernau, Daniel Raible
Searching Trees: An Essay. TAMC (2009)
Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe
The Complexity of Probabilistic Lobbying. ADT (2009)
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)
Henning Fernau, Daniel Raible
A parameterized perspective on packing paths of length two. J. Comb. Optim. 18 (4) (2009)
Daniel Raible, Henning Fernau
) Using Reference Search Trees. ISAAC (2008)
Jiong Guo, Rolf Niedermeier, Daniel Raible
Improved Algorithms and Complexity Results for Power Domination in Graphs. Algorithmica 52 (2) (2008)
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 (2008)
Daniel Raible, Henning Fernau
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach CoRR (2008)
Daniel Raible, Henning Fernau
A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach. MFCS (2008)
Henning Fernau, Daniel Raible
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs. WALCOM (2008)
Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov
Exact Exponential Time Algorithms for Max Internal Spanning Tree CoRR (2008)
Henning Fernau, Daniel Raible
A Parameterized Perspective on Packing Paths of Length Two. COCOA (2008)
Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang
-Packings CoRR (2008)
Daniel Raible, Henning Fernau
Exact Elimination of Cycles in Graphs. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs (2007)
Henning Fernau, Daniel Raible
Alliances in Graphs: a Complexity-Theoretic Study. SOFSEM (2) (2007)
Jiong Guo, Rolf Niedermeier, Daniel Raible
Improved Algorithms and Complexity Results for Power Domination in Graphs. FCT (2005)