Parameterized complexity of fair deletion problems (Q2174554): Difference between revisions

From MaRDI portal
Merged Item from Q2988855
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the NP-hardness of edge-deletion and -contraction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5642456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Makes Equitable Connected Partition Easy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Colorful Problems Parameterized by Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Lower Bounds for Simple Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank

Revision as of 20:09, 13 July 2024

scientific article; zbMATH DE number 6721549
  • Parameterized Complexity of Fair Deletion Problems
Language Label Description Also known as
English
Parameterized complexity of fair deletion problems
scientific article; zbMATH DE number 6721549
  • Parameterized Complexity of Fair Deletion Problems

Statements

Parameterized complexity of fair deletion problems (English)
0 references
Parameterized Complexity of Fair Deletion Problems (English)
0 references
0 references
0 references
21 April 2020
0 references
19 May 2017
0 references
parameterized complexity
0 references
fair problems
0 references
metatheorems
0 references
tree-depth
0 references
vertex cover
0 references
neighborhood diversity
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references