PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Binkele-Raible, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Exact exponential-time algorithms for finding bicliques.

, , , and . Inf. Process. Lett., 111 (2): 64-67 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Julian Raible University of Stuttgart

Susanne Raible University of Stuttgart

Dr. Peter Binkele University of Stuttgart

Daniel Holder University of Stuttgart

Daniel Sollich University of Stuttgart

 

Other publications of authors with the same name

Exact exponential-time algorithms for finding bicliques., , , and . Inf. Process. Lett., 111 (2): 64-67 (2010)Enumerate and Measure: Improving Parameter Budget Management., and . IPEC, volume 6478 of Lecture Notes in Computer Science, page 38-49. Springer, (2010)Packing paths: Recycling saves time., and . Discrete Applied Mathematics, 161 (12): 1686-1698 (2013)Exact and Parameterized Algorithms for Max Internal Spanning Tree., , , and . Algorithmica, 65 (1): 95-128 (2013)Parameterized Measure & Conquer for Problems with No Small Kernels., and . Algorithmica, 64 (1): 189-212 (2012)A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph., and . Discrete Mathematics & Theoretical Computer Science, 16 (1): 179-200 (2014)The complexity of probabilistic lobbying., , , , , and . Discrete Optimization, (2014)A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem., and . CSR, volume 6072 of Lecture Notes in Computer Science, page 328-339. Springer, (2010)A Parameterized Route to Exact Puzzles: Breaking the 2n-Barrier for Irredundance., , , , , , , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 311-322. Springer, (2010)An Exact Exponential Time Algorithm for Power Dominating Set., and . Algorithmica, 63 (1-2): 323-346 (2012)