Parameterized complexity of independent set in H-free graphs
type: Item
instance of: scholarly article
title: Parameterized complexity of independent set in H-free graphs
zbMATH Open document ID: 1452.68090
author: Édouard Bonnet
author: Nicolas Bousquet
author: Pierre Charbit
author: Rémi Watrigant
author: Stéphan Thomassé
published in: Algorithmica
publication date: 2020-08-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/1810.04620
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7233380
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: independent set
zbMATH Keywords: H-free graphs
MaRDI profile type: Publication
OpenAlex ID: W3036315659
arXiv ID: 1810.04620
cites work: Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs
cites work: Kernelization Lower Bounds by Cross-Composition
cites work: Q5875613
cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
cites work: Iterative Expansion and Color Coding
cites work: A Linear Recognition Algorithm for Cographs
cites work: Parameterized Algorithms
cites work: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
cites work: Fundamentals of parameterized complexity
cites work: Improved FPT algorithms for weighted independent set in bull-free graphs
cites work: Q4198056
cites work: Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
cites work: Parameterized complexity of induced graph matching on claw-free graphs
cites work: Independent sets in some classes of \(S_{i,j,k}\)-free graphs
cites work: Maximum weight independent sets in classes related to claw-free graphs
cites work: Independent Set in P5-Free Graphs in Polynomial Time
cites work: Parameterized Complexity of Independence and Domination on Geometric Graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: Q4231923
cites work: Q4770411
cites work: Finding odd cycle transversals.
cites work: A polynomial Turing-kernel for weighted independent set in bull-free graphs
cites work: Q3002782
DOI: 10.1007/S00453-020-00730-6
description: scientific article