Parameterized aspects of strong subgraph closure (Q2182097): Difference between revisions

@@ Property / author @@
-Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
-Normal rank
@@ Property / author @@
+Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963372705
@@ Property / OpenAlex ID: W2963372705 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.10386
@@ Property / arXiv ID: 1802.10386 / rank @@
+Normal rank
@@ Property / cites work @@
+A kernelization algorithm for \(d\)-hitting set
@@ Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank @@
+Normal rank
@@ Property / cites work @@
+Solving MAX-\(r\)-SAT above a tight lower bound
@@ Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Incompressibility of \(H\)-free edge modification problems
+Normal rank
@@ Property / cites work @@
+Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
+Normal rank
@@ Property / cites work @@
+Designing FPT Algorithms for Cut Problems Using Randomized Contractions
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds Through Colors and IDs
@@ Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Planar 3DM is NP-complete
@@ Property / cites work: Planar 3DM is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4931752
@@ Property / cites work: Q4931752 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5116487
@@ Property / cites work: Q5116487 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the relation of strong triadic closure and cluster deletion
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Strong triadic closure in cographs and graphs of low maximum degree
+Normal rank
@@ Property / cites work @@
+Q5136273
@@ Property / cites work: Q5136273 / rank @@
+Normal rank
@@ Property / cites work @@
+Two edge modification problems without polynomial kernels
+Normal rank
@@ Property / cites work @@
+Edge-Deletion Problems
@@ Property / cites work: Edge-Deletion Problems / rank @@
+Normal rank