Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

Stefan Kratsch; Dániel Marx; Magnus Wahlström

doi:10.1007/978-3-642-15155-2_43

Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

Stefan Kratsch, Dániel Marx, Magnus Wahlström

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010
Editors	Petr Hlinený, Antonín Kucera
Place of Publication	Brno, Czech Republic
Publisher	Springer
Pages	489-500
Number of pages	12
Volume	6281
DOIs	https://doi.org/10.1007/978-3-642-15155-2_43
Publication status	Published - 2010

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer

Access to Document

10.1007/978-3-642-15155-2_43

Cite this

Kratsch, S., Marx, D., & Wahlström, M. (2010). Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. In P. Hlinený, & A. Kucera (Eds.), Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010 (Vol. 6281, pp. 489-500). (Lecture Notes in Computer Science). Springer. https://doi.org/10.1007/978-3-642-15155-2_43

Kratsch, Stefan ; Marx, Dániel ; Wahlström, Magnus. / Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010. editor / Petr Hlinený ; Antonín Kucera. Vol. 6281 Brno, Czech Republic : Springer, 2010. pp. 489-500 (Lecture Notes in Computer Science).

@inproceedings{ffe83022bea24c18a2cc5e7c6ce1815a,

title = "Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems",

author = "Stefan Kratsch and D{\'a}niel Marx and Magnus Wahlstr{\"o}m",

year = "2010",

doi = "10.1007/978-3-642-15155-2_43",

language = "English",

volume = "6281",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "489--500",

editor = "Petr Hlinen{\'y} and Anton{\'i}n Kucera",

booktitle = "Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010",

}

Kratsch, S, Marx, D & Wahlström, M 2010, Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. in P Hlinený & A Kucera (eds), Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010. vol. 6281, Lecture Notes in Computer Science, Springer, Brno, Czech Republic, pp. 489-500. https://doi.org/10.1007/978-3-642-15155-2_43

Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. / Kratsch, Stefan; Marx, Dániel; Wahlström, Magnus.
Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010. ed. / Petr Hlinený; Antonín Kucera. Vol. 6281 Brno, Czech Republic: Springer, 2010. p. 489-500 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems

AU - Kratsch, Stefan

AU - Marx, Dániel

AU - Wahlström, Magnus

PY - 2010

Y1 - 2010

U2 - 10.1007/978-3-642-15155-2_43

DO - 10.1007/978-3-642-15155-2_43

M3 - Conference contribution

VL - 6281

T3 - Lecture Notes in Computer Science

SP - 489

EP - 500

BT - Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010

A2 - Hlinený, Petr

A2 - Kucera, Antonín

PB - Springer

CY - Brno, Czech Republic

ER -

Kratsch S, Marx D, Wahlström M. Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems. In Hlinený P, Kucera A, editors, Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010. Vol. 6281. Brno, Czech Republic: Springer. 2010. p. 489-500. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-15155-2_43