Follow
Sankardeep Chakraborty
Sankardeep Chakraborty
National Institute of Informatics
Verified email at imsc.res.in
Title
Cited by
Cited by
Year
Improved space efficient algorithms for BFS, DFS and applications
N Banerjee, S Chakraborty, V Raman
International Computing and Combinatorics Conference, 119-130, 2016
282016
Succinct data structures for families of interval graphs
H Acan, S Chakraborty, S Jo, SR Satti
Workshop on Algorithms and Data Structures, 1-13, 2019
22*2019
Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs
N Banerjee, S Chakraborty, V Raman, S Roy, S Saurabh
International Computing and Combinatorics Conference, 349-360, 2015
182015
Space efficient linear time algorithms for BFS, DFS and applications
N Banerjee, S Chakraborty, V Raman, SR Satti
Theory of Computing Systems 62 (8), 1736-1762, 2018
172018
A framework for in-place graph algorithms
S Chakraborty, A Mukherjee, V Raman, SR Satti
26th Annual European Symposium on Algorithms (ESA 2018), 2018
17*2018
Biconnectivity, st-numbering and other applications of DFS using O (n) bits
S Chakraborty, V Raman, SR Satti
Journal of Computer and System Sciences 90, 63-79, 2017
162017
Biconnectivity, chain decomposition and st-numbering using O (n) bits
S Chakraborty, V Raman, SR Satti
27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016
152016
Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications
S Chakraborty, SR Satti
International Computing and Combinatorics Conference, 87-98, 2017
132017
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
S Chakraborty, SR Satti
Journal of Combinatorial Optimization 37 (2), 465-481, 2019
122019
Improved space-efficient linear time algorithms for some classical graph problems
S Chakraborty, S Jo, SR Satti
arXiv preprint arXiv:1712.03349, 2017
102017
Succinct data structures for small clique-width graphs
S Chakraborty, S Jo, K Sadakane, SR Satti
2021 Data Compression Conference (DCC), 133-142, 2021
62021
Succinct representations of Intersection Graphs on a Circle
H Acan, S Chakraborty, S Jo, K Nakashima, K Sadakane, SR Satti
2021 Data Compression Conference (DCC), 123-132, 2021
6*2021
Indexing graph search trees and applications
S Chakraborty, K Sadakane
arXiv preprint arXiv:1906.07871, 2019
52019
Succinct representation for (non) deterministic finite automata
S Chakraborty, R Grossi, K Sadakane, SR Satti
Journal of Computer and System Sciences 131, 1-12, 2023
42023
Optimal in-place algorithms for basic graph problems
S Chakraborty, K Sadakane, SR Satti
International Workshop on Combinatorial Algorithms, 126-139, 2020
42020
Space efficient algorithms for breadth-depth search
S Chakraborty, A Mukherjee, SR Satti
International Symposium on Fundamentals of Computation Theory, 201-212, 2019
42019
Space efficient graph algorithms
S Chakraborty
PhD thesis. The Institute of Mathematical Sciences, HBNI, India, 2018
42018
31st International Symposium on Algorithms and Computation (ISAAC 2020)
S Oum, K Yi, L Dublois, T Hanaka, M Khosravian Ghadikolaei, M Lampis, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020
32020
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs
S Chakraborty, S Jo, K Sadakane, SR Satti
International Conference on Combinatorial Optimization and Applications, 416-430, 2021
22021
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
S Chakraborty, S Jo
Theoretical Computer Science, 2022
1*2022
The system can't perform the operation now. Try again later.
Articles 1–20