The perfect matching cut problem revisited (Q5925551): Difference between revisions

@@ Property / cites work @@
+On structural parameterizations of the matching cut problem
+Normal rank
@@ Property / cites work @@
+An FPT algorithm for matching cut and d-cut
@@ Property / cites work: An FPT algorithm for matching cut and d-cut / rank @@
+Normal rank
@@ Property / cites work @@
+Graph classes with structured neighborhoods and algorithmic applications
+Normal rank
@@ Property / cites work @@
+The complexity of the matching-cut problem for planar graphs and other graph classes
+Normal rank
@@ Property / cites work @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+Normal rank
@@ Property / cites work @@
+Matching cut in graphs with large minimum degree
@@ Property / cites work: Matching cut in graphs with large minimum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing decomposable graphs
@@ Property / cites work: Recognizing decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
+Normal rank
@@ Property / cites work @@
+Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
+Normal rank
@@ Property / cites work @@
+ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
+Normal rank
@@ Property / cites work @@
+Q4209364
@@ Property / cites work: Q4209364 / rank @@
+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 @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+A width parameter useful for chordal and co-comparability graphs
+Normal rank
@@ Property / cites work @@
+Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
+Normal rank
@@ Property / cites work @@
+Algorithms solving the matching cut problem
@@ Property / cites work: Algorithms solving the matching cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
+Normal rank
@@ Property / cites work @@
+Matching cutsets in graphs
@@ Property / cites work: Matching cutsets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank