Sankardeep Chakraborty

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 46

Top Topics

Top Venues

J. Comput. Syst. Sci.

Publications

Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. CoRR (2024)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. SWAT (2024)
Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. CoRR (2024)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct data structure for path graphs. Inf. Comput. 296 (2024)
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Graphs with d-Dimensional t-Representation. DCC (2024)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct data structures for bounded clique-width graphs. Discret. Appl. Math. 352 (2024)
Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu
Cell-Probe Lower Bound for Accessible Interval Graphs. CoRR (2023)
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Graphs with d-Dimensional t-Representation. CoRR (2023)
Sankardeep Chakraborty, Seungbum Jo
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number. Theor. Comput. Sci. 941 (2023)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct representation for (non)deterministic finite automata. J. Comput. Syst. Sci. 131 (2023)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct navigational oracles for families of intersection graphs on a circle. Theor. Comput. Sci. 928 (2022)
Sankardeep Chakraborty, Christian Engels
Lower Bounds for Lexicographical DFS Data Structures. DCC (2022)
Sankardeep Chakraborty, Seungbum Jo
Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number. DCC (2022)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci. 123 (2022)
Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane
Succinct Data Structure for Path Graphs. DCC (2022)
Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Space-Efficient Data Structure for Posets with Applications. SWAT (2022)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. CoRR (2021)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Representations for (Non)Deterministic Finite Automata. LATA (2021)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA (2021)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct representations of Intersection Graphs on a Circle. DCC (2021)
Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane
Succinct Data Structure for Path Graphs. CoRR (2021)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Data Structures for Small Clique-Width Graphs. DCC (2021)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Succinct Encodings for Families of Interval Graphs. Algorithmica 83 (3) (2021)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle. CoRR (2020)
Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Optimal In-place Algorithms for Basic Graph Problems. IWOCA (2020)
Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Enumerating Range Modes. ISAAC (2020)
Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Enumerating Range Modes. CoRR (2019)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Representation for (Non)Deterministic Finite Automata. CoRR (2019)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Succinct Data Structures for Families of Interval Graphs. CoRR (2019)
Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
Space Efficient Algorithms for Breadth-Depth Search. FCT (2019)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Succinct Data Structures for Families of Interval Graphs. WADS (2019)
Sankardeep Chakraborty, Srinivasa Rao Satti
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS. J. Comb. Optim. 37 (2) (2019)
Sankardeep Chakraborty, Kunihiko Sadakane
Indexing Graph Search Trees and Applications. CoRR (2019)
Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
Space Efficient Algorithms for Breadth-Depth Search. CoRR (2019)
Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Optimal In-place Algorithms for Basic Graph Problems. CoRR (2019)
Sankardeep Chakraborty, Kunihiko Sadakane
Indexing Graph Search Trees and Applications. MFCS (2019)
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Space Efficient Linear Time Algorithms for BFS, DFS and Applications. Theory Comput. Syst. 62 (8) (2018)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
A Framework for In-place Graph Algorithms. ESA (2018)
Sankardeep Chakraborty, Srinivasa Rao Satti
Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. COCOON (2017)
Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems. CoRR (2017)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Frameworks for Designing In-place Graph Algorithms. CoRR (2017)
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Biconnectivity, st-numbering and other applications of DFS using O(n) bits. J. Comput. Syst. Sci. 90 (2017)
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits. CoRR (2016)
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman
Improved Space efficient algorithms for BFS, DFS and applications. CoRR (2016)
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman
Improved Space Efficient Algorithms for BFS, DFS and Applications. COCOON (2016)
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. ISAAC (2016)
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. COCOON (2015)