On the parameterized complexity of finding separators with non-hereditary properties

Pinar Heggernes; Pim van 't Hof; Dániel Marx; Neeldhara Misra; Yngve Villanger

doi:10.1007/978-3-642-34611-8_33

On the parameterized complexity of finding separators with non-hereditary properties

Pinar Heggernes, Pim van 't Hof, Dániel Marx, Neeldhara Misra, Yngve Villanger

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

Original language	English
Title of host publication	Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers
Editors	Martin Charles Golumbic, Michal Stern, Avivit Levy, Gila Morgenstern
Publisher	Springer
Pages	332-343
Number of pages	12
ISBN (Electronic)	978-3-642-34611-8
ISBN (Print)	978-3-642-34610-1
DOIs	https://doi.org/10.1007/978-3-642-34611-8_33
Publication status	Published - 2012
Externally published	Yes
Event	38th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2012 - Jerusalem, Israel Duration: 26 Jun 2012 → 28 Jun 2012 Conference number: 38

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	7551

Conference

Conference	38th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2012
Abbreviated title	WG 2012
Country/Territory	Israel
City	Jerusalem
Period	26/06/12 → 28/06/12

Access to Document

10.1007/978-3-642-34611-8_33

Cite this

Heggernes, P., van 't Hof, P., Marx, D., Misra, N., & Villanger, Y. (2012). On the parameterized complexity of finding separators with non-hereditary properties. In M. C. Golumbic, M. Stern, A. Levy, & G. Morgenstern (Eds.), Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers (pp. 332-343). (Lecture Notes in Computer Science; Vol. 7551). Springer. https://doi.org/10.1007/978-3-642-34611-8_33

Heggernes, Pinar ; van 't Hof, Pim ; Marx, Dániel et al. / On the parameterized complexity of finding separators with non-hereditary properties. Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. editor / Martin Charles Golumbic ; Michal Stern ; Avivit Levy ; Gila Morgenstern. Springer, 2012. pp. 332-343 (Lecture Notes in Computer Science).

@inproceedings{6b29395d61d6485391a0b56f7eebfa38,

title = "On the parameterized complexity of finding separators with non-hereditary properties",

author = "Pinar Heggernes and {van 't Hof}, Pim and D{\'a}niel Marx and Neeldhara Misra and Yngve Villanger",

year = "2012",

doi = "10.1007/978-3-642-34611-8_33",

language = "English",

isbn = "978-3-642-34610-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "332--343",

editor = "Golumbic, {Martin Charles} and Michal Stern and Avivit Levy and Gila Morgenstern",

booktitle = "Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers",

address = "Germany",

note = "38th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2012, WG 2012 ; Conference date: 26-06-2012 Through 28-06-2012",

}

Heggernes, P, van 't Hof, P, Marx, D, Misra, N & Villanger, Y 2012, On the parameterized complexity of finding separators with non-hereditary properties. in MC Golumbic, M Stern, A Levy & G Morgenstern (eds), Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. Lecture Notes in Computer Science, vol. 7551, Springer, pp. 332-343, 38th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2012, Jerusalem, Israel, 26/06/12. https://doi.org/10.1007/978-3-642-34611-8_33

On the parameterized complexity of finding separators with non-hereditary properties. / Heggernes, Pinar; van 't Hof, Pim; Marx, Dániel et al.
Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. ed. / Martin Charles Golumbic; Michal Stern; Avivit Levy; Gila Morgenstern. Springer, 2012. p. 332-343 (Lecture Notes in Computer Science; Vol. 7551).

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

TY - GEN

T1 - On the parameterized complexity of finding separators with non-hereditary properties

AU - Heggernes, Pinar

AU - van 't Hof, Pim

AU - Marx, Dániel

AU - Misra, Neeldhara

AU - Villanger, Yngve

N1 - Conference code: 38

PY - 2012

Y1 - 2012

U2 - 10.1007/978-3-642-34611-8_33

DO - 10.1007/978-3-642-34611-8_33

M3 - Conference contribution

SN - 978-3-642-34610-1

T3 - Lecture Notes in Computer Science

SP - 332

EP - 343

BT - Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers

A2 - Golumbic, Martin Charles

A2 - Stern, Michal

A2 - Levy, Avivit

A2 - Morgenstern, Gila

PB - Springer

T2 - 38th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2012

Y2 - 26 June 2012 through 28 June 2012

ER -

Heggernes P, van 't Hof P, Marx D, Misra N, Villanger Y. On the parameterized complexity of finding separators with non-hereditary properties. In Golumbic MC, Stern M, Levy A, Morgenstern G, editors, Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers. Springer. 2012. p. 332-343. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-34611-8_33