| No. |
Title |
Author |
Year |
| 1 |
Dynamic Planar Embedding Is in DynFO |
Datta, Samir et al. |
2023 |
| 2 |
Dynamic Meta-Theorems for Distance and Matching |
Datta, Samir et al. |
2022 |
| 3 |
Depth-First Search in Directed Planar Graphs, Revisited |
Allender, Eric et al. |
2021 |
| 4 |
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles |
Datta, Samir et al. |
2021 |
| 5 |
Reachability and Matching in Single Crossing Minor Free Graphs |
Datta, Samir et al. |
2021 |
| 6 |
Dynamic Complexity of Reachability: How Many Changes Can We Handle? |
Datta, Samir et al. |
2020 |
| 7 |
Planar Maximum Matching: Towards a Parallel Algorithm |
Datta, Samir et al. |
2018 |
| 8 |
Reachability and Distances under Multiple Changes |
Datta, Samir et al. |
2018 |
| 9 |
Shortest k-Disjoint Paths via Determinants |
Datta, Samir et al. |
2018 |
| 10 |
A Strategy for Dynamic Programs: Start over and Muddle Through |
Datta, Samir et al. |
2017 |
| 11 |
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry |
Balaji, Nikhil et al. |
2016 |
| 12 |
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs |
Datta, Samir et al. |
2016 |
| 13 |
Counting Euler Tours in Undirected Bounded Treewidth Graphs |
Balaji, Nikhil et al. |
2015 |
| 14 |
Improved Bounds for Bipartite Matching on Surfaces |
Datta, Samir et al. |
2012 |
| 15 |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs |
Datta, Samir et al. |
2011 |
| 16 |
Log-space Algorithms for Paths and Matchings in k-trees |
Das, Bireswar et al. |
2010 |
| 17 |
Planar Graph Isomorphism is in Log-Space |
Datta, Samir et al. |
2010 |
| 18 |
Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space |
Datta, Samir et al. |
2009 |
| 19 |
3-connected Planar Graph Isomorphism is in Log-space |
Datta, Samir et al. |
2008 |
| 20 |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs |
Datta, Samir et al. |
2008 |
