| Publication | Date of Publication | Type |
|---|
| Succinct data structures for SP, block-cactus and \(3\)-leaf power graphs | 2024-09-24 | Paper |
| Energy efficient sorting, selection and searching | 2024-06-03 | 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 |
| Energy efficient sorting, selection and searching | 2023-11-24 | Paper |
| Enumerating Range Modes | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6159897 | 2023-06-23 | Paper |
| Finding kings in tournaments | 2022-10-13 | 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 |
| Approximate query processing over static sets and sliding windows | 2022-07-21 | Paper |
| Encoding two-dimensional range top-\(k\) queries revisited | 2022-07-21 | Paper |
| Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs | 2022-06-29 | Paper |
| Encoding two-dimensional range top-\(k\) queries | 2021-11-19 | Paper |
| Frameworks for designing in-place graph algorithms | 2021-10-28 | Paper |
| Succinct representations for (non)deterministic finite automata | 2021-10-04 | Paper |
| Approximate query processing over static sets and sliding windows | 2021-09-06 | Paper |
| A framework for in-place graph algorithms | 2021-08-04 | Paper |
| Succinct encodings for families of interval graphs | 2021-04-08 | Paper |
| Synergistic solutions on multisets | 2020-05-25 | 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 |
| The complexity of finding (approximate sized) distance-\(d\) dominating set in tournaments | 2019-04-26 | Paper |
| Maintaining chordal graphs dynamically: improved upper and lower bounds | 2018-11-28 | Paper |
| Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets | 2018-11-05 | Paper |
| Asymptotically optimal encodings of range data structures for selection and top-\(k\) queries | 2018-11-05 | Paper |
| Minimum transactions problem | 2018-10-04 | 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 |
| Encoding two-dimensional range top-\(k\) queries | 2017-10-17 | Paper |
| Random access to grammar-compressed strings | 2017-09-29 | Paper |
| Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits | 2017-09-15 | Paper |
| On succinct representations of binary trees | 2017-07-17 | Paper |
| Asymptotically optimal encodings for range selection | 2017-04-25 | Paper |
| Simultaneous encodings for range and next/previous larger/smaller value queries | 2016-11-24 | Paper |
| Two dimensional range minimum queries and Fibonacci lattices | 2016-06-16 | Paper |
| Finding mode using equality comparisons | 2016-05-03 | Paper |
| Succinct dynamic cardinal trees | 2016-03-29 | Paper |
| Space efficient data structures for nearest larger neighbor | 2016-02-18 | Paper |
| Near-optimal online multiselection in internal and external memory | 2016-02-18 | Paper |
| Encoding 2D range maximum queries | 2015-12-08 | Paper |
| Sorting and selection with equality comparisons | 2015-10-30 | Paper |
| Simultaneous encodings for range and next/previous larger/smaller value queries | 2015-10-29 | Paper |
| Space efficient data structures for nearest larger neighbor | 2015-09-15 | Paper |
| Random access to grammar-compressed strings and trees | 2015-06-11 | Paper |
| Compact encodings and indexes for the nearest larger neighbor problem | 2015-02-27 | Paper |
| Dynamic online multiselection in internal and external memory | 2015-02-27 | Paper |
| Selection from read-only memory with limited workspace | 2014-10-06 | Paper |
| Succinct indexes for strings, binary relations and multilabeled trees | 2014-09-09 | Paper |
| Succinct ordinal trees based on tree covering | 2014-09-09 | Paper |
| Integer representations towards efficient counting in the bit probe model | 2014-04-28 | Paper |
| Selection from read-only memory with limited workspace | 2013-06-11 | Paper |
| Succinct representations of binary trees for range minimum queries | 2012-09-25 | Paper |
| Encoding 2D range maximum queries | 2011-12-16 | Paper |
