Seungbum Jo

activity

20162026

most citedSuccinct Navigational Oracles for Families of Intersection Graphs on a Circle

1 citations · 1 across the 10 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Cell-Probe Lower Bound for Accessible Interval Graphs

Sankardeep Chakraborty, Christian Engels, Seungbum Jo +1

We spot a hole in the area of succinct data structures for graph classes from a universe of size at most $n^{n}$ . Very often, the input graph is labeled by the user in an arbitrary a…

cs.DS2023

Succinct Data Structure for Graphs with $d$ -Dimensional $t$ -Representation

Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo +2

Erdős and West (Discrete Mathematics'85) considered the class of $n$ vertex intersection graphs which have a {\em $d$ -dimensional} {\em $t$ -representation}, that is, each vertex of…

Cell-Probe Lower Bound for Accessible Interval Graphs

Succinct Data Structure for Graphs with d-Dimensional t-Representation

Succinct Data Structure for Graphs with $d$ -Dimensional $t$ -Representation