| Publication | Date of Publication | Type |
|---|
Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs
International Journal of Foundations of Computer Science | 2024-09-24 | Paper |
Space-efficient data structure for posets with applications
| 2024-05-27 | Paper |
Succinct data structures for bounded clique-width graphs
Discrete Applied Mathematics | 2024-05-06 | Paper |
Succinct data structure for path graphs
Information and Computation | 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
Theoretical Computer Science | 2023-01-04 | Paper |
Succinct representation for (non)deterministic finite automata
Journal of Computer and System Sciences | 2022-10-13 | Paper |
Optimal In-place Algorithms for Basic Graph Problems
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Succinct navigational oracles for families of intersection graphs on a circle
Theoretical Computer Science | 2022-10-07 | Paper |
Indexing graph search trees and applications
| 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
Journal of Computer and System Sciences | 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
Algorithmica | 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
Theory of Computing Systems | 2019-09-05 | Paper |
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS
Journal of Combinatorial Optimization | 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
Journal of Computer and System Sciences | 2017-09-15 | Paper |
Improved space efficient algorithms for BFS, DFS and applications
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Time-space tradeoffs for dynamic programming algorithms in trees and bounded treewidth graphs
Lecture Notes in Computer Science | 2015-10-29 | Paper |
