research
∙
07/06/2023
Shortest Beer Path Queries based on Graph Decomposition
Given a directed edge-weighted graph G=(V, E) with beer vertices B⊆ V, a...
share
research
∙
11/08/2021
Succinct Data Structure for Path Graphs
We consider the problem of designing a succinct data structure for path ...
research
∙
10/04/2021
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns
The run-length compressed Burrows-Wheeler transform (RLBWT) used in conj...
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...
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
∙
04/09/2020
Storing Set Families More Compactly with Top ZDDs
Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for ...
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
Indexing Graph Search Trees and Applications
We consider the problem of compactly representing the Depth First Search...
research
∙
02/15/2018