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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Parameterized Complexity of Fair Deletion Problems
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6721549
@@ Property / DOI @@
-.1016/j.dam.2019.06.001
@@ Property / DOI: 10.1016/j.dam.2019.06.001 / rank @@
-Normal rank
@@ Property / title @@
+Parameterized Complexity of Fair Deletion Problems (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68192
@@ Property / zbMATH Open document ID: 1485.68192 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-55911-7_45
@@ Property / DOI: 10.1007/978-3-319-55911-7_45 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2019.06.001
@@ Property / DOI: 10.1016/J.DAM.2019.06.001 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+May 2017Timestamp +2017-05-19T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2017-05-19T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 19 May 2017 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W05
@@ Property / Mathematics Subject Classification ID: 68W05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6721549
@@ Property / zbMATH DE Number: 6721549 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3195771200
@@ Property / OpenAlex ID: W3195771200 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.07959
@@ Property / arXiv ID: 1605.07959 / 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

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