Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Context-free Handle-rewriting Hypergraph Grammars
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
The PCP theorem by gap amplification
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity
Parameterized approximation of dominating set problems
Information Processing Letters
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Constant ratio fixed-parameter approximation of the edge multicut problem
Information Processing Letters
Algorithms and theory of computation handbook
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Discrete Applied Mathematics
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Parameterized approximation algorithms for hitting set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
The Multivariate Algorithmic Revolution and Beyond
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized approximability of the disjoint cycle problem
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Completely inapproximable monotone and antimonotone parameterized problems
Journal of Computer and System Sciences
The exponential time hypothesis and the parameterized clique problem
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
ACM Transactions on Knowledge Discovery from Data (TKDD)
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
| Hi-index | 0.00 |
Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is to deal with the efficient approximation of small cost solutions for optimisation problems.