No. Title Author Year
1 Planar Maximum Matching: Towards a Parallel Algorithm Datta, Samir et al. 2018
2 Reachability and Distances under Multiple Changes Datta, Samir et al. 2018
3 Shortest k-Disjoint Paths via Determinants Datta, Samir et al. 2018
4 A Strategy for Dynamic Programs: Start over and Muddle Through Datta, Samir et al. 2017
5 Graph Properties in Node-Query Setting: Effect of Breaking Symmetry Balaji, Nikhil et al. 2016
6 Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs Datta, Samir et al. 2016
7 Counting Euler Tours in Undirected Bounded Treewidth Graphs Balaji, Nikhil et al. 2015
8 Improved Bounds for Bipartite Matching on Surfaces Datta, Samir et al. 2012
9 Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs Datta, Samir et al. 2011
10 Log-space Algorithms for Paths and Matchings in k-trees Das, Bireswar et al. 2010
Current Page :
Number of result pages: 2
Number of documents: 14

DROPS-Home | Imprint | Privacy Published by LZI