papers
Publications (15)
cs.CC2010
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
Samir Datta, Raghav Kulkarni, Raghunath Tewari +1
cs.LO2017
Reachability is in DynFO
Samir Datta, Raghav Kulkarni, Anish Mukherjee +2
cs.LO2018
Reachability and Distances under Multiple Changes
Samir Datta, Anish Mukherjee, Nils Vortmeier +1
cs.CC2009
A Log-space Algorithm for Canonization of Planar Graphs
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar +2
cs.CC2015
Counting Euler Tours in Undirected Bounded Treewidth Graphs
Nikhil Balaji, Samir Datta, Venkatesh Ganesan
cs.CC2011
Planarity Testing Revisited
Samir Datta, Gautam Prakriya
cs.DS2008
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
Samir Datta, Raghav Kulkarni, Sambuddha Roy
cs.GT2010
Some Tractable Win-Lose Games
Samir Datta, Nagarajan Krishnamurthy
cs.CC2015
Graph properties in node-query setting: effect of breaking symmetry
Nikhil Balaji, Samir Datta, Raghav Kulkarni +1
cs.CC2008
3-connected Planar Graph Isomorphism is in Log-space
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
cs.CC2014
Bounded Treewidth and Space-Efficient Linear Algebra
Nikhil Balaji, Samir Datta
cs.CC2013
Tree-width and Logspace: Determinants and Counting Euler Tours
Nikhil Balaji, Samir Datta
cs.CC2011
Computing Bits of Algebraic Numbers
Samir Datta, Rameshwar Pratap
cs.CC2010
Log-space Algorithms for Paths and Matchings in k-trees
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
cs.DS2018
Shortest $k$-Disjoint Paths via Determinants
Samir Datta, Siddharth Iyer, Raghav Kulkarni +1