Almost 2-SAT is fixed-parameter tractable (Q1034100): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2009.04.002
@@ Property / DOI: 10.1016/j.jcss.2009.04.002 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2009.04.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1485150579
@@ Property / OpenAlex ID: W1485150579 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4500916
@@ Property / cites work: Q4500916 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for the Feedback Vertex Set Problems
+Normal rank
@@ Property / cites work @@
+Improved exact algorithms for MAX-SAT
@@ Property / cites work: Improved exact algorithms for MAX-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
+Normal rank
@@ Property / cites work @@
+Q3549698
@@ Property / cites work: Q3549698 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Approximability of the Disjoint Cycle Problem
+Normal rank
@@ Property / cites work @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+Experimental and Efficient Algorithms
@@ Property / cites work: Experimental and Efficient Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+Parameterized graph separation problems
@@ Property / cites work: Parameterized graph separation problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2009.04.002
@@ Property / DOI: 10.1016/J.JCSS.2009.04.002 / rank @@
+Normal rank