Uniform Kernelization Complexity of Hitting Forbidden Minors.

Archontia C. Giannopoulou; Bart M. P. Jansen; Daniel Lokshtanov; Saket Saurabh

doi:10.1007/978-3-662-47672-7_51

Uniform Kernelization Complexity of Hitting Forbidden Minors.

Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh

Algorithms

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

7 Citations (Scopus)

Original language	English
Title of host publication	Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming
Publisher	Springer
Pages	629-641
Number of pages	13
Volume	9134
DOIs	https://doi.org/10.1007/978-3-662-47672-7_51
Publication status	Published - 2015

Bibliographical note

DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

Access to Document

10.1007/978-3-662-47672-7_51

Cite this

@inproceedings{c48c323ecfee4ef8a2edce7dfb9c0bf5,

title = "Uniform Kernelization Complexity of Hitting Forbidden Minors.",

author = "Giannopoulou, {Archontia C.} and Jansen, {Bart M. P.} and Daniel Lokshtanov and Saket Saurabh",

note = "DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2015",

doi = "10.1007/978-3-662-47672-7_51",

language = "English",

volume = "9134",

pages = "629--641",

booktitle = "Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming",

publisher = "Springer",

}

Uniform Kernelization Complexity of Hitting Forbidden Minors. / Giannopoulou, Archontia C.; Jansen, Bart M. P.; Lokshtanov, Daniel et al.
Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming. Vol. 9134 Springer, 2015. p. 629-641.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Uniform Kernelization Complexity of Hitting Forbidden Minors.

AU - Giannopoulou, Archontia C.

AU - Jansen, Bart M. P.

AU - Lokshtanov, Daniel

AU - Saurabh, Saket

N1 - DBLP License: DBLP's bibliographic metadata records provided through http://dblp.org/ are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2015

Y1 - 2015

U2 - 10.1007/978-3-662-47672-7_51

DO - 10.1007/978-3-662-47672-7_51

M3 - Conference contribution

VL - 9134

SP - 629

EP - 641

BT - Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming

PB - Springer

ER -