On the parameterized complexity of vertex cover and edge cover with connectivity constraints
type: Item
instance of: scholarly article
title: On the parameterized complexity of vertex cover and edge cover with connectivity constraints
zbMATH Open document ID: 1315.68150
author: Henning Fernau
author: Fedor V. Fomin
author: Geevarghese Philip
author: Saket Saurabh
published in: Theoretical Computer Science
publication date: 2014-12-22T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6382134
zbMATH Keywords: parameterized complexity
zbMATH Keywords: connectivity problems
zbMATH Keywords: kernel lower bounds
zbMATH Keywords: vertex cover
zbMATH Keywords: edge cover
Wikidata QID: Q59864899
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.10.035
OpenAlex ID: W2036594069
cites work: The Curse of Connectivity: t-Total Vertex (Edge) Cover
cites work: Reducibility among Combinatorial Problems
cites work: Improved upper bounds for vertex cover
cites work: Vertex cover: Further observations and further improvements
cites work: On Multiway Cut Parameterized above Lower Bounds
cites work: Paths, Flowers and Vertex Cover
cites work: LP can be a cure for parameterized problems
cites work: An Algorithm for a Minimum Cover of a Graph
cites work: Vertex and edge covers with clustering properties: Complexity and algorithms
cites work: On the completeness of a generalized matching problem
cites work: Parallel Processing and Applied Mathematics
cites work: Approximation algorithms for the test cover problem
cites work: The number of trees
cites work: Color-coding
cites work: Q4349924
cites work: Q5710169
cites work: Parametrized complexity theory.
cites work: On problems without polynomial kernels
cites work: Kernel Bounds for Disjoint Cycles and Disjoint Paths
cites work: Incompressibility through Colors and IDs
cites work: Q4198056
cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory
cites work: Deterministic Parameterized Connected Vertex Cover
cites work: Constant Time Generation of Rooted Trees
cites work: Counting subgraphs via homomorphisms
cites work: Q4231923
cites work: Fast algorithms for genegrating integer partitions
cites work: Introduction to algorithms
cites work: Counting Subgraphs via Homomorphisms
cites work: Edge Dominating Sets in Graphs
cites work: New Parameterized Algorithms for the Edge Dominating Set Problem
cites work: The effect of girth on the kernelization complexity of connected dominating set
cites work: Parameterized measure \& conquer for problems with no small kernels
DOI: 10.1016/J.TCS.2014.10.035
DBLP publication ID: journals/tcs/FernauFPS15
description: scientific article; zbMATH DE number 6382134