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
232016
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
142016
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
142015
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
132018
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
132017
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
112017
A framework for in-place graph algorithms
S Chakraborty, A Mukherjee, V Raman, SR Satti
26th Annual European Symposium on Algorithms (ESA 2018), 2018
92018
Improved space-efficient linear time algorithms for some classical graph problems
S Chakraborty, S Jo, SR Satti
arXiv preprint arXiv:1712.03349, 2017
82017
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
72019
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
72019
Indexing graph search trees and applications
S Chakraborty, K Sadakane
arXiv preprint arXiv:1906.07871, 2019
22019
Frameworks for Designing In-place Graph Algorithms
S Chakraborty, A Mukherjee, V Raman, SR Satti
arXiv preprint arXiv:1711.09859, 2017
22017
Optimal in-place algorithms for basic graph problems
S Chakraborty, K Sadakane, SR Satti
International Workshop on Combinatorial Algorithms, 126-139, 2020
12020
Succinct Encodings for Families of Interval Graphs
H Acan, S Chakraborty, S Jo, SR Satti
Algorithmica, 1-19, 2020
12020
Space efficient algorithms for breadth-depth search
S Chakraborty, A Mukherjee, SR Satti
International Symposium on Fundamentals of Computation Theory, 201-212, 2019
12019
Succinct representation for (non) deterministic finite automata
S Chakraborty, R Grossi, K Sadakane, SR Satti
arXiv preprint arXiv:1907.09271, 2019
12019
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle
H Acan, S Chakraborty, S Jo, K Nakashima, K Sadakane, SR Satti
arXiv preprint arXiv:2010.04333, 2020
2020
Enumerating Range Modes
K Sumigawa, S Chakraborty, K Sadakane, SR Satti
arXiv preprint arXiv:1907.10984, 2019
2019
Space Efficient Processing for Label-Constrained Graph Reachability Queries
S Chakraborty, MS Najafi, SR Satti
한국정보과학회 학술발표논문집, 1539-1541, 2019
2019
Space efficient graph algorithms [HBNI Th 134]
SD Chakraborty
2018
The system can't perform the operation now. Try again later.
Articles 1–20