default search action
Jungho Ahn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j4]Jungho Ahn
, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A Polynomial Kernel for 3-Leaf Power Deletion. Algorithmica 85(10): 3058-3087 (2023) - [c5]Jungho Ahn, Jinha Kim, O-joung Kwon:
Unified Almost Linear Kernels for Generalized Covering and Packing Problems on Nowhere Dense Classes. ISAAC 2023: 5:1-5:19 - [i8]Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Sang-il Oum:
Twin-width of subdivisions of multigraphs. CoRR abs/2306.05334 (2023) - 2022
- [j3]Jungho Ahn
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. Algorithmica 84(7): 2106-2133 (2022) - [j2]Jungho Ahn, Lars Jaffke
Well-partitioned chordal graphs. Discret. Math. 345(10): 112985 (2022) - [j1]Jungho Ahn, Kevin Hendrey, Donggyu Kim, Sang-il Oum
Bounds for the Twin-Width of Graphs. SIAM J. Discret. Math. 36(3): 2352-2366 (2022) - [i7]Jungho Ahn, Jinha Kim, O-joung Kwon:
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes. CoRR abs/2207.06660 (2022) - [i6]Jungho Ahn, Seonghyuk Im, Sang-il Oum:
The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs. CoRR abs/2208.08330 (2022) - [i5]Jungho Ahn, Debsoumya Chakraborti, Kevin Hendrey, Donggyu Kim, Sang-il Oum:
Twin-width of random graphs. CoRR abs/2212.07880 (2022) - 2021
- [c4]Jungho Ahn
Three Problems on Well-Partitioned Chordal Graphs. CIAC 2021: 23-36 - [i4]Jungho Ahn, Kevin Hendrey, Donggyu Kim, Sang-il Oum:
Bounds for the Twin-width of Graphs. CoRR abs/2110.03957 (2021) - 2020
- [c3]Jungho Ahn
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. ISAAC 2020: 62:1-62:16 - [c2]Jungho Ahn, Eduard Eiben
A Polynomial Kernel for 3-Leaf Power Deletion. MFCS 2020: 5:1-5:14 - [c1]Jungho Ahn
Well-Partitioned Chordal Graphs: Obstruction Set and Disjoint Paths. WG 2020: 148-160 - [i3]Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima:
Well-partitioned chordal graphs: obstruction set and disjoint paths. CoRR abs/2002.10859 (2020) - [i2]Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards constant-factor approximation for chordal / distance-hereditary vertex deletion. CoRR abs/2009.00809 (2020)
2010 – 2019
- 2019
- [i1]Jungho Ahn, Eduard Eiben, O-joung Kwon, Sang-il Oum:
A polynomial kernel for $3$-leaf power deletion. CoRR abs/1911.04249 (2019)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: