No. Title Author Year
1 A Strategy for Dynamic Programs: Start over and Muddle Through Datta, Samir et al. 2017
2 Graph Properties in Node-Query Setting: Effect of Breaking Symmetry Balaji, Nikhil et al. 2016
3 Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs Datta, Samir et al. 2016
4 Counting Euler Tours in Undirected Bounded Treewidth Graphs Balaji, Nikhil et al. 2015
5 Improved Bounds for Bipartite Matching on Surfaces Datta, Samir et al. 2012
6 Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs Datta, Samir et al. 2011
7 Log-space Algorithms for Paths and Matchings in k-trees Das, Bireswar et al. 2010
8 Planar Graph Isomorphism is in Log-Space Datta, Samir et al. 2010
9 Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space Datta, Samir et al. 2009
10 3-connected Planar Graph Isomorphism is in Log-space Datta, Samir et al. 2008
Current Page :
Number of result pages: 2
Number of documents: 11


DROPS-Home | Fulltext Search | Imprint Published by LZI