EDBT 2026 Demo / reviewers in the wild / expert
Eun-Kyung Cho
dblp:240/2601
· DBLP profile ↗
3ranked-venue papers
3as first author
3since 2021 · last 2025
0000-0002-8648-8400ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 3 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Proper conflict-free coloring of sparse graphs
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park |
Discret. Appl. Math. | 1 |
| 2024 | Relaxation of Wegner's planar graph conjecture for maximum degree 4
Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický |
Discret. Appl. Math. | 1 |
| 2024 | Independent domination versus packing in subcubic graphsabstractIn 2011, Henning, Löwenstein, and Rautenbach observed that the domination number of a graph is bounded above by the product of the packing number and the maximum degree of the graph. In this paper, we prove a stronger statement in subcubic graphs: The independent domination number is at most three times the packing number. Eun-Kyung Cho |
Discret. Appl. Math. | 1 |