Skip to content

Genus Characterizes the Complexity of Graph Problems: Some Tight Results.

Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia

VenueA*ICALP
Year2003
ProceedingsICALP

Browse the full ICALP paper archive.