Algorithms For Graphs Embeddable With Few Crossings Per Edge (2004)

by Alexander Grigoriev , Hans L. Bodlaender
Venue:PROC. 15TH INT. SYMP. ON FUNDAMENTALS OF COMPUTATION THEORY (FCT’05), VOLUME 3623 OF LECTURE NOTES IN COMPUTER SCIENCE
Citations:13 - 0 self