Samir Datta
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
35
Venues
10
Active years
1999–2026
Best venue rank
A*
Where they publish
Papers
35 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | LICS | Dynamic Planar Graph Isomorphism Is in DynFO. | Samir Datta, Asif Khan, Felix Tschirbs, Nils Vortmeier, Thomas Zeume |
| 2025 | WALCOM | Evaluating Monotone Circuits on Surfaces. | Samir Datta, Chetan Gupta |
| 2024 | MFCS | The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. | Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma |
| 2024 | MFCS | Query Maintenance Under Batch Changes with Small-Depth Circuits. | Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume |
| 2023 | MFCS | Dynamic Planar Embedding Is in DynFO. | Samir Datta, Asif Khan, Anish Mukherjee |
| 2022 | ICALP | Dynamic Meta-Theorems for Distance and Matching. | Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari |
| 2021 | CSR | Dynamic Complexity of Expansion. | Samir Datta, Anuj Tawari, Yadu Vasudev |
| 2021 | MFCS | Depth-First Search in Directed Planar Graphs, Revisited. | Eric Allender, Archit Chauhan, Samir Datta |
| 2021 | MFCS | Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles. | Samir Datta, Kishlaya Jaiswal |
| 2020 | CSR | Randomized and Symmetric Catalytic Computation. | Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari |
| 2020 | ICALP | Dynamic Complexity of Reachability: How Many Changes Can We Handle? | Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume |
| 2018 | ICALP | Reachability and Distances under Multiple Changes. | Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume |
| 2018 | ISAAC | Planar Maximum Matching: Towards a Parallel Algorithm. | Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee |
| 2017 | ICALP | A Strategy for Dynamic Programs: Start over and Muddle Through. | Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume |
| 2016 | MFCS | Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. | Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder |
| 2016 | MFCS | Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. | Samir Datta, Raghav Kulkarni, Anish Mukherjee |
| 2015 | ICALP | Reachability is in DynFO. | Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume |
| 2015 | TAMC | Bounded Treewidth and Space-Efficient Linear Algebra. | Nikhil Balaji, Samir Datta |
| 2014 | ICALP | Dynamic Complexity of Directed Reachability and Other Problems. | Samir Datta, William Hesse, Raghav Kulkarni |
| 2014 | MFCS | Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. | Eric Allender, Nikhil Balaji, Samir Datta |
| 2014 | TAMC | Space Complexity of Optimization Problems in Planar Graphs. | Samir Datta, Raghav Kulkarni |
| 2014 | WALCOM | Collapsing Exact Arithmetic Hierarchies. | Nikhil Balaji, Samir Datta |
| 2012 | STACS | Improved Bounds for Bipartite Matching on Surfaces. | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari |
| 2012 | TAMC | Computing Bits of Algebraic Numbers. | Samir Datta, Rameshwar Pratap |
| 2011 | MFCS | Verifying Proofs in Constant Depth. | Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer |
| 2011 | STACS | Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran |
| 2011 | TAMC | Some Tractable Win-Lose Games. | Samir Datta, Nagarajan Krishnamurthy |
| 2011 | TAMC | Planarity Testing Revisited. | Samir Datta, Gautam Prakriya |
| 2010 | MFCS | Counting Classes and the Fine Structure between NC | Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer |
| 2010 | STACS | Log-space Algorithms for Paths and Matchings in k-trees. | Bireswar Das, Samir Datta, Prajakta Nimbhorkar |
| 2008 | STACS | Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. | Samir Datta, Raghav Kulkarni, Sambuddha Roy |
| 2007 | CSR | Planarity, Determinants, Permanents, and (Unique) Matchings. | Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan |
| 2005 | WoWMoM | Ad-Hoc Extensions to the 802.15.3 MAC Protocol. | Samir Datta, Ivan Seskar, Mustafa Demirhan, Siun-Chuon Mau, Dipankar Raychaudhuri |
| 2004 | IPCCC | Reducing overhearing energy in 802.11 networks by low-power interface idling. | Subir Biswas, Samir Datta |
| 1999 | ICALP | Bounded Depth Arithmetic Circuits: Counting and Closure. | Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh |