No. Title Author Year
1 Reachability and Matching in Single Crossing Minor Free Graphs Datta, Samir et al. 2021
2 Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs Gupta, Chetan et al. 2020
3 Reachability in O(log n) Genus Graphs is in Unambiguous Logspace Gupta, Chetan et al. 2019
4 Unambiguous Catalytic Computation Gupta, Chetan et al. 2019
Current Page :
Number of result pages: 1
Number of documents: 4


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI