Daniel Binkele-Raible

Available identifiers

Publication	Date of Publication	Type
The complexity of probabilistic lobbying	2018-08-17	Paper
Kernel(s) for problems with no kernel	2014-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q5413909	2014-05-02	Paper
Packing paths: recycling saves time	2014-04-16	Paper
Exact exponential-time algorithms for finding bicliques	2013-04-04	Paper
Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}	2013-03-05	Paper
Parameterized measure \& conquer for problems with no small kernels	2012-11-21	Paper
An exact exponential-time algorithm for the directed maximum leaf spanning tree problem	2012-09-13	Paper
An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}	2012-04-26	Paper
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack	2011-08-23	Paper
A new upper bound for Max-2-SAT: A graph-theoretic approach	2011-01-20	Paper
Enumerate and Measure: Improving Parameter Budget Management	2010-12-07	Paper
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem	2010-06-22	Paper
A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance	2010-05-28	Paper

This page was built for person: Daniel Binkele-Raible