| 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 | 178* | 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 | 116 | 2015 |
| Minimum leaf out-branching and related problems G Gutin, I Razgon, EJ Kim Theoretical Computer Science 410 (45), 4571-4579, 2009 | 71* | 2009 |
| 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 | 57 | 2021 |
| On subexponential and FPT-time inapproximability E Bonnet, B Escoffier, EJ Kim, VT Paschos Algorithmica 71 (3), 541-565, 2015 | 53* | 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 | 47 | 2010 |
| 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 | 42 | 2021 |
| 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 | 25 | 2010 |
| Don’t Be Strict in Local Search! S Szeider, S Saurabh, S Ordyniak, EJ Kim, S Gaspers AAAI 2012, 2012 | 23* | 2012 |
| Algorithms and complexity results for persuasive argumentation EJ Kim, S Ordyniak, S Szeider Proceeding of the 2010 conference on Computational Models of Argument …, 2010 | 23 | 2010 |
| 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 | 22 | 2020 |
| Improved parameterized algorithms for above average constraint satisfaction E Kim, R Williams Parameterized and Exact Computation, 118-131, 2012 | 22 | 2012 |
| On complexity of minimum leaf out-branching problem P Dankelmann, G Gutin, EJ Kim Discrete Applied Mathematics 157 (13), 3000-3004, 2009 | 22 | 2009 |
| 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 | 21 | 2020 |
| Token sliding on split graphs R Belmonte, EJ Kim, M Lampis, V Mitsou, Y Otachi, F Sikora Theory of Computing Systems 65 (4), 662-686, 2021 | 18 | 2021 |
| Complexity of Grundy coloring and its variants É Bonnet, F Foucaud, EJ Kim, F Sikora Discrete Applied Mathematics 243, 99-114, 2018 | 18 | 2018 |
| 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 | 18 | 2009 |
| An FPT 2-approximation for tree-cut decomposition EJ Kim, S Oum, C Paul, I Sau, DM Thilikos Algorithmica 80 (1), 116-135, 2018 | 16 | 2018 |
G. GutinProfessor of Computer Science, Royal Holloway, University of LondonVerified email at rhul.ac.uk
