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

Latest revision as of 09:15, 28 December 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

instance of

scholarly article

0 references

title

Parameterized complexity of fair deletion problems (English)

0 references

Parameterized Complexity of Fair Deletion Problems (English)

0 references

0 references

0 references

Discrete Applied Mathematics

0 references

Lecture Notes in Computer Science

0 references

publication date

21 April 2020

0 references

19 May 2017

0 references

full work available at URL

https://arxiv.org/abs/1605.07959

0 references

zbMATH Keywords

parameterized complexity

0 references

fair problems

0 references

metatheorems

0 references

tree-depth

0 references

vertex cover

0 references

neighborhood diversity

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On the NP-hardness of edge-deletion and -contraction problems

0 references

Q5642456

0 references

Linear time solvable optimization problems on graphs of bounded clique-width

0 references

Monadic second-order evaluations on tree-decomposable graphs

0 references

Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency

0 references

Q4507228

0 references

Fundamentals of parameterized complexity

0 references

What Makes Equitable Connected Partition Easy

0 references

On the Complexity of Some Colorful Problems Parameterized by Treewidth

0 references

On the parameterized complexity of multiple-interval graph problems

0 references

Which problems have strongly exponential complexity?

0 references

Node-Deletion NP-Complete Problems

0 references

Algorithmic meta-theorems for restrictions of treewidth

0 references

Model Checking Lower Bounds for Simple Graphs

0 references

Q4904144

0 references

Node-and edge-deletion NP-complete problems

0 references

Edge-Deletion Problems

0 references

Nonserial dynamic programming

0 references

On the complexity of some colorful problems parameterized by treewidth

0 references

Elements of finite model theory.

0 references

Fair edge deletion problems

0 references

Parameterized complexity of fair deletion problems

0 references

Sparsity. Graphs, structures, and algorithms

0 references

Identifiers

zbMATH Open document ID

1437.05227

0 references

1485.68192

0 references

DOI

10.1007/978-3-319-55911-7_45

0 references

10.1016/J.DAM.2019.06.001

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2174554

@@ Property / DOI @@
-.1016/j.dam.2019.06.001
@@ Property / DOI: 10.1016/j.dam.2019.06.001 / rank @@
-Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2019.06.001
@@ Property / DOI: 10.1016/J.DAM.2019.06.001 / rank @@
+Normal rank
@@ Property / cites work @@
+On the NP-hardness of edge-deletion and -contraction problems
+Normal rank
@@ Property / cites work @@
+Q5642456
@@ Property / cites work: Q5642456 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
+Normal rank
@@ Property / cites work @@
+Q4507228
@@ Property / cites work: Q4507228 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+What Makes Equitable Connected Partition Easy
@@ Property / cites work: What Makes Equitable Connected Partition Easy / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Colorful Problems Parameterized by Treewidth
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Node-Deletion NP-Complete Problems
@@ Property / cites work: Node-Deletion NP-Complete Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+Model Checking Lower Bounds for Simple Graphs
@@ Property / cites work: Model Checking Lower Bounds for Simple Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Deletion Problems
@@ Property / cites work: Edge-Deletion Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Nonserial dynamic programming
@@ Property / cites work: Nonserial dynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of some colorful problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Fair edge deletion problems
@@ Property / cites work: Fair edge deletion problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of fair deletion problems
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127672198
@@ Property / Wikidata QID: Q127672198 / rank @@
+Normal rank