• Succinct Encodings for Families of Interval Graphs 

      Acan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2021)
      We consider the problem of designing succinct data structures for interval graphs with n vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time. Towards showing succinctness, ...
    • Succinct navigational oracles for families of intersection graphs on a circle 

      Acan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Nakashima, Kei; Sadakane, Kunihiko; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2022)
      We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency and neighborhood efficiently for intersection graphs on a ...