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 | 165* | 2011 |

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 | 97 | 2015 |

Minimum leaf out-branching and related problems G Gutin, I Razgon, EJ Kim Theoretical Computer Science 410 (45), 4571-4579, 2009 | 71* | 2009 |

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 | 42 | 2010 |

On subexponential and FPT-time inapproximability E Bonnet, B Escoffier, EJ Kim, VT Paschos Algorithmica 71 (3), 541-565, 2015 | 41* | 2015 |

A probabilistic approach to problems parameterized above or below tight bounds G Gutin, EJ Kim, S Szeider, A Yeo Journal of Computer and System Sciences 77 (2), 422-429, 2011 | 41 | 2011 |

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 | 32 | 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 | 24 | 2010 |

Improved parameterized algorithms for above average constraint satisfaction E Kim, R Williams Parameterized and Exact Computation, 118-131, 2012 | 23* | 2012 |

On complexity of minimum leaf out-branching problem P Dankelmann, G Gutin, EJ Kim Discrete Applied Mathematics 157 (13), 3000-3004, 2009 | 21 | 2009 |

Don’t Be Strict in Local Search! S Szeider, S Saurabh, S Ordyniak, EJ Kim, S Gaspers AAAI 2012, 2012 | 20* | 2012 |

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem N Cohen, F Fomin, G Gutin, E Kim, S Saurabh, A Yeo Computing and Combinatorics, 37-46, 2009 | 19 | 2009 |

Algorithms and complexity results for persuasive argumentation EJ Kim, S Ordyniak, S Szeider Proceeding of the 2010 conference on Computational Models of Argument …, 2010 | 17 | 2010 |

A single-exponential FPT algorithm for the K 4-minor cover problem E Kim, C Paul, G Philip Algorithm Theory–SWAT 2012, 119-130, 2012 | 16 | 2012 |

Complexity of Grundy coloring and its variants É Bonnet, F Foucaud, EJ Kim, F Sikora Discrete Applied Mathematics 243, 99-114, 2018 | 14 | 2018 |

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 | 13 | 2020 |

Satisfying more than half of a system of linear equations over GF (2): A multivariate approach R Crowston, M Fellows, G Gutin, M Jones, EJ Kim, F Rosamond, IZ Ruzsa, ... Journal of Computer and System Sciences 80 (4), 687-696, 2014 | 13 | 2014 |

A polynomial kernel for block graph deletion EJ Kim, O Kwon Algorithmica 79 (1), 251-270, 2017 | 12* | 2017 |

An FPT 2-approximation for tree-cut decomposition EJ Kim, S Oum, C Paul, I Sau, DM Thilikos Algorithmica 80 (1), 116-135, 2018 | 11 | 2018 |

QPTAS and subexponential algorithm for maximum clique on disk graphs É Bonnet, P Giannopoulos, EJ Kim, P Rzążewski, F Sikora arXiv preprint arXiv:1712.05010, 2017 | 10 | 2017 |