![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Sankardeep Chakraborty
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j10]Sankardeep Chakraborty, Seungbum Jo
, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct data structures for bounded clique-width graphs. Discret. Appl. Math. 352: 55-68 (2024) - [j9]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct data structure for path graphs. Inf. Comput. 296: 105124 (2024) - 2023
- [j8]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane
, Srinivasa Rao Satti
:
Succinct representation for (non)deterministic finite automata. J. Comput. Syst. Sci. 131: 1-12 (2023) - [j7]Sankardeep Chakraborty, Seungbum Jo
:
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number. Theor. Comput. Sci. 941: 156-166 (2023) - 2022
- [j6]Sankardeep Chakraborty, Anish Mukherjee
, Venkatesh Raman, Srinivasa Rao Satti:
Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci. 123: 1-19 (2022) - [j5]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: 151-166 (2022) - 2021
- [j4]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo
, Srinivasa Rao Satti:
Succinct Encodings for Families of Interval Graphs. Algorithmica 83(3): 776-794 (2021) - 2019
- [j3]Sankardeep Chakraborty, Srinivasa Rao Satti
:
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS. J. Comb. Optim. 37(2): 465-481 (2019) - 2018
- [j2]Niranka Banerjee, Sankardeep Chakraborty
, Venkatesh Raman, Srinivasa Rao Satti:
Space Efficient Linear Time Algorithms for BFS, DFS and Applications. Theory Comput. Syst. 62(8): 1736-1762 (2018) - 2017
- [j1]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, st-numbering and other applications of DFS using O(n) bits. J. Comput. Syst. Sci. 90: 63-79 (2017)
Conference and Workshop Papers
- 2024
- [c20]Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. DCC 2024: 546 - [c19]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. SWAT 2024: 4:1-4:16 - 2022
- [c18]Sankardeep Chakraborty, Seungbum Jo:
Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number. DCC 2022: 103-112 - [c17]Girish Balakrishnan, N. S. Narayanaswamy, Sankardeep Chakraborty, Kunihiko Sadakane
:
Succinct Data Structure for Path Graphs. DCC 2022: 262-271 - [c16]Sankardeep Chakraborty, Christian Engels:
Lower Bounds for Lexicographical DFS Data Structures. DCC 2022: 449 - [c15]Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Space-Efficient Data Structure for Posets with Applications. SWAT 2022: 33:1-33:16 - 2021
- [c14]Sankardeep Chakraborty
, Seungbum Jo
, Kunihiko Sadakane
, Srinivasa Rao Satti
:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA 2021: 416-430 - [c13]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane
, Srinivasa Rao Satti:
Succinct representations of Intersection Graphs on a Circle. DCC 2021: 123-132 - [c12]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane
, Srinivasa Rao Satti:
Succinct Data Structures for Small Clique-Width Graphs. DCC 2021: 133-142 - [c11]Sankardeep Chakraborty
, Roberto Grossi
, Kunihiko Sadakane
, Srinivasa Rao Satti
:
Succinct Representations for (Non)Deterministic Finite Automata. LATA 2021: 55-67 - 2020
- [c10]Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane
, Srinivasa Rao Satti
:
Enumerating Range Modes. ISAAC 2020: 29:1-29:16 - [c9]Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Optimal In-place Algorithms for Basic Graph Problems. IWOCA 2020: 126-139 - 2019
- [c8]Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti:
Space Efficient Algorithms for Breadth-Depth Search. FCT 2019: 201-212 - [c7]Sankardeep Chakraborty, Kunihiko Sadakane:
Indexing Graph Search Trees and Applications. MFCS 2019: 67:1-67:14 - [c6]Hüseyin Acan
, Sankardeep Chakraborty, Seungbum Jo
, Srinivasa Rao Satti
:
Succinct Data Structures for Families of Interval Graphs. WADS 2019: 1-13 - 2018
- [c5]Sankardeep Chakraborty, Anish Mukherjee
, Venkatesh Raman, Srinivasa Rao Satti:
A Framework for In-place Graph Algorithms. ESA 2018: 13:1-13:16 - 2017
- [c4]Sankardeep Chakraborty, Srinivasa Rao Satti:
Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. COCOON 2017: 87-98 - 2016
- [c3]Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman:
Improved Space Efficient Algorithms for BFS, DFS and Applications. COCOON 2016: 119-130 - [c2]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. ISAAC 2016: 22:1-22:13 - 2015
- [c1]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: 349-360
Informal and Other Publications
- 2024
- [i17]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. CoRR abs/2402.03748 (2024) - [i16]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 abs/2407.00573 (2024) - 2023
- [i15]Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. CoRR abs/2311.02427 (2023) - [i14]Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu:
Cell-Probe Lower Bound for Accessible Interval Graphs. CoRR abs/2311.02839 (2023) - 2021
- [i13]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. CoRR abs/2108.10776 (2021) - [i12]Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Path Graphs. CoRR abs/2111.04332 (2021) - 2020
- [i11]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 abs/2010.04333 (2020) - 2019
- [i10]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. CoRR abs/1902.09228 (2019) - [i9]Sankardeep Chakraborty, Kunihiko Sadakane:
Indexing Graph Search Trees and Applications. CoRR abs/1906.07871 (2019) - [i8]Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti:
Space Efficient Algorithms for Breadth-Depth Search. CoRR abs/1906.07874 (2019) - [i7]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Representation for (Non)Deterministic Finite Automata. CoRR abs/1907.09271 (2019) - [i6]Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Optimal In-place Algorithms for Basic Graph Problems. CoRR abs/1907.09280 (2019) - [i5]Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Enumerating Range Modes. CoRR abs/1907.10984 (2019) - 2017
- [i4]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
Frameworks for Designing In-place Graph Algorithms. CoRR abs/1711.09859 (2017) - [i3]Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems. CoRR abs/1712.03349 (2017) - 2016
- [i2]Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman:
Improved Space efficient algorithms for BFS, DFS and applications. CoRR abs/1606.04718 (2016) - [i1]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits. CoRR abs/1606.08645 (2016)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-11 01:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint