| 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 | Dynamic Complexity of Reachability: How Many Changes Can We Handle? | Datta, Samir et al. | 2020 |
| 4 | A Framework for In-place Graph Algorithms | Chakraborty, Sankardeep et al. | 2018 |
| 5 | Planar Maximum Matching: Towards a Parallel Algorithm | Datta, Samir et al. | 2018 |
| 6 | Reachability and Distances under Multiple Changes | Datta, Samir et al. | 2018 |
| 7 | Shortest k-Disjoint Paths via Determinants | Datta, Samir et al. | 2018 |
| 8 | A Strategy for Dynamic Programs: Start over and Muddle Through | Datta, Samir et al. | 2017 |
| 9 | Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs | Datta, Samir et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |