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
312016
Succinct data structures for families of interval graphs
H Acan, S Chakraborty, S Jo, SR Satti
Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019
30*2019
Space efficient linear time algorithms for BFS, DFS and applications
N Banerjee, S Chakraborty, V Raman, SR Satti
Theory of Computing Systems 62, 1736-1762, 2018
252018
Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs
N Banerjee, S Chakraborty, V Raman, S Roy, S Saurabh
Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015
182015
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, its applications, and variants of BFS
S Chakraborty, SR Satti
Journal of Combinatorial Optimization 37, 465-481, 2019
132019
Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications
S Chakraborty, SR Satti
Computing and Combinatorics: 23rd International Conference, COCOON 2017 …, 2017
132017
Succinct Representations for (Non) Deterministic Finite Automata
S Chakraborty, R Grossi, K Sadakane, SR Satti
International Conference on Language and Automata Theory and Applications, 55-67, 2021
102021
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
92021
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
9*2021
Space-efficient data structure for posets with applications
T Yanagita, S Chakraborty, K Sadakane, SR Satti
18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), 2022
62022
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
S Chakraborty, S Jo
Theoretical Computer Science 941, 156-166, 2023
5*2023
Indexing graph search trees and applications
S Chakraborty, K Sadakane
arXiv preprint arXiv:1906.07871, 2019
52019
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
42021
Optimal in-place algorithms for basic graph problems
S Chakraborty, K Sadakane, SR Satti
International Workshop on Combinatorial Algorithms, 126-139, 2020
42020
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
4*2020
Space efficient algorithms for breadth-depth search
S Chakraborty, A Mukherjee, SR Satti
International Symposium on Fundamentals of Computation Theory, 201-212, 2019
42019
The system can't perform the operation now. Try again later.
Articles 1–20