462 citations · 502 across the 16 of their papers we have counts for
26 papers
Succinct Data Structures for Baxter Permutation and Related Families
Sankardeep Chakraborty, Seungbum Jo, Geunho Kim +1
A permutation is a Baxter permutation if and only if it does not contain either of the patterns and . Baxter permutations are one of the m…
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
Kou Hamada, Sankardeep Chakraborty, Seungbum Jo +3
Tree covering is a technique for decomposing a tree into smaller-sized trees with desirable properties, and has been employed in various succinct data structures. However, signific…
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Girish Balakrishnan, Sankardeep Chakraborty, N S Narayanaswamy +1
We improve the worst-case information theoretic lower bound of Munro and Wu (ISAAC 2018) for vertex unlabeled chordal graphs when vertex leafage is bounded and leafage is unbou…
Succinct Data Structure for Graphs with -Dimensional -Representation
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo +2
Erdős and West (Discrete Mathematics'85) considered the class of vertex intersection graphs which have a {\em -dimensional} {\em -representation}, that is, each vertex of…
Shortest Beer Path Queries based on Graph Decomposition
Tesshu Hanaka, Hirotaka Ono, Kunihiko Sadakane +1
Given a directed edge-weighted graph with beer vertices , a beer path between two vertices and is a path between and that visits at least o…
Succinct Data Structure for Path Graphs
Girish Balakrishnan, Sankardeep Chakraborty, N S Narayanaswamy +1
We consider the problem of designing a succinct data structure for {\it path graphs} (which are a proper subclass of chordal graphs and a proper superclass of interval graphs) on $…