The following publications are possibly variants of this publication:
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite GraphsChetan Gupta 0002, Vimal Raj Sharma, Raghunath Tewari. mfcs 2020: [doi]
- Space Complexity of Perfect Matching in Bounded Genus Bipartite GraphsSamir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran. STACS 2011: 579-590 [doi]
- Space Complexity of Perfect Matching in Bounded Genus Bipartite GraphsSamir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran. eccc, 17:79, 2010. [doi]
- Space complexity of perfect matching in bounded genus bipartite graphsSamir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran. jcss, 78(3):765-779, 2012. [doi]
- Reachability in $O(\log n)$ Genus Graphs is in UnambiguousChetan Gupta, Vimalraj Sharma, Raghunath Tewari. eccc, 25:106, 2018. [doi]