Eun Jung Kim
Eun Jung Kim
Verified email at - Homepage
Cited by
Cited by
Solving MAX-r-SAT above a tight lower bound
N Alon, G Gutin, EJ Kim, S Szeider, A Yeo
Algorithmica 61 (3), 638-655, 2011
Twin-width I: tractable FO model checking
╔ Bonnet, EJ Kim, S ThomassÚ, R Watrigant
ACM Journal of the ACM (JACM) 69 (1), 1-46, 2021
Linear kernels and single-exponential algorithms via protrusion decompositions
EJ Kim, A Langer, C Paul, F Reidl, P Rossmanith, I Sau, S Sikdar
ACM Transactions on Algorithms (TALG) 12 (2), 1-41, 2015
Twin-width II: small classes
╔ Bonnet, C Geniet, EJ Kim, S ThomassÚ, R Watrigant
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODAá…, 2021
Twin-width III: max independent set, min dominating set, and coloring
╔ Bonnet, C Geniet, EJ Kim, S ThomassÚ, R Watrigant
arXiv preprint arXiv:2007.14161, 2020
Minimum leaf out-branching and related problems
G Gutin, I Razgon, EJ Kim
Theoretical Computer Science 410 (45), 4571-4579, 2009
On subexponential and FPT-time inapproximability
E Bonnet, B Escoffier, EJ Kim, VT Paschos
Algorithmica 71, 541-565, 2015
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem
N Cohen, FV Fomin, G Gutin, EJ Kim, S Saurabh, A Yeo
Journal of Computer and System Sciences 76 (7), 650-662, 2010
Twin-width VI: the lens of contraction sequences∗
╔ Bonnet, EJ Kim, A Reinald, S ThomassÚ
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithmsá…, 2022
Twin-width and polynomial kernels
╔ Bonnet, EJ Kim, A Reinald, S ThomassÚ, R Watrigant
Algorithmica 84 (11), 3300-3337, 2022
Token sliding on split graphs
R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora
Theory of Computing Systems 65, 662-686, 2021
Systems of Linear Equations over\ mathbbF 2 F _2 and Problems Parameterized above Average
R Crowston, G Gutin, M Jones, E Kim, I Ruzsa
Algorithm Theory-SWAT 2010, 164-175, 2010
Don’t Be Strict in Local Search!
S Szeider, S Saurabh, S Ordyniak, EJ Kim, S Gaspers
AAAI 2012, 2012
Erdős-Pˇsa property of chordless cycles and its applications
EJ Kim, O Kwon
Journal of Combinatorial Theory, Series B 145, 65-112, 2020
Algorithms and complexity results for persuasive argumentation
EJ Kim, S Ordyniak, S Szeider
Proceeding of the 2010 conference on Computational Models of Argumentá…, 2010
Betweenness parameterized above tight lower bound
G Gutin, EJ Kim, M Mnich, A Yeo
Journal of computer and system sciences 76 (8), 872-878, 2010
Twin-width VIII: delineation and win-wins
╔ Bonnet, D Chakraborty, EJ Kim, N K÷hler, R Lopes, S ThomassÚ
arXiv preprint arXiv:2204.00722, 2022
On the tree-width of even-hole-free graphs
P Aboulker, I Adler, EJ Kim, NLD Sintiari, N Trotignon
European Journal of Combinatorics 98, 103394, 2021
An FPT 2-approximation for tree-cut decomposition
EJ Kim, S Oum, C Paul, I Sau, DM Thilikos
Algorithmica 80, 116-135, 2018
Finding branch-decompositions of matroids, hypergraphs, and more
J Jeong, EJ Kim, S Oum
SIAM Journal on Discrete Mathematics 35 (4), 2544-2617, 2021
The system can't perform the operation now. Try again later.
Articles 1–20