Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Seungbum Jo

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Sankardeep Chakraborty

> Home > Persons > Seungbum Jo

Publications

2023
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/ChakrabortyJ23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ChakrabortyJ23
Sankardeep Chakraborty, Seungbum Jo:
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number. Theor. Comput. Sci. 941: 156-166 (2023)
[i11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2311-02427
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2311-02427
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct Data Structure for Graphs with d-Dimensional t-Representation. CoRR abs/2311.02427 (2023)
[i10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2311-02839
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2311-02839
Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu:
Cell-Probe Lower Bound for Accessible Interval Graphs. CoRR abs/2311.02839 (2023)
2022
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/AcanCJNSS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AcanCJNSS22
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct navigational oracles for families of intersection graphs on a circle. Theor. Comput. Sci. 928: 151-166 (2022)
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/dcc/ChakrabortyJ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcc/ChakrabortyJ22
Sankardeep Chakraborty, Seungbum Jo:
Compact Representation of Interval Graphs of Bounded Degree and Chromatic Number. DCC 2022: 103-112
2021
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/AcanCJS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/AcanCJS21
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Encodings for Families of Interval Graphs. Algorithmica 83(3): 776-794 (2021)
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoa/ChakrabortyJSS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/ChakrabortyJSS21
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA 2021: 416-430
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/dcc/AcanCJNSS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcc/AcanCJNSS21
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct representations of Intersection Graphs on a Circle. DCC 2021: 123-132
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/dcc/ChakrabortyJSS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcc/ChakrabortyJSS21
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Small Clique-Width Graphs. DCC 2021: 133-142
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2108-10776
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2108-10776
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. CoRR abs/2108.10776 (2021)
2020
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2010-04333
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2010-04333
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle. CoRR abs/2010.04333 (2020)
2019
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/wads/AcanCJS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/AcanCJS19
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. WADS 2019: 1-13
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1902-09228
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1902-09228
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. CoRR abs/1902.09228 (2019)
2017
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1712-03349
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1712-03349
Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems. CoRR abs/1712.03349 (2017)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.