Reachability in O(log n) Genus Graphs is in Unambiguous Logspace.

Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari

Browse the full STACS paper archive.