DBDaniel Binkele-Raible
Daniel Binkele-Raible
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Daniel Binkele-Raible has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Henning Fernau
Universität Trier
7 shared publications - Mathieu Liedloff
Université d’Orléans
2 shared publications - Serge Gaspers
INSTITUTE OF INFORMATION SYSTEMS VIENNA UNIVERSITY OF TECHNOLOGY VIENNA AUSTRIA
2 shared publications - Alexander Langer
Computer Science, RWTH Aachen University, Germany
1 shared publication - Dieter Kratsch
Université de Lorraine
1 shared publication - Joachim Kneis
Department of Computer Science, RWTH Aachen University, Germany
1 shared publication
Latest Publications
- 28 March 2012
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 15, 43-55
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
- 28 March 2012
- Published by Elsevier in Journal of Discrete Algorithms
- Vol. 15, 43-55
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
- 30 September 2011
- Published by Springer Nature in Algorithmica
- Vol. 65 (1) , 95-128
Exact and Parameterized Algorithms for Max Internal Spanning Tree
- 30 September 2011
- Published by Springer Nature in Algorithmica
- Vol. 65 (1) , 95-128
Exact and Parameterized Algorithms for Max Internal Spanning Tree
- 14 September 2011
- Published by Springer Nature in Algorithmica
- Vol. 64 (1) , 189-212
Parameterized Measure & Conquer for Problems with No Small Kernels
- 14 September 2011
- Published by Springer Nature in Algorithmica
- Vol. 64 (1) , 189-212
Parameterized Measure & Conquer for Problems with No Small Kernels
- 28 July 2011
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (45) , 6290-6302
An exact algorithm for the Maximum Leaf Spanning Tree problem
- 28 July 2011
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (45) , 6290-6302
An exact algorithm for the Maximum Leaf Spanning Tree problem
- 8 June 2011
- Published by Springer Nature in Algorithmica
- Vol. 63 (1) , 323-346
An Exact Exponential Time Algorithm for Power Dominating Set
- 8 June 2011
- Published by Springer Nature in Algorithmica
- Vol. 63 (1) , 323-346
An Exact Exponential Time Algorithm for Power Dominating Set
- 29 October 2010
- Published by Elsevier in Information Processing Letters
- Vol. 111 (2) , 64-67
Exact exponential-time algorithms for finding bicliques
- 29 October 2010
- Published by Elsevier in Information Processing Letters
- Vol. 111 (2) , 64-67
Exact exponential-time algorithms for finding bicliques
- 23 May 2009
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 18 (4) , 319-341
A parameterized perspective on packing paths of length two
- 23 May 2009
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 18 (4) , 319-341
A parameterized perspective on packing paths of length two