1. A faster exact algorithm for the directed maximum leaf spanning tree problem;Binkele-Raible,2010
2. A parameterized route to exact puzzles: Breaking the 2n-barrier for irredundance;Binkele-Raible,2010
3. Breaking the 2n-barrier for Irredundance: Two lines of attack;Binkele-Raible;Journal of Discrete Algorithms,2011
4. Tight bounds and a fast FPT algorithm for Directed Max-Leaf Spanning Tree;Bonsma;ACM Transactions on Algorithms,2011
5. A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs;Bonsma,2008