Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001; Sasanka Roy; Saket Saurabh 001 (COCOON, 2015)

Improved Space Efficient Algorithms for BFS, DFS and Applications. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001 (COCOON, 2016)

Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. - Sankardeep Chakraborty; Venkatesh Raman 001; Srinivasa Rao Satti (ISAAC, 2016)

Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. - Sankardeep Chakraborty; Srinivasa Rao Satti (COCOON, 2017)

Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems. - Sankardeep Chakraborty; Seungbum Jo; Srinivasa Rao Satti (CoRR, 2017)

Biconnectivity, st-numbering and other applications of DFS using O(n) bits. - Sankardeep Chakraborty; Venkatesh Raman 001; Srinivasa Rao Satti (J. Comput. Syst. Sci., 2017)

A Framework for In-place Graph Algorithms. - Sankardeep Chakraborty; Anish Mukherjee 001; Venkatesh Raman 001; Srinivasa Rao Satti (ESA, 2018)

Space Efficient Linear Time Algorithms for BFS, DFS and Applications. - Niranka Banerjee; Sankardeep Chakraborty; Venkatesh Raman 001; Srinivasa Rao Satti (Theory Comput. Syst., 2018)

Space Efficient Algorithms for Breadth-Depth Search. - Sankardeep Chakraborty; Anish Mukherjee 001; Srinivasa Rao Satti (FCT, 2019)

Indexing Graph Search Trees and Applications. - Sankardeep Chakraborty; Kunihiko Sadakane (MFCS, 2019)

Succinct Data Structures for Families of Interval Graphs. - Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo; Srinivasa Rao Satti (WADS, 2019)

Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS. - Sankardeep Chakraborty; Srinivasa Rao Satti (J. Comb. Optim., 2019)

Enumerating Range Modes. - Kentaro Sumigawa; Sankardeep Chakraborty; Kunihiko Sadakane; Srinivasa Rao Satti (ISAAC, 2020)

Optimal In-place Algorithms for Basic Graph Problems. - Sankardeep Chakraborty; Kunihiko Sadakane; Srinivasa Rao Satti (IWOCA, 2020)

Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. - Sankardeep Chakraborty; Seungbum Jo; Kunihiko Sadakane; Srinivasa Rao Satti (COCOA, 2021)

Succinct representations of Intersection Graphs on a Circle. - Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo; Kei Nakashima; Kunihiko Sadakane; Srinivasa Rao Satti (DCC, 2021)

Succinct Data Structures for Small Clique-Width Graphs. - Sankardeep Chakraborty; Seungbum Jo; Kunihiko Sadakane; Srinivasa Rao Satti (DCC, 2021)

Succinct Representations for (Non)Deterministic Finite Automata. - Sankardeep Chakraborty; Roberto Grossi; Kunihiko Sadakane; Srinivasa Rao Satti (LATA, 2021)

Succinct Encodings for Families of Interval Graphs. - Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo; Srinivasa Rao Satti (Algorithmica, 2021)

Lower Bounds for Lexicographical DFS Data Structures. - Sankardeep Chakraborty; Christian Engels (DCC, 2022)

Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number. - Sankardeep Chakraborty; Seungbum Jo (DCC, 2022)

Space-Efficient Data Structure for Posets with Applications. - Tatsuya Yanagita; Sankardeep Chakraborty; Kunihiko Sadakane; Srinivasa Rao Satti (SWAT, 2022)

Frameworks for designing in-place graph algorithms. - Sankardeep Chakraborty; Anish Mukherjee 001; Venkatesh Raman 001; Srinivasa Rao Satti (J. Comput. Syst. Sci., 2022)

Succinct navigational oracles for families of intersection graphs on a circle. - Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo; Kei Nakashima; Kunihiko Sadakane; Srinivasa Rao Satti (Theor. Comput. Sci., 2022)

Cell-Probe Lower Bound for Accessible Interval Graphs. - Sankardeep Chakraborty; Christian Engels; Seungbum Jo; Mingmou Liu (CoRR, 2023)

Succinct representation for (non)deterministic finite automata. - Sankardeep Chakraborty; Roberto Grossi; Kunihiko Sadakane; Srinivasa Rao Satti (J. Comput. Syst. Sci., 2023)

Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number. - Sankardeep Chakraborty; Seungbum Jo (Theor. Comput. Sci., 2023)

Succinct Data Structure for Graphs with d-Dimensional t-Representation. - Girish Balakrishnan; Sankardeep Chakraborty; Seungbum Jo; N. S. Narayanaswamy; Kunihiko Sadakane (DCC, 2024)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. - Kou Hamada; Sankardeep Chakraborty; Seungbum Jo; Takuto Koriyama; Kunihiko Sadakane; Srinivasa Rao Satti (ESA, 2024)

Succinct Data Structures for Baxter Permutation and Related Families. - Sankardeep Chakraborty; Seungbum Jo; Geunho Kim 001; Kunihiko Sadakane (ISAAC, 2024)

Enhancing Generalized Compressed Suffix Trees, with Applications. - Sankardeep Chakraborty; Kunihiko Sadakane; Wiktor Zuba (ISAAC, 2024)

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. - Girish Balakrishnan; Sankardeep Chakraborty; N. S. Narayanaswamy; Kunihiko Sadakane (SWAT, 2024)

Succinct data structures for bounded clique-width graphs. - Sankardeep Chakraborty; Seungbum Jo; Kunihiko Sadakane; Srinivasa Rao Satti (Discret. Appl. Math., 2024)

Succinct data structure for path graphs. - Girish Balakrishnan; Sankardeep Chakraborty; N. S. Narayanaswamy; Kunihiko Sadakane (Inf. Comput., 2024)

Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs. - Sankardeep Chakraborty; Seungbum Jo; Kunihiko Sadakane; Srinivasa Rao Satti (Int. J. Found. Comput. Sci., 2024)