Algorithms for graphs embeddable with few crossings per edge

Activity: Talk or presentation (speaker at event)Talk or presentationAcademic

Description

CY - Luebeck, Germany;
Period17 Aug 2005
Event titleFCT 2005
Event typeOther