Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems Faisal N. Abu-Khzam OriginalPaper Pages: 399 - 410
Crown Structures for Vertex Cover Kernelization Faisal N. Abu-KhzamMichael R. FellowsW. Henry Suters OriginalPaper Pages: 411 - 430
The Parameterized Approximability of TSP with Deadlines Hans-Joachim BockenhauerJuraj HromkovicJoachim Kupke OriginalPaper Pages: 431 - 444
The Complexity of Polynomial-Time Approximation Liming CaiMichael FellowsFrances Rosamond OriginalPaper Pages: 459 - 477
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem Frank DehneMichael FellowsKim Stevens OriginalPaper Pages: 479 - 492
Parameterized Complexity of Vertex Cover Variants Jiong GuoRolf NiedermeierSebastian Wernicke OriginalPaper Pages: 501 - 520
The Linear Arrangement Problem Parameterized Above Guaranteed Value Gregory GutinArash RafieyAnders Yeo OriginalPaper Pages: 521 - 538
A Faster FPT Algorithm for the Maximum Agreement Forest Problem Michael HallettCatherine McCartin OriginalPaper Pages: 539 - 550
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques Venkatesh RamanSaket SaurabhSomnath Sikdar OriginalPaper Pages: 563 - 587