A Completeness Theory for Polynomial (Turing) Kernelization

This publication has 32 references indexed in Scilit:

• Kernelization Lower Bounds by Cross-Composition
  SIAM Journal on Discrete Mathematics, 2014
• Kernel bounds for path and cycle problems
  Theoretical Computer Science, 2013
• Kernel(s) for problems with no kernel
  ACM Transactions on Algorithms, 2012
• Kernel bounds for disjoint cycles and disjoint paths
  Theoretical Computer Science, 2011
• Solving MAX-r-SAT Above a Tight Lower Bound
  Algorithmica, 2010
• On problems without polynomial kernels
  Journal of Computer and System Sciences, 2009
• Fixed-parameter tractability of graph modification problems for hereditary properties
  Information Processing Letters, 1996
• Color-coding
  Journal of the ACM, 1995
• Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
  Annals of Pure and Applied Logic, 1995
• Nondeterminism within $P^ * $
  SIAM Journal on Computing, 1993