Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679): Difference between revisions

@@ Property / cites work @@
+Maximum common induced subgraph parameterized by vertex cover
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
+Normal rank
@@ Property / cites work @@
+The Bandwidth of Caterpillars with Hairs of Length 1 and 2
+Normal rank
@@ Property / cites work @@
+Q3789603
@@ Property / cites work: Q3789603 / rank @@
+Normal rank
@@ Property / cites work @@
+Metric Dimension of Bounded Tree-length Graphs
@@ Property / cites work: Metric Dimension of Bounded Tree-length Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New Results on Directed Edge Dominating Set
@@ Property / cites work: New Results on Directed Edge Dominating Set / rank @@
+Normal rank
@@ Property / cites work @@
+Q5874480
@@ Property / cites work: Q5874480 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced vertex-orderings of graphs
@@ Property / cites work: Balanced vertex-orderings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795218
@@ Property / cites work: Q3795218 / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraph isomorphism on graph classes that exclude a substructure
+Normal rank
@@ Property / cites work @@
+Q5875537
@@ Property / cites work: Q5875537 / rank @@
+Normal rank
@@ Property / cites work @@
+The graph motif problem parameterized by the structure of the input graph
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated Domination and Covering: A Parameterized Perspective
+Normal rank
@@ Property / cites work @@
+On the computational complexity of vertex integrity and component order connectivity
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of length-bounded cuts and multicuts
+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 @@
+Graph Layout Problems Parameterized by Vertex Cover
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of coloring problems: treewidth versus vertex cover
+Normal rank
@@ Property / cites work @@
+On structural parameterizations of the bounded-degree vertex deletion problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner forest problem revisited
@@ Property / cites work: The Steiner forest problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing with fixed number of bins revisited
@@ Property / cites work: Bin packing with fixed number of bins revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Geodetic Set
@@ Property / cites work: Parameterized Complexity of Geodetic Set / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Imbalance is fixed parameter tractable
@@ Property / cites work: Imbalance is fixed parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterised complexity of list problems on graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Imbalance parameterized by twin cover revisited
@@ Property / cites work: Imbalance parameterized by twin cover revisited / rank @@
+Normal rank
@@ Property / cites work @@
+The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
+Normal rank
@@ Property / cites work @@
+The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3012402
@@ Property / cites work: Q3012402 / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic second order logic on graphs with local cardinality constraints
+Normal rank