Bart Jansen, Utrecht University Bart Jansen, Utrecht University * Max Leaf Instance: Connected graph G, positive integer k Question: Is there a spanning tree for G with at…
Fixed parameter tractability and kernelization for the White-Black Max-Leaf Spanning Tree problem Fixed parameter tractability and kernelization for the Black-White Max-Leaf…
PowerPoint presentation Information and Computing Sciences Bart M. P. Jansen Kernelization Lower Bounds WorKer 2010, Leiden Review of existing techniques and the introduction…
Fixed parameter tractability and kernelization for the White-Black Max-Leaf Spanning Tree problem Fixed parameter tractability and kernelization for the Black-White Max-Leaf…
Polynomial Time Approximation Schemes and Parameterized Complexity Jianer Chen Texas A&M University Joint work with Xiuzhen Huang, Ge Xia, and I. Kanj Approximation Algorithms…