Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari. Reachability in O(log n) Genus Graphs is in Unambiguous Logspace. In Rolf Niedermeier, Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany. Volume 126 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]
Abstract is missing.