No. Title Author Year
1 Depth-First Search in Directed Planar Graphs, Revisited Allender, Eric et al. 2021
2 Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles Datta, Samir et al. 2021
3 Reachability and Matching in Single Crossing Minor Free Graphs Datta, Samir et al. 2021
4 Dynamic Complexity of Reachability: How Many Changes Can We Handle? Datta, Samir et al. 2020
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 Graph Properties in Node-Query Setting: Effect of Breaking Symmetry Balaji, Nikhil et al. 2016
10 Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs Datta, Samir et al. 2016
11 Counting Euler Tours in Undirected Bounded Treewidth Graphs Balaji, Nikhil et al. 2015
12 Improved Bounds for Bipartite Matching on Surfaces Datta, Samir et al. 2012
13 Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs Datta, Samir et al. 2011
14 Log-space Algorithms for Paths and Matchings in k-trees Das, Bireswar et al. 2010
15 Planar Graph Isomorphism is in Log-Space Datta, Samir et al. 2010
16 Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space Datta, Samir et al. 2009
17 3-connected Planar Graph Isomorphism is in Log-space Datta, Samir et al. 2008
18 Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs Datta, Samir et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 18


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