BibTeX Export for Polynomial Kernelizations for MIN F^+Pi_1 and MAX NP

Copy to Clipboard Download

@InProceedings{kratsch:LIPIcs.STACS.2009.1851,
  author =	{Kratsch, Stefan},
  title =	{{Polynomial Kernelizations for MIN F^+Pi\underline1 and MAX NP}},
  booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{601--612},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-09-5},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{3},
  editor =	{Albers, Susanne and Marion, Jean-Yves},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1851},
  URN =		{urn:nbn:de:0030-drops-18511},
  doi =		{10.4230/LIPIcs.STACS.2009.1851},
  annote =	{Keywords: Parameterized complexity, Kernelization, Approximation algorithms}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode