| Succinct encodings for families of interval graphs H Acan, S Chakraborty, S Jo, SR Satti Algorithmica 83 (3), 776-794, 2021 | 42* | 2021 |
| Succinct data structures for bounded clique-width graphs S Chakraborty, S Jo, K Sadakane, SR Satti Discrete Applied Mathematics 352, 55-68, 2024 | 15* | 2024 |
| Compressed range minimum queries P Gawrychowski, S Jo, S Mozes, O Weimann Theoretical Computer Science 812, 39-48, 2020 | 15* | 2020 |
| Succinct navigational oracles for families of intersection graphs on a circle H Acan, S Chakraborty, S Jo, K Nakashima, K Sadakane, SR Satti Theoretical Computer Science 928, 151-166, 2022 | 13* | 2022 |
| Improved space-efficient linear time algorithms for some classical graph problems S Chakraborty, S Jo, SR Satti arXiv preprint arXiv:1712.03349, 2017 | 12 | 2017 |
| Succinct Data Structures for SP, Block-Cactus and -Leaf Power Graphs S Chakraborty, S Jo, K Sadakane, SR Satti International Journal of Foundations of Computer Science 35 (06), 705-722, 2024 | 11* | 2024 |
| 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 | 11* | 2023 |
| Space efficient data structures for nearest larger neighbor V Jayapaul, S Jo, R Raman, V Raman, SR Satti Journal of Discrete Algorithms 36, 63-75, 2016 | 11 | 2016 |
| Encoding Two-Dimensional Range Top-k Queries S Jo, R Lingala, SR Satti Algorithmica 83, 3379-3402, 2021 | 9 | 2021 |
| An architecture for online-diagnosis systems supporting compressed communication S Jo, M Lohrey, D Ludwig, S Meckel, R Obermaisser, S Plasger Microprocessors and Microsystems 61, 242-256, 2018 | 8 | 2018 |
| Compressed bit vectors based on variable-to-fixed encodings S Jo, S Joannou, D Okanohara, R Raman, SR Satti The Computer Journal 60 (5), 761-775, 2017 | 6 | 2017 |
| Theory and implementation of online multiselection algorithms J Barbay, A Gupta, S Jo, SS Rao, J Sorenson European Symposium on Algorithms, 109-120, 2013 | 6 | 2013 |
| Simultaneous encodings for range and next/previous larger/smaller value queries S Jo, SR Satti Theoretical Computer Science 654, 80-91, 2016 | 5 | 2016 |
| Compact encodings and indexes for the nearest larger neighbor problem S Jo, R Raman, S Rao Satti International Workshop on Algorithms and Computation, 53-64, 2015 | 5* | 2015 |
| Succinct Data Structure for Graphs with -Dimensional -Representation G Balakrishnan, S Chakraborty, S Jo, NS Narayanaswamy, K Sadakane arXiv preprint arXiv:2311.02427, 2023 | 3 | 2023 |
| Space-efficient data structure for next/previous larger/smaller value queries S Jo, G Kim Algorithmica, 1-24, 2025 | 2 | 2025 |
| Combined compression of multiple correlated data streams for online-diagnosis systems S Meckel, M Lohrey, S Jo, R Obermaisser, S Plasger Microprocessors and Microsystems 77, 103184, 2020 | 2 | 2020 |
| Encoding two-dimensional range top-k queries revisited S Jo, SR Satti 29th International Symposium on Algorithms and Computation (ISAAC 2018), 69 …, 2018 | 2 | 2018 |
| Succinct data structures for baxter permutation and related families S Chakraborty, S Jo, G Kim, K Sadakane arXiv preprint arXiv:2409.16650, 2024 | 1 | 2024 |
| A simple representation of tree covering utilizing balanced parentheses and efficient implementation of average-case optimal rmqs K Hamada, S Chakraborty, S Jo, T Koriyama, K Sadakane, SR Satti arXiv preprint arXiv:2407.00573, 2024 | 1 | 2024 |
