Parameterized complexity of generalized vertex cover problems (2005)

Cached

Download Links

by Jiong Guo , Rolf Niedermeier , Sebastian Wernicke
Venue:In Proc. 9th WADS, volume 3608 of LNCS
Citations:19 - 2 self

Documents Related by Co-Citation

894 Parameterized Complexity – Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen - 1998
367 Parameterized Complexity Theory – J Flum, M Grohe - 2006
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
35 Parametric duality and kernelization: lower bounds and upper bounds on kernel size – Jianer Chen, Henning Fernau, Iyad A. Kanj, Ge Xia - 2005
189 D.S.: The rectilinear Steiner tree problem is NP complete – M R Garey, Johnson - 1977
19 The undirected feedback vertex set problem has a poly(k) kernel – K Burrage, V Estivill-Castro, M R Fellows, M A Langston, S Mac, F A Rosamond
21 A cubic kernel for feedback vertex set – Hans L. Bodlaender - 2006
311 Approximation algorithms for NP-complete problems on planar graphs,Vroc. 24th Ann – B S Baker - 1983
907 Approximation Algorithms – V V Vazirani - 2001
293 Invitation to Fixed-Parameter Algorithms – Rolf Niedermeier - 2002
22 Parameterized algorithms: A graph-theoretic approach – H Fernau - 2005
87 Invitation to data reduction and problem kernelization – J Guo, R Niedermeier
24 Graph-modeled data clustering: Exact algorithms for clique generation – J Gramm, J Guo, F Huffner, R Niedermeier
27 Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications – R Niedermeier - 2006
10 Computing small partial coverings – M Bläser
682 Approximation Algorithms for Combinatorial Problems – D S Johnson - 1974
14 Measure and conquer: A simple O(2 0.288 n ) independent set algorithm – F V Fomin, F Grandoni, D Kratsch - 2006
29 An o(2 O(k) n 3 ) fpt algorithm for the undirected feedback vertex set problem – F K H A Dehne, M R Fellows, M A Langston, F A Rosamond, K Stevens
15 Finding a minimum feedback vertex set in time O(1.7548 n – Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin - 2006