Skip to main navigation Skip to search Skip to main content

Parametric duality and kernelization: Lower bounds and upper bounds on kernel size

  • Texas A and M University
  • University of Newcastle, Australia
  • Universität Tübingen

Research output: Contribution to journal › Conference article › peer-review

Original languageEnglish
Pages (from-to)269-280
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3404
DOIs
StatePublished - 2005
Event22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005 - Stuttgart, Germany
Duration: Feb 24 2005 → Feb 26 2005

ASJC Scopus Subject Areas

  • Theoretical Computer Science
  • General Computer Science

Keywords

  • Kernelization
  • Parameterized complexity

Cite this