Parameterizing above or below guaranteed values (Q1004602): Difference between revisions

@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Algorithms for Kemeny Scores
@@ Property / cites work: Fixed-Parameter Algorithms for Kemeny Scores / rank @@
+Normal rank
@@ Property / cites work @@
+On interval graphs and matrice profiles
@@ Property / cites work: On interval graphs and matrice profiles / rank @@
+Normal rank
@@ Property / cites work @@
+On fixed-parameter tractability and approximability of NP optimization problems
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
+Normal rank
@@ Property / cites work @@
+On Parameterized Approximability
@@ Property / cites work: On Parameterized Approximability / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independence numbers of graphs - an extension of the Koenig-Egervary theorem
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Approximation Problems
@@ Property / cites work: Parameterized Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum feedback sets and multicuts in directed graphs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+.879-approximation algorithms for MAX CUT and MAX 2SAT
+Normal rank
@@ Property / cites work @@
+The Linear Arrangement Problem Parameterized Above Guaranteed Value
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Complexity of Minimum Profile Problems
+Normal rank
@@ Property / cites work @@
+On the advantage over a random assignment
@@ Property / cites work: On the advantage over a random assignment / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549635
@@ Property / cites work: Q3549635 / rank @@
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Profile minimization problem for matrices and graphs
+Normal rank
@@ Property / cites work @@
+Wheel-Free Deletion Is W[2]-Hard
@@ Property / cites work: Wheel-Free Deletion Is W[2]-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+Parameterizing MAX SNP Problems Above Guaranteed Values
+Normal rank
@@ Property / cites work @@
+Chordal Deletion Is Fixed-Parameter Tractable
@@ Property / cites work: Chordal Deletion Is Fixed-Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Obtaining a Planar Graph by Vertex Deletion
@@ Property / cites work: Obtaining a Planar Graph by Vertex Deletion / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
+Normal rank
@@ Property / cites work @@
+Q4856179
@@ Property / cites work: Q4856179 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4944968
@@ Property / cites work: Q4944968 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+New Upper Bounds for Maximum Satisfiability
@@ Property / cites work: New Upper Bounds for Maximum Satisfiability / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
+Normal rank
@@ Property / cites work @@
+Faster fixed parameter tractable algorithms for finding feedback vertex sets
+Normal rank
@@ Property / cites work @@
+Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank