Theory and Implementation of Online Multiselection Algorithms. - Jérémy Barbay; Ankur Gupta 003; Seungbum Jo; Srinivasa Rao Satti; Jonathan P. Sorenson (ESA, 2013)

Space Efficient Data Structures for Nearest Larger Neighbor. - Varunkumar Jayapaul; Seungbum Jo; Venkatesh Raman 001; Srinivasa Rao Satti (IWOCA, 2014)

Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. - Seungbum Jo; Rajeev Raman; Srinivasa Rao Satti (WALCOM, 2015)

Space efficient data structures for nearest larger neighbor. - Varunkumar Jayapaul; Seungbum Jo; Rajeev Raman; Venkatesh Raman 001; Srinivasa Rao Satti (J. Discrete Algorithms, 2016)

Simultaneous encodings for range and next/previous larger/smaller value queries. - Seungbum Jo; Srinivasa Rao Satti (Theor. Comput. Sci., 2016)

Compressed Bit vectors Based on Variable-to-Fixed Encodings. - Seungbum Jo; Stelios Joannou; Daisuke Okanohara; Rajeev Raman; Srinivasa Rao Satti (Comput. J., 2017)

Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems. - Sankardeep Chakraborty; Seungbum Jo; Srinivasa Rao Satti (CoRR, 2017)

Encoding Two-Dimensional Range Top-k Queries Revisited. - Seungbum Jo; Srinivasa Rao Satti (ISAAC, 2018)

Compressed Range Minimum Queries. - Seungbum Jo; Shay Mozes; Oren Weimann (SPIRE, 2018)

An architecture for online-diagnosis systems supporting compressed communication. - Seungbum Jo; Markus Lohrey; Damian Ludwig; Simon Meckel; Roman Obermaisser; Simon Plasger (Microprocess. Microsystems, 2018)

Succinct Data Structures for Families of Interval Graphs. - Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo; Srinivasa Rao Satti (WADS, 2019)

Combined compression of multiple correlated data streams for online-diagnosis systems. - Simon Meckel; Markus Lohrey; Seungbum Jo; Roman Obermaisser; Simon Plasger (Microprocess. Microsystems, 2020)

Compressed range minimum queries. - Pawel Gawrychowski; Seungbum Jo; Shay Mozes; Oren Weimann (Theor. Comput. Sci., 2020)

Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. - Sankardeep Chakraborty; Seungbum Jo; Kunihiko Sadakane; Srinivasa Rao Satti (COCOA, 2021)

Succinct representations of Intersection Graphs on a Circle. - Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo; Kei Nakashima; Kunihiko Sadakane; Srinivasa Rao Satti (DCC, 2021)

Succinct Data Structures for Small Clique-Width Graphs. - Sankardeep Chakraborty; Seungbum Jo; Kunihiko Sadakane; Srinivasa Rao Satti (DCC, 2021)

Succinct Encodings for Families of Interval Graphs. - Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo; Srinivasa Rao Satti (Algorithmica, 2021)

Encoding Two-Dimensional Range Top-k Queries. - Seungbum Jo; Rahul Lingala; Srinivasa Rao Satti (Algorithmica, 2021)

Approximate query processing over static sets and sliding windows. - Ran Ben Basat; Seungbum Jo; Srinivasa Rao Satti; Shubham Ugare (Theor. Comput. Sci., 2021)

Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number. - Sankardeep Chakraborty; Seungbum Jo (DCC, 2022)

Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries. - Seungbum Jo; Geunho Kim 001 (LATIN, 2022)

Succinct navigational oracles for families of intersection graphs on a circle. - Hüseyin Acan; Sankardeep Chakraborty; Seungbum Jo; Kei Nakashima; Kunihiko Sadakane; Srinivasa Rao Satti (Theor. Comput. Sci., 2022)

Practical Implementations of Compressed RAM. - Seungbum Jo; Wooyoung Park; Kunihiko Sadakane; Srinivasa Rao Satti (DCC, 2023)

Cell-Probe Lower Bound for Accessible Interval Graphs. - Sankardeep Chakraborty; Christian Engels; Seungbum Jo; Mingmou Liu (CoRR, 2023)

Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number. - Sankardeep Chakraborty; Seungbum Jo (Theor. Comput. Sci., 2023)

Practical Implementation of Encoding Range Top-2 Queries. - Wooyoung Park; Seungbum Jo; Srinivasa Rao Satti (Comput. J., 2023)

Succinct Data Structure for Graphs with d-Dimensional t-Representation. - Girish Balakrishnan; Sankardeep Chakraborty; Seungbum Jo; N. S. Narayanaswamy; Kunihiko Sadakane (DCC, 2024)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. - Kou Hamada; Sankardeep Chakraborty; Seungbum Jo; Takuto Koriyama; Kunihiko Sadakane; Srinivasa Rao Satti (ESA, 2024)

Succinct Data Structures for Baxter Permutation and Related Families. - Sankardeep Chakraborty; Seungbum Jo; Geunho Kim 001; Kunihiko Sadakane (ISAAC, 2024)

Succinct data structures for bounded clique-width graphs. - Sankardeep Chakraborty; Seungbum Jo; Kunihiko Sadakane; Srinivasa Rao Satti (Discret. Appl. Math., 2024)

Energy efficient sorting, selection and searching. - Varunkumar Jayapaul; Seungbum Jo; Krishna V. Palem; Srinivasa Rao Satti (Theor. Comput. Sci., 2024)

Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs. - Sankardeep Chakraborty; Seungbum Jo; Kunihiko Sadakane; Srinivasa Rao Satti (Int. J. Found. Comput. Sci., 2024)

Encoding Data Structures for Range Queries on Arrays. - Seungbum Jo; Srinivasa Rao Satti (From Strings to Graphs, and Back Again, 2025)

Encodings for Range Minimum Queries over Bounded Alphabets. - Seungbum Jo; Srinivasa Rao Satti (CPM, 2025)

Space-Efficient Data Structure for Next/Previous Larger/Smaller Value Queries. - Seungbum Jo; Geunho Kim (Algorithmica, 2025)