Algorithms for graphs embeddable with few crossings per edge

A. Grigoriev; H.L. Bodlaender

doi:10.1007/11537311_33

Algorithms for graphs embeddable with few crossings per edge

A. Grigoriev
, H.L. Bodlaender

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	Fundamentals of Computation Theory
Subtitle of host publication	Proceedings 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005.
Editors	M. Liskiewicz, R. Reischuk
Publisher	Springer
Pages	378-387
Number of pages	10
ISBN (Electronic)	978-3-540-31873-6
ISBN (Print)	978-3-540-28193-1
DOIs	https://doi.org/10.1007/11537311_33
Publication status	Published - 2005

Publication series

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

Bibliographical note

Bod05d

Access to Document

10.1007/11537311_33

Cite this

Grigoriev, A., & Bodlaender, H. L. (2005). Algorithms for graphs embeddable with few crossings per edge. In M. Liskiewicz, & R. Reischuk (Eds.), Fundamentals of Computation Theory: Proceedings 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005. (pp. 378-387). (Lecture Notes in Computer Science; Vol. 3623). Springer. https://doi.org/10.1007/11537311_33

@inproceedings{8db37809857442ad8b74f087fe1fdaca,

title = "Algorithms for graphs embeddable with few crossings per edge",

author = "A. Grigoriev and H.L. Bodlaender",

note = "Bod05d",

year = "2005",

doi = "10.1007/11537311\_33",

language = "English",

isbn = " 978-3-540-28193-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "378--387",

editor = "M. Liskiewicz and R. Reischuk",

booktitle = "Fundamentals of Computation Theory",

}

Algorithms for graphs embeddable with few crossings per edge. / Grigoriev, A.; Bodlaender, H.L.
Fundamentals of Computation Theory: Proceedings 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005. . ed. / M. Liskiewicz; R. Reischuk. Springer, 2005. p. 378-387 (Lecture Notes in Computer Science; Vol. 3623).

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

TY - GEN

T1 - Algorithms for graphs embeddable with few crossings per edge

AU - Grigoriev, A.

AU - Bodlaender, H.L.

N1 - Bod05d

PY - 2005

Y1 - 2005

U2 - 10.1007/11537311_33

DO - 10.1007/11537311_33

M3 - Conference contribution

SN - 978-3-540-28193-1

T3 - Lecture Notes in Computer Science

SP - 378

EP - 387

BT - Fundamentals of Computation Theory

A2 - Liskiewicz, M.

A2 - Reischuk, R.

PB - Springer

ER -