No. Title Author Year
1 Reachability and Matching in Single Crossing Minor Free Graphs Datta, Samir et al. 2021
2 Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs Gupta, Chetan et al. 2021
3 Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs Gupta, Chetan et al. 2020
4 Reachability in O(log n) Genus Graphs is in Unambiguous Logspace Gupta, Chetan et al. 2019
5 Unambiguous Catalytic Computation Gupta, Chetan et al. 2019
6 On Higher-Order Fourier Analysis over Non-Prime Fields Bhattacharyya, Arnab et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 6


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