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