1. Amortized Analysis of Exponential Time and Parameterized Algorithms: Measure & Conquer and Reference Search Trees;Binkele-Raible,2010
2. A parameterized measure-and-conquer analysis for finding a k-leaf spanning tree in an undirected graph;Binkele-Raible;Discrete Math. Theor. Comput. Sci.,2014
3. Exact and parameterized algorithms for max internal spanning tree;Binkele-Raible;Algorithmica,2013
4. Connected dominating set in sensor networks and MANETs;Blum;Handb. Comb. Optim. B,2005
5. On linear time minor tests and depth-first search;Bodlaender,1989