| Improved space efficient algorithms for BFS, DFS and applications N Banerjee, S Chakraborty, V Raman Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho …, 2016 | 30 | 2016 |
| 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 | 23* | 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 | 22 | 2018 |
| 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 | 18 | 2015 |
| A framework for in-place graph algorithms S Chakraborty, A Mukherjee, V Raman, SR Satti 26th Annual European Symposium on Algorithms (ESA 2018), 2018 | 16* | 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 | 16 | 2017 |
| 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 | 15 | 2016 |
| 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 | 13 | 2017 |
| 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 | 12 | 2019 |
| Improved space-efficient linear time algorithms for some classical graph problems S Chakraborty, S Jo, SR Satti arXiv preprint arXiv:1712.03349, 2017 | 10 | 2017 |
| Succinct data structures for small clique-width graphs S Chakraborty, S Jo, K Sadakane, SR Satti 2021 Data Compression Conference (DCC), 133-142, 2021 | 7 | 2021 |
| 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 |
| 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 | 5 | 2023 |
| Indexing graph search trees and applications S Chakraborty, K Sadakane arXiv preprint arXiv:1906.07871, 2019 | 5 | 2019 |
| Optimal in-place algorithms for basic graph problems S Chakraborty, K Sadakane, SR Satti Combinatorial Algorithms: 31st International Workshop, IWOCA 2020, Bordeaux …, 2020 | 4 | 2020 |
| Space efficient algorithms for breadth-depth search S Chakraborty, A Mukherjee, SR Satti Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019 …, 2019 | 4 | 2019 |
| Space efficient graph algorithms S Chakraborty PhD thesis. The Institute of Mathematical Sciences, HBNI, India, 2018 | 4 | 2018 |
| 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 | 3 | 2022 |
| Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs S Chakraborty, S Jo, K Sadakane, SR Satti Combinatorial Optimization and Applications: 15th International Conference …, 2021 | 3 | 2021 |
| 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 | 3 | 2020 |
Srinivasa Rao SattiProfessor, NTNUVerified email at ntnu.no
