Smaller Parameters for Vertex Cover Kernelization
type: Item
instance of: scholarly article
zbMATH Open document ID: 1443.68072
author: Eva-Maria C. Hols
author: Stefan Kratsch
publication date: 2020-05-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1711.04604
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 7205204
zbMATH Keywords: vertex cover
zbMATH Keywords: kernelization
zbMATH Keywords: structural parameterization
MaRDI profile type: Publication
arXiv ID: 1711.04604
cites work: On problems without polynomial kernels
cites work: Kernelization Lower Bounds by Cross-Composition
cites work: On the number of vertices belonging to all maximum stable sets of a graph
cites work: How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
cites work: Crown reductions for the minimum weighted vertex cover problem
cites work: On the hardness of losing width
cites work: Vertex Cover Structural Parameterization Revisited
cites work: Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee
cites work: Vertices Belonging to All or to No Maximum Stable Sets of a Graph
cites work: Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
cites work: A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter
cites work: Representative Sets and Irrelevant Vertices
cites work: Q5363786
cites work: Vertex packings: Structural properties and algorithms
OpenAlex ID: W2963326511
title: Smaller Parameters for Vertex Cover Kernelization
DOI: 10.4230/LIPICS.IPEC.2017.20
description: scientific article; zbMATH DE number 7205204