Parameterized top-Kalgorithms

This publication has 15 references indexed in Scilit:

• Improved upper bounds for vertex cover
  Theoretical Computer Science, 2010
• A survey of top- k query processing techniques in relational database systems
  ACM Computing Surveys, 2008
• The Parameterized Complexity of Counting Problems
  SIAM Journal on Computing, 2004
• Query evaluation via tree-decompositions
  Journal of the ACM, 2002
• Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs
  Algorithmica, 2002
• Vertex Cover: Further Observations and Further Improvements
  Journal of Algorithms, 2001
• Color-coding
  Journal of the ACM, 1995
• On generating all maximal independent sets
  Information Processing Letters, 1988
• Algorithms for finding K-best perfect matchings
  Discrete Applied Mathematics, 1987
• The complexity of selection and ranking in X + Y and matrices with sorted columns
  Journal of Computer and System Sciences, 1982