Sankardeep Chakraborty

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