Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Parameterized Complexity of Independent Set in H-Free Graphs.
Property / author
 
Property / author: Nicolas Bousquet / rank
Normal rank
 
Property / author
 
Property / author: Steéphan Thomassé / rank
Normal rank
 
Property / author
 
Property / author: Nicolas Bousquet / rank
 
Normal rank
Property / author
 
Property / author: Steéphan Thomassé / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Expansion and Color Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved FPT algorithms for weighted independent set in bull-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of induced graph matching on claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in some classes of \(S_{i,j,k}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum weight independent sets in classes related to claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial Turing-kernel for weighted independent set in bull-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2018.17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964160217 / rank
 
Normal rank
Property / title
 
Parameterized Complexity of Independent Set in H-Free Graphs. (English)
Property / title: Parameterized Complexity of Independent Set in H-Free Graphs. (English) / rank
 
Normal rank

Latest revision as of 09:17, 30 July 2024

scientific article; zbMATH DE number 7378603
Language Label Description Also known as
English
Parameterized Complexity of Independent Set in H-Free Graphs.
scientific article; zbMATH DE number 7378603

    Statements

    Identifiers