Available identifiers
zbMath Open chakraborty.sankardeep MaRDI QID Q2079876
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv . We are working on additional sources - please check back here soon!
Publication Date of Publication Type Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs 2024-09-24 Paper Space-efficient data structure for posets with applications 2024-05-27 Paper Succinct data structures for bounded clique-width graphs 2024-05-06 Paper Succinct data structure for path graphs 2024-01-18 Paper Enumerating Range Modes 2023-11-14 Paper Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number 2023-01-04 Paper Succinct representation for (non)deterministic finite automata 2022-10-13 Paper Optimal In-place Algorithms for Basic Graph Problems 2022-10-13 Paper Succinct navigational oracles for families of intersection graphs on a circle 2022-10-07 Paper https://portal.mardi4nfdi.de/entity/Q5092430 2022-07-21 Paper Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs 2022-06-29 Paper Frameworks for designing in-place graph algorithms 2021-10-28 Paper Succinct representations for (non)deterministic finite automata 2021-10-04 Paper A Framework for In-place Graph Algorithms 2021-08-04 Paper Succinct encodings for families of interval graphs 2021-04-08 Paper Space efficient algorithms for breadth-depth search 2020-01-30 Paper Succinct data structures for families of interval graphs 2020-01-16 Paper Space efficient linear time algorithms for BFS, DFS and applications 2019-09-05 Paper Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS 2019-06-06 Paper Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits 2018-04-19 Paper Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications 2017-10-23 Paper Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits 2017-09-15 Paper Improved Space Efficient Algorithms for BFS, DFS and Applications 2016-09-02 Paper Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs 2015-10-29 Paper
Research outcomes over time
This page was built for person: Sankardeep Chakraborty
