Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740): Difference between revisions

@@ Property / cites work @@
+Q5447692
@@ Property / cites work: Q5447692 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5089181
@@ Property / cites work: Q5089181 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of colouring symmetric relational systems
+Normal rank
@@ Property / cites work @@
+The recognition of bound quivers using edge-coloured homomorphisms
+Normal rank
@@ Property / cites work @@
+The complexity of signed graph and edge-coloured graph homomorphisms
+Normal rank
@@ Property / cites work @@
+A complexity dichotomy for signed \(\mathbf{H}\)-colouring
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction Parameterized by Solution Size
+Normal rank
@@ Property / cites work @@
+On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+List H-coloring a graph by removing few vertices
@@ Property / cites work: List H-coloring a graph by removing few vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex colouring
@@ Property / cites work: Parameterized complexity of vertex colouring / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of planar signed graph homomorphisms to cycles
+Normal rank
@@ Property / cites work @@
+Q4502805
@@ Property / cites work: Q4502805 / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Q5875547
@@ Property / cites work: Q5875547 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction
+Normal rank
@@ Property / cites work @@
+On the notion of balance of a signed graph
@@ Property / cites work: On the notion of balance of a signed graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Separator-based data reduction for signed graph balancing
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
+Normal rank
@@ Property / cites work @@
+Q5403059
@@ Property / cites work: Q5403059 / rank @@
+Normal rank
@@ Property / cites work @@
+The Approximability of Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Parameterized coloring problems on chordal graphs
@@ Property / cites work: Parameterized coloring problems on chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphisms of Signed Graphs
@@ Property / cites work: Homomorphisms of Signed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential algorithms for variants of the homomorphism problem in string graphs
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+Almost 2-SAT is fixed-parameter tractable
@@ Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Coloring of Comparability+ke and –ke Graphs
+Normal rank
@@ Property / cites work @@
+Edge-Deletion Problems
@@ Property / cites work: Edge-Deletion Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Signed graphs
@@ Property / cites work: Signed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Negative (and positive) circles in signed graphs: a problem collection
+Normal rank
@@ Property / cites work @@
+A Proof of the CSP Dichotomy Conjecture
@@ Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank @@
+Normal rank