research
∙
08/24/2021
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs
We design succinct encodings of series-parallel, block-cactus and 3-leaf...
share
research
∙
10/09/2020
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle
We consider the problem of designing succinct navigational oracles, i.e....
research
∙
07/25/2019
Enumerating Range Modes
We consider the range mode problem where given a sequence and a query ra...
research
∙
07/22/2019
Optimal In-place Algorithms for Basic Graph Problems
We present linear time in-place algorithms for several basic and fundam...
research
∙
07/22/2019
Succinct Representation for (Non)Deterministic Finite Automata
Deterministic finite automata are one of the simplest and most practical...
research
∙
06/19/2019
Space Efficient Algorithms for Breadth-Depth Search
Continuing the recent trend, in this article we design several space-eff...
research
∙
02/25/2019
Succinct Data Structures for Families of Interval Graphs
We consider the problem of designing succinct data structures for interv...
research
∙
09/19/2018
Encoding two-dimensional range top-k queries revisited
We consider the problem of encoding two-dimensional arrays, whose elemen...
research
∙
09/14/2018
Approximate Query Processing over Static Sets and Sliding Windows
Indexing of static and dynamic sets is fundamental to a large set of app...
research
∙
12/09/2017
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems
This short note provides space-efficient linear time algorithms for comp...
research
∙
11/27/2017
