Sankardeep Chakraborty

According to our database, Sankardeep Chakraborty authored at least 35 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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., September, 2024

Succinct data structure for path graphs.

Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane

Inf. Comput., January, 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 Chordal Graphs with Bounded Vertex Leafage.

Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Enhancing Generalized Compressed Suffix Trees, with Applications.

Sankardeep Chakraborty, Kunihiko Sadakane, Wiktor Zuba

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Succinct Data Structures for Baxter Permutation and Related Families.

Sankardeep Chakraborty, Seungbum Jo, Geunho Kim, Kunihiko Sadakane

Proceedings of the 35th International Symposium on Algorithms and Computation, 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

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Succinct Data Structure for Graphs with d-Dimensional t-Representation.

Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane

Proceedings of the Data Compression Conference, 2024

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 representation for (non)deterministic finite automata.

Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti

J. Comput. Syst. Sci., 2023

Cell-Probe Lower Bound for Accessible Interval Graphs.

Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu

CoRR, 2023

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

Frameworks for designing in-place graph algorithms.

Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti

J. Comput. Syst. Sci., 2022

Space-Efficient Data Structure for Posets with Applications.

Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number.

Sankardeep Chakraborty, Seungbum Jo

Proceedings of the Data Compression Conference, 2022

Lower Bounds for Lexicographical DFS Data Structures.

Sankardeep Chakraborty, Christian Engels

Proceedings of the Data Compression Conference, 2022

2021

Succinct Encodings for Families of Interval Graphs.

Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti

Algorithmica, 2021

Succinct Representations for (Non)Deterministic Finite Automata.

Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti

Proceedings of the Language and Automata Theory and Applications, 2021

Succinct Data Structures for Small Clique-Width Graphs.

Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti

Proceedings of the 31st Data Compression Conference, 2021

Succinct representations of Intersection Graphs on a Circle.

Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti

Proceedings of the 31st Data Compression Conference, 2021

Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs.

Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Optimal In-place Algorithms for Basic Graph Problems.

Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Enumerating Range Modes.

Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS.

Sankardeep Chakraborty, Srinivasa Rao Satti

J. Comb. Optim., 2019

Succinct Data Structures for Families of Interval Graphs.

Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Indexing Graph Search Trees and Applications.

Sankardeep Chakraborty, Kunihiko Sadakane

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Space Efficient Algorithms for Breadth-Depth Search.

Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018

Space Efficient Linear Time Algorithms for BFS, DFS and Applications.

Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti

Theory Comput. Syst., 2018

A Framework for In-place Graph Algorithms.

Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Biconnectivity, st-numbering and other applications of DFS using O(n) bits.

Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti

J. Comput. Syst. Sci., 2017

Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems.

Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti

CoRR, 2017

Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications.

Sankardeep Chakraborty, Srinivasa Rao Satti

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits.

Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Improved Space Efficient Algorithms for BFS, DFS and Applications.

Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs.

Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Sasanka Roy, Saket Saurabh

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015