Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes (Q5150814): Difference between revisions

@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms forK4Immersion Testing
@@ Property / cites work: Fast Algorithms forK4Immersion Testing / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
+Normal rank
@@ Property / cites work @@
+Minors in graphs of large \(\theta_r\)-girth
@@ Property / cites work: Minors in graphs of large \(\theta_r\)-girth / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial Bounds for the Grid-Minor Theorem
@@ Property / cites work: Polynomial Bounds for the Grid-Minor Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Designing FPT Algorithms for Cut Problems Using Randomized Contractions
+Normal rank
@@ Property / cites work @@
+Excluded Grid Theorem
@@ Property / cites work: Excluded Grid Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum degree condition forcing complete graph immersion
+Normal rank
@@ Property / cites work @@
+A Structure Theorem for Strong Immersions
@@ Property / cites work: A Structure Theorem for Strong Immersions / rank @@
+Normal rank
@@ Property / cites work @@
+Complete graph immersions and minimum degree
@@ Property / cites work: Complete graph immersions and minimum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Applications of Tree-Cut Width
@@ Property / cites work: Algorithmic Applications of Tree-Cut Width / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform Kernelization Complexity of Hitting Forbidden Minors
+Normal rank
@@ Property / cites work @@
+Packing and covering immersion-expansions of planar sub-cubic graphs
+Normal rank
@@ Property / cites work @@
+Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
+Normal rank
@@ Property / cites work @@
+Effective computation of immersion obstructions for unions of graph classes
+Normal rank
@@ Property / cites work @@
+A weak immersion relation on graphs and its applications
+Normal rank
@@ Property / cites work @@
+Finding topological subgraphs is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+On an edge ranking problem of trees and graphs
@@ Property / cites work: On an edge ranking problem of trees and graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
+Normal rank
@@ Property / cites work @@
+An FPT 2-approximation for tree-cut decomposition
@@ Property / cites work: An FPT 2-approximation for tree-cut decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Edge ranking of graphs is hard
@@ Property / cites work: Edge ranking of graphs is hard / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank
@@ Property / cites work @@
+Immersions in Highly Edge Connected Graphs
@@ Property / cites work: Immersions in Highly Edge Connected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors XXIII. Nash-Williams' immersion conjecture
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+Cutwidth I: A linear time fixed parameter algorithm
+Normal rank
@@ Property / cites work @@
+The structure of graphs not admitting a fixed immersion
+Normal rank