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 (Corresponding author)
, 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	Automata, Languages, and Programming
Subtitle of host publication	42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings
Editors	Magnús Halldórsson, Kazuo Iwama, Naoki Kobayashi, Bettina Speckmann
Publisher	Springer
Pages	629-641
Number of pages	13
Volume	1
DOIs	https://doi.org/10.1007/978-3-662-47672-7_51
Publication status	Published - 2015

Publication series

Name	Lecture Notes in Computer Science
Volume	9134

Access to Document

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

Cite this

Giannopoulou, A. C., Jansen, B. M. P., Lokshtanov, D., & Saurabh, S. (2015). Uniform Kernelization Complexity of Hitting Forbidden Minors. In M. Halldórsson, K. Iwama, N. Kobayashi, & B. Speckmann (Eds.), Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings (Vol. 1, pp. 629-641). (Lecture Notes in Computer Science; Vol. 9134). Springer. https://doi.org/10.1007/978-3-662-47672-7_51

Giannopoulou, Archontia C. ; Jansen, Bart M. P. ; Lokshtanov, Daniel et al. / Uniform Kernelization Complexity of Hitting Forbidden Minors. Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings. editor / Magnús Halldórsson ; Kazuo Iwama ; Naoki Kobayashi ; Bettina Speckmann. Vol. 1 Springer, 2015. pp. 629-641 (Lecture Notes in Computer Science).

@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",

year = "2015",

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

language = "English",

volume = "1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "629--641",

editor = "Magn{\'u}s Halld{\'o}rsson and Kazuo Iwama and Naoki Kobayashi and Bettina Speckmann",

booktitle = "Automata, Languages, and Programming",

address = "Germany",

}

Giannopoulou, AC, Jansen, BMP, Lokshtanov, D & Saurabh, S 2015, Uniform Kernelization Complexity of Hitting Forbidden Minors. in M Halldórsson, K Iwama, N Kobayashi & B Speckmann (eds), Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings. vol. 1, Lecture Notes in Computer Science, vol. 9134, Springer, pp. 629-641. https://doi.org/10.1007/978-3-662-47672-7_51

Uniform Kernelization Complexity of Hitting Forbidden Minors. / Giannopoulou, Archontia C.; Jansen, Bart M. P. (Corresponding author); Lokshtanov, Daniel et al.
Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings. ed. / Magnús Halldórsson; Kazuo Iwama; Naoki Kobayashi; Bettina Speckmann. Vol. 1 Springer, 2015. p. 629-641 (Lecture Notes in Computer Science; Vol. 9134).

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

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 - 1

T3 - Lecture Notes in Computer Science

SP - 629

EP - 641

BT - Automata, Languages, and Programming

A2 - Halldórsson, Magnús

A2 - Iwama, Kazuo

A2 - Kobayashi, Naoki

A2 - Speckmann, Bettina

PB - Springer

ER -

Giannopoulou AC, Jansen BMP, Lokshtanov D, Saurabh S. Uniform Kernelization Complexity of Hitting Forbidden Minors. In Halldórsson M, Iwama K, Kobayashi N, Speckmann B, editors, Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings. Vol. 1. Springer. 2015. p. 629-641. (Lecture Notes in Computer Science). doi: 10.1007/978-3-662-47672-7_51