Conference/Workshop
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems.
With Seungbum Jo and Srinivasa Rao Satti; In Proceedings of the 15th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW), 2017.
Biconnectivity, Chain Decomposition and st-numbering using O(n) bits.
With Venkatesh Raman and Srinivasa Rao Satti; In Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC), 2016 and selected for oral presentation in ACM India Inter Research Institute Student Seminar in Computer Science (IRISS), 2017.
With Niranka Banerjee, Venkatesh Raman, Sasanka Roy and Saket Saurabh; In Proceedings of the 21st Annual International Computing and Combinatorics Conference (COCOON), 2015.
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs.
With Niranka Banerjee and Venkatesh Raman; In Proceedings of the 22nd Annual International Computing and Combinatorics Conference (COCOON), 2016.
Improved Space Efficient Algorithms for BFS, DFS and Applications.
Manuscripts
Space-Efficient Algorithms for Breadth-Depth Search.
With Anish Mukherjee and Srinivasa Rao Satti.
With Anish Mukherjee and Srinivasa Rao Satti.
With Anish Mukherjee, Venkatesh Raman and Srinivasa Rao Satti.
A Framework for Designing In-place Graph Algorithms.
Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications.
With Anish Mukherjee, Venkatesh Raman and Srinivasa Rao Satti.
With Srinivasa Rao Satti; In Proceedings of the 23rd Annual International Computing and Combinatorics Conference (COCOON), 2017.
Improved Space-Efficient Linear Time Algorithms for Various Connectivity Related Algorithms.
With Venkatesh Raman and Srinivasa Rao Satti.
A Note on Space-Efficient Computation of Various Centrality Measures of Network.
With Srinivasa Rao Satti.
M.Sc. Thesis:
Topics in Correlation Bounds [pdf]
Under the guidence of Prof. Meena Mahajan, The Institute of Mathematical Sciences, Chennai.