Daniel Binkele-Raible

According to our database, Daniel Binkele-Raible authored at least 28 papers between 2005 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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

2013

Exact and Parameterized Algorithms for Max Internal Spanning Tree.

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff

Algorithmica, 2013

2012

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem.

Daniel Binkele-Raible, Henning Fernau

J. Discrete Algorithms, 2012

Parameterized Measure & Conquer for Problems with No Small Kernels.

Daniel Binkele-Raible, Henning Fernau

Algorithmica, 2012

An Exact Exponential Time Algorithm for Power Dominating Set.

Daniel Binkele-Raible, Henning Fernau

Algorithmica, 2012

2011

Breaking the 2ⁿ-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

2010

Exact exponential-time algorithms for finding bicliques.

Daniel Binkele-Raible, Henning Fernau, Serge Gaspers, Mathieu Liedloff

Inf. Process. Lett., 2010

An Amortized Search Tree Analysis for <i>k</i>-Leaf Spanning Tree.

Daniel Raible, Henning Fernau

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Enumerate and Measure: Improving Parameter Budget Management.

Daniel Binkele-Raible, Henning Fernau

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.

Daniel Binkele-Raible, Henning Fernau

Proceedings of the Computer Science, 2010

A Parameterized Route to Exact Puzzles: Breaking the 2^<i>n</i>-Barrier for Irredundance.

Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

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, Peter Rossmanith

CoRR, 2009

Exact and Parameterized Algorithms for Max Internal Spanning Tree.

Henning Fernau, Serge Gaspers, Daniel Raible

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Searching Trees: An Essay.

Henning Fernau, Daniel Raible

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

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

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.

Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Packing Paths: Recycling Saves Time.

Henning Fernau, Daniel Raible

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.

Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

The Complexity of Probabilistic Lobbying.

Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe

Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2008

Exact Exponential Time Algorithms for Max Internal Spanning Tree

Henning Fernau, Daniel Raible, Serge Gaspers, Alexey A. Stepanov

CoRR, 2008

A Parameterized Perspective on P₂-Packings

Jianer Chen, Henning Fernau, Dan Ning, Daniel Raible, Jianxin Wang

CoRR, 2008

Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.

Henning Fernau, Daniel Raible

Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach.

Daniel Raible, Henning Fernau

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Power Domination in O^*(1.7548ⁿ) Using Reference Search Trees.

Daniel Raible, Henning Fernau

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

A Parameterized Perspective on Packing Paths of Length Two.

Henning Fernau, Daniel Raible

Proceedings of the Combinatorial Optimization and Applications, 2008

2007

Alliances in Graphs: a Complexity-Theoretic Study.

Henning Fernau, Daniel Raible

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Exact Elimination of Cycles in Graphs.

Daniel Raible, Henning Fernau

Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007

2005

Improved Algorithms and Complexity Results for Power Domination in Graphs.

Jiong Guo, Rolf Niedermeier, Daniel Raible

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005