Streaming deletion problems Parameterized by vertex cover (Q6057830): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2023.114178
@@ Property / DOI: 10.1016/j.tcs.2023.114178 / rank @@
-Normal rank
@@ Property / cites work @@
+Q4945538
@@ Property / cites work: Q4945538 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425115
@@ Property / cites work: Q3425115 / rank @@
+Normal rank
@@ Property / cites work @@
+On graph problems in a semi-streaming model
@@ Property / cites work: On graph problems in a semi-streaming model / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921736
@@ Property / cites work: Q2921736 / rank @@
+Normal rank
@@ Property / cites work @@
+Streaming Kernelization
@@ Property / cites work: Streaming Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Streaming: Maximal Matching and Vertex Cover
+Normal rank
@@ Property / cites work @@
+Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
+Normal rank
@@ Property / cites work @@
+Fixed parameter tractability of graph deletion problems over data streams
+Normal rank
@@ Property / cites work @@
+Q5875640
@@ Property / cites work: Q5875640 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards a theory of parameterized streaming algorithms
+Normal rank
@@ Property / cites work @@
+Q5091196
@@ Property / cites work: Q5091196 / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of graph modification to first-order logic properties
+Normal rank
@@ Property / cites work @@
+Hitting forbidden induced subgraphs on bounded treewidth graphs
+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 @@
+Preprocessing subgraph and minor problems: when does a small vertex cover help?
+Normal rank
@@ Property / cites work @@
+Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
+Normal rank
@@ Property / cites work @@
+Q3688439
@@ Property / cites work: Q3688439 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of fixed parameter clique and dominating set
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
+Normal rank
@@ Property / cites work @@
+Subgraph isomorphism in graph classes
@@ Property / cites work: Subgraph isomorphism in graph classes / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+A simple linear-time algorithm for computing the center of an interval graph
+Normal rank
@@ Property / cites work @@
+Finding and counting small induced subgraphs efficiently
+Normal rank
@@ Property / cites work @@
+Counting and Detecting Small Subgraphs via Equations
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Finding Four-Node Subgraphs in Triangle Time
@@ Property / cites work: Finding Four-Node Subgraphs in Triangle Time / rank @@
+Normal rank
@@ Property / cites work @@
+Q5090953
@@ Property / cites work: Q5090953 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithm for cluster vertex deletion
+Normal rank
@@ Property / cites work @@
+Maximum common induced subgraph parameterized by vertex cover
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of various parameterizations of common induced subgraph isomorphism
+Normal rank
@@ Property / cites work @@
+Slightly Superexponential Parameterized Problems
@@ Property / cites work: Slightly Superexponential Parameterized Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2023.114178
@@ Property / DOI: 10.1016/J.TCS.2023.114178 / rank @@
+Normal rank