No. |
Title |
Author |
Year |
---|

1 |
Dynamic Complexity of Reachability: How Many Changes Can We Handle? |
Datta, Samir et al. |
2020 |

2 |
Planar Maximum Matching: Towards a Parallel Algorithm |
Datta, Samir et al. |
2018 |

3 |
Reachability and Distances under Multiple Changes |
Datta, Samir et al. |
2018 |

4 |
Shortest k-Disjoint Paths via Determinants |
Datta, Samir et al. |
2018 |

5 |
A Strategy for Dynamic Programs: Start over and Muddle Through |
Datta, Samir et al. |
2017 |

6 |
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry |
Balaji, Nikhil et al. |
2016 |

7 |
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs |
Datta, Samir et al. |
2016 |

8 |
Counting Euler Tours in Undirected Bounded Treewidth Graphs |
Balaji, Nikhil et al. |
2015 |

9 |
Improved Bounds for Bipartite Matching on Surfaces |
Datta, Samir et al. |
2012 |

10 |
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs |
Datta, Samir et al. |
2011 |

11 |
Log-space Algorithms for Paths and Matchings in k-trees |
Das, Bireswar et al. |
2010 |

12 |
Planar Graph Isomorphism is in Log-Space |
Datta, Samir et al. |
2010 |

13 |
Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space |
Datta, Samir et al. |
2009 |

14 |
3-connected Planar Graph Isomorphism is in Log-space |
Datta, Samir et al. |
2008 |

15 |
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs |
Datta, Samir et al. |
2008 |