Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

97

Voted

CORR
2010
Springer

138views Education» more CORR 2010»

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

14 years 11 months ago

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

Download drops.dagstuhl.de

Bart M. P. Jansen, Hans L. Bodlaender

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» CrossComposition A New Technique for Kernelization Lower Bounds

» Vertex and Edge Covers with Clustering Properties Complexity and Algorithms

» Algorithmic Metatheorems for Restrictions of Treewidth

» Satisfiability Allows No Nontrivial Sparsification Unless The PolynomialTime Hierarchy Col...

Post Info
More Details (n/a)

Added	22 Mar 2011
Updated	22 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Bart M. P. Jansen, Hans L. Bodlaender

Comments (0)