Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions

F. Dorn; E. Penninkx; H.L. Bodlaender; F.V. Fomin

doi:10.1007/11561071_11

Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions

F. Dorn
, E. Penninkx
, H.L. Bodlaender
, F.V. Fomin

Dept of Information and Computing Sciences

extern

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

Original language	English
Title of host publication	Algorithms – ESA 2005
Subtitle of host publication	13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings
Editors	Gerth Stølting Brodal, Stefano Leonardi
Publisher	Springer
Pages	95-106
Number of pages	12
ISBN (Electronic)	978-3-540-31951-1
ISBN (Print)	978-3-540-29118-3
DOIs	https://doi.org/10.1007/11561071_11
Publication status	Published - 2005

Publication series

Name	Lecture Notes in Computer Science
Volume	3669
ISSN (Print)	0302-9743

Access to Document

10.1007/11561071_11

Cite this

Dorn, F., Penninkx, E., Bodlaender, H. L., & Fomin, F. V. (2005). Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In G. Stølting Brodal, & S. Leonardi (Eds.), Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings (pp. 95-106). (Lecture Notes in Computer Science; Vol. 3669). Springer. https://doi.org/10.1007/11561071_11

Dorn, F. ; Penninkx, E. ; Bodlaender, H.L. et al. / Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings. editor / Gerth Stølting Brodal ; Stefano Leonardi. Springer, 2005. pp. 95-106 (Lecture Notes in Computer Science).

@inproceedings{a5da89d776af4fb09419d4e26e915ef2,

title = "Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions",

author = "F. Dorn and E. Penninkx and H.L. Bodlaender and F.V. Fomin",

year = "2005",

doi = "10.1007/11561071\_11",

language = "English",

isbn = "978-3-540-29118-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "95--106",

editor = "\{St{\o}lting Brodal\}, \{Gerth \} and Leonardi, \{Stefano \}",

booktitle = "Algorithms – ESA 2005",

}

Dorn, F, Penninkx, E, Bodlaender, HL & Fomin, FV 2005, Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. in G Stølting Brodal & S Leonardi (eds), Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings. Lecture Notes in Computer Science, vol. 3669, Springer, pp. 95-106. https://doi.org/10.1007/11561071_11

Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. / Dorn, F.; Penninkx, E.; Bodlaender, H.L. et al.
Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings. ed. / Gerth Stølting Brodal; Stefano Leonardi. Springer, 2005. p. 95-106 (Lecture Notes in Computer Science; Vol. 3669).

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

TY - GEN

T1 - Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions

AU - Dorn, F.

AU - Penninkx, E.

AU - Bodlaender, H.L.

AU - Fomin, F.V.

PY - 2005

Y1 - 2005

U2 - 10.1007/11561071_11

DO - 10.1007/11561071_11

M3 - Conference contribution

SN - 978-3-540-29118-3

T3 - Lecture Notes in Computer Science

SP - 95

EP - 106

BT - Algorithms – ESA 2005

A2 - Stølting Brodal, Gerth

A2 - Leonardi, Stefano

PB - Springer

ER -

Dorn F, Penninkx E, Bodlaender HL, Fomin FV. Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In Stølting Brodal G, Leonardi S, editors, Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings. Springer. 2005. p. 95-106. (Lecture Notes in Computer Science). doi: 10.1007/11561071_11