The following pages link to Sankardeep Chakraborty (Q2079876):
Displaying 21 items.
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Succinct data structures for families of interval graphs (Q2285077) (← links)
- Space efficient algorithms for breadth-depth search (Q2291421) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications (Q2412402) (← links)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number (Q2680858) (← links)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs (Q3196398) (← links)
- Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits (Q4636504) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- (Q5092430) (← links)
- Enumerating Range Modes (Q6065431) (← links)
- Succinct data structure for path graphs (Q6178455) (← links)
- Succinct data structures for bounded clique-width graphs (Q6497944) (← links)
