Algorithms for graphs embeddable with few crossings per edge

Research output: Contribution to journal › Article › Academic › peer-review

139c

Cite this

@article{3c6a143f7d0843a0afb0d993624ebd38,

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

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

note = "139c",

year = "2007",

language = "Undefined/Unknown",

volume = "49",

pages = "1--11",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

}