Daniel Binkele-Raible

  • University of Trier, Department of Computer Science, Germany

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph.
Discret. Math. Theor. Comput. Sci., 2014

The complexity of probabilistic lobbying.
Discret. Optim., 2014

Packing paths: Recycling saves time.
Discret. Appl. Math., 2013

Exact and Parameterized Algorithms for Max Internal Spanning Tree.
Algorithmica, 2013

Kernel(s) for problems with no kernel: On out-trees with many leaves.
ACM Trans. Algorithms, 2012

An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem.
J. Discrete Algorithms, 2012

Parameterized Measure & Conquer for Problems with No Small Kernels.
Algorithmica, 2012

An Exact Exponential Time Algorithm for Power Dominating Set.
Algorithmica, 2012

An exact algorithm for the Maximum Leaf Spanning Tree problem.
Theor. Comput. Sci., 2011

Breaking the 2<sup>n</sup>-barrier for Irredundance: Two lines of attack.
J. Discrete Algorithms, 2011

A new upper bound for Max-2-SAT: A graph-theoretic approach.
J. Discrete Algorithms, 2010

Exact exponential-time algorithms for finding bicliques.
Inf. Process. Lett., 2010

An Amortized Search Tree Analysis for <i>k</i>-Leaf Spanning Tree.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Enumerate and Measure: Improving Parameter Budget Management.
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem.
Proceedings of the Computer Science, 2010

A Parameterized Route to Exact Puzzles: Breaking the 2<sup><i>n</i></sup>-Barrier for Irredundance.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

A parameterized perspective on packing paths of length two.
J. Comb. Optim., 2009

Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
CoRR, 2009

Exact and Parameterized Algorithms for Max Internal Spanning Tree.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Searching Trees: An Essay.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

Exact Exponential Time Algorithms for Max Internal Spanning Tree
CoRR, 2008

A Parameterized Perspective on P<sub>2</sub>-Packings
CoRR, 2008

Improved Algorithms and Complexity Results for Power Domination in Graphs.
Algorithmica, 2008

Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.
Proceedings of the WALCOM: Algorithms and Computation, Second International Workshop, 2008

Power Domination in O<sup>*</sup>(1.7548<sup>n</sup>) Using Reference Search Trees.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Alliances in Graphs: a Complexity-Theoretic Study.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

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