On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments - Gregory Z. Gutin; Eun Jung Kim 002 (CoRR, 2007)

Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs - Arvind Gupta; Gregory Z. Gutin; Mehdi Karimi 001; Eun Jung Kim 002; Arash Rafiey (CoRR, 2007)

Minimum Leaf Out-Branching Problems. - Gregory Z. Gutin; Igor Razgon; Eun Jung Kim 002 (AAIM, 2008)

Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. - Arvind Gupta; Mehdi Karimi 001; Eun Jung Kim 002; Arash Rafiey (COCOA, 2008)

Properly Coloured Cycles and Paths: Results and Open Problems. - Gregory Z. Gutin; Eun Jung Kim 002 (Graph Theory, Computational Intelligence and Thought, 2009)

Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. - Nathann Cohen; Fedor V. Fomin; Gregory Z. Gutin; Eun Jung Kim 002; Saket Saurabh 001; Anders Yeo (COCOON, 2009)

A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound - Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (CoRR, 2009)

Solving MAX-2-SAT Above a Tight Lower Bound - Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (CoRR, 2009)

Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound - Gregory Z. Gutin; Eun Jung Kim 002; Matthias Mnich; Anders Yeo (CoRR, 2009)

On complexity of Minimum Leaf Out-Branching problem. - Peter Dankelmann; Gregory Z. Gutin; Eun Jung Kim 002 (Discret. Appl. Math., 2009)

Minimum leaf out-branching and related problems. - Gregory Z. Gutin; Igor Razgon; Eun Jung Kim 002 (Theor. Comput. Sci., 2009)

Solving MAX-r-SAT Above a Tight Lower Bound. - Noga Alon; Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (SODA, 2010)

Systems of Linear Equations over F2 and Problems Parameterized above Average. - Robert Crowston; Gregory Z. Gutin; Mark Jones 001; Eun Jung Kim 002; Imre Z. Ruzsa (SWAT, 2010)

Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. - Arvind Gupta; Gregory Z. Gutin; Mehdi Karimi 001; Eun Jung Kim 002; Arash Rafiey (Australas. J Comb., 2010)

Improved Parameterized Algorithms for Constraint Satisfaction - Eun Jung Kim 002; Ryan Williams 001 (CoRR, 2010)

The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. - Gregory Z. Gutin; Eun Jung Kim 002 (Discret. Appl. Math., 2010)

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. - Nathann Cohen; Fedor V. Fomin; Gregory Z. Gutin; Eun Jung Kim 002; Saket Saurabh 001; Anders Yeo (J. Comput. Syst. Sci., 2010)

FPT algorithms and kernels for the Directed k-Leaf problem. - Jean Daligault; Gregory Z. Gutin; Eun Jung Kim 002; Anders Yeo (J. Comput. Syst. Sci., 2010)

Betweenness parameterized above tight lower bound. - Gregory Z. Gutin; Eun Jung Kim 002; Matthias Mnich; Anders Yeo (J. Comput. Syst. Sci., 2010)

Parameterized algorithms on digraph and constraint satisfaction problems. - Eun Jung Kim 002 (2010)

Improved Parameterized Algorithms for above Average Constraint Satisfaction. - Eun Jung Kim 002; Ryan Williams 001 (IPEC, 2011)

Algorithms and complexity results for persuasive argumentation. - Eun Jung Kim 002; Sebastian Ordyniak; Stefan Szeider (Artif. Intell., 2011)

Solving MAX-r-SAT Above a Tight Lower Bound. - Noga Alon; Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (Algorithmica, 2011)

A probabilistic approach to problems parameterized above or below tight bounds. - Gregory Z. Gutin; Eun Jung Kim 002; Stefan Szeider; Anders Yeo (J. Comput. Syst. Sci., 2011)

Vertex Cover Problem Parameterized Above and Below Tight Bounds. - Gregory Z. Gutin; Eun Jung Kim 002; Michael Lampis; Valia Mitsou (Theory Comput. Syst., 2011)

Don't Be Strict in Local Search! - Serge Gaspers; Eun Jung Kim 002; Sebastian Ordyniak; Saket Saurabh 001; Stefan Szeider (AAAI, 2012)

Valued-Based Argumentation for Tree-like Value Graphs. - Eun Jung Kim 002; Sebastian Ordyniak (COMMA, 2012)

A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. - Eun Jung Kim 002; Christophe Paul; Geevarghese Philip (SWAT, 2012)

Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. - Gregory Z. Gutin; Eun Jung Kim 002; Arezou Soleimanfallah; Stefan Szeider; Anders Yeo (Algorithmica, 2012)

A single-exponential FPT algorithm for the $K_4$-minor cover problem - Eun Jung Kim 002; Christophe Paul; Geevarghese Philip (CoRR, 2012)

Subexponential and FPT-time Inapproximability of Independent Set and Related Problems - Bruno Escoffier; Eun Jung Kim 002; Vangelis Th. Paschos (CoRR, 2012)

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. - Eun Jung Kim 002; Sebastian Ordyniak; Stefan Szeider (TAFA, 2013)

On exact algorithms for the permutation CSP. - Eun Jung Kim 002; Daniel Gonçalves 001 (Theor. Comput. Sci., 2013)

Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. - Robert Crowston; Michael R. Fellows; Gregory Z. Gutin; Mark Jones 001; Eun Jung Kim 002; Fran Rosamond; Imre Z. Ruzsa; Stéphan Thomassé; Anders Yeo (J. Comput. Syst. Sci., 2014)

Recognizing k-equistable Graphs in FPT Time. - Eun Jung Kim 002; Martin Milanic; Oliver Schaudt (WG, 2015)

On Subexponential and FPT-Time Inapproximability. - Edouard Bonnet; Bruno Escoffier; Eun Jung Kim 002; Vangelis Th. Paschos (Algorithmica, 2015)

A polynomial kernel for Block Graph Vertex Deletion. - Eun Jung Kim 002; O-joung Kwon (CoRR, 2015)

FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. - Mamadou Moustapha Kanté; Eun Jung Kim 002; O-joung Kwon; Christophe Paul (CoRR, 2015)

A single-exponential FPT algorithm for the K4-minor cover problem. - Eun Jung Kim 002; Christophe Paul; Geevarghese Philip (J. Comput. Syst. Sci., 2015)

Constructive algorithm for path-width of matroids. - Jisu Jeong; Eun Jung Kim 002; Sang-il Oum (SODA, 2016)

Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. - Eun Jung Kim 002; Alexander Langer; Christophe Paul; Felix Reidl; Peter Rossmanith; Ignasi Sau; Somnath Sikdar (ACM Trans. Algorithms, 2016)

Complexity and Approximability of Parameterized MAX-CSPs. - Holger Dell; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Tobias Mömke (Algorithmica, 2017)

An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. - Mamadou Moustapha Kanté; Eun Jung Kim 002; O-joung Kwon; Christophe Paul (Algorithmica, 2017)

A Polynomial Kernel for Block Graph Deletion. - Eun Jung Kim 002; O-joung Kwon (Algorithmica, 2017)

A polynomial-time algorithm for Outerplanar Diameter Improvement. - Nathann Cohen; Daniel Gonçalves 001; Eun Jung Kim 002; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos; Mathias Weller (J. Comput. Syst. Sci., 2017)

Parameterized algorithms for min-max multiway cut and list digraph homomorphism. - Eun Jung Kim 002; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2017)

The "Art of Trellis Decoding" Is Fixed-Parameter Tractable. - Jisu Jeong; Eun Jung Kim 002; Sang-il Oum (IEEE Trans. Inf. Theory, 2017)

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. - Édouard Bonnet; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora (SoCG, 2018)

Data-Compression for Parametrized Counting Problems on Sparse Graphs. - Eun Jung Kim 002; Maria J. Serna; Dimitrios M. Thilikos (ISAAC, 2018)

An FPT 2-Approximation for Tree-Cut Decomposition. - Eun Jung Kim 002; Sang-il Oum; Christophe Paul; Ignasi Sau; Dimitrios M. Thilikos (Algorithmica, 2018)

Complexity of Grundy coloring and its variants. - Édouard Bonnet; Florent Foucaud; Eun Jung Kim 002; Florian Sikora (Discret. Appl. Math., 2018)

Grundy Coloring & Friends, Half-Graphs, Bicliques. - Pierre Aboulker; Édouard Bonnet; Eun Jung Kim 002; Florian Sikora (STACS, 2020)

Twin-width III: Max Independent Set and Coloring. - Édouard Bonnet; Colin Geniet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (CoRR, 2020)

Erdős-Pósa property of chordless cycles and its applications. - Eun Jung Kim 002; O-joung Kwon (J. Comb. Theory B, 2020)

Solving hard cut problems via flow-augmentation. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (SODA, 2021)

A Polynomial Kernel for Distance-Hereditary Vertex Deletion. - Eun Jung Kim 002; O-joung Kwon (Algorithmica, 2021)

On the tree-width of even-hole-free graphs. - Pierre Aboulker; Isolde Adler; Eun Jung Kim 002; Ni Luh Dewi Sintiari; Nicolas Trotignon (Eur. J. Comb., 2021)

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. - Marthe Bonamy; Édouard Bonnet; Nicolas Bousquet 001; Pierre Charbit; Panos Giannopoulos; Eun Jung Kim 002; Pawel Rzazewski; Florian Sikora; Stéphan Thomassé (J. ACM, 2021)

Token Sliding on Split Graphs. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi; Florian Sikora (Theory Comput. Syst., 2021)

Finding Branch-Decompositions of Matroids, Hypergraphs, and More. - Jisu Jeong; Eun Jung Kim 002; Sang-il Oum (SIAM J. Discret. Math., 2021)

Twin-Width VIII: Delineation and Win-Wins. - Édouard Bonnet; Dibyayan Chakraborty; Eun Jung Kim 002; Noleen Köhler; Raul Lopes 001; Stéphan Thomassé (IPEC, 2022)

Twin-width VI: the lens of contraction sequences. - Édouard Bonnet; Eun Jung Kim 002; Amadeus Reinald; Stéphan Thomassé (SODA, 2022)

Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. - Mamadou Moustapha Kanté; Eun Jung Kim 002; O-joung Kwon; Sang-il Oum (STACS, 2022)

Directed flow-augmentation. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (STOC, 2022)

Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. - Jungho Ahn; Eun Jung Kim 002; Euiwoong Lee (Algorithmica, 2022)

Twin-width and Polynomial Kernels. - Édouard Bonnet; Eun Jung Kim 002; Amadeus Reinald; Stéphan Thomassé; Rémi Watrigant (Algorithmica, 2022)

Twin-width II: small classes. - Édouard Bonnet; Colin Geniet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (Comb. Theory, 2022)

On weighted graph separation problems and flow-augmentation. - Eun Jung Kim 002; Marcin Pilipczuk; Roohani Sharma; Magnus Wahlström (CoRR, 2022)

Twin-width I: Tractable FO Model Checking. - Édouard Bonnet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (J. ACM, 2022)

Sum-of-Products with Default Values: Algorithms and Complexity Results. - Robert Ganian; Eun Jung Kim 002; Friedrich Slivovsky; Stefan Szeider (J. Artif. Intell. Res., 2022)

Complexity and algorithms for constant diameter augmentation problems. - Eun Jung Kim 002; Martin Milanic; Jérôme Monnot; Christophe Picouleau (Theor. Comput. Sci., 2022)

Grundy Distinguishes Treewidth from Pathwidth. - Rémy Belmonte; Eun Jung Kim 002; Michael Lampis; Valia Mitsou; Yota Otachi (SIAM J. Discret. Math., 2022)

Algorithmic Applications of Tree-Cut Width. - Robert Ganian; Eun Jung Kim 002; Stefan Szeider (SIAM J. Discret. Math., 2022)

Bandwidth Parameterized by Cluster Vertex Deletion Number. - Tatsuya Gima; Eun Jung Kim 002; Noleen Köhler; Nikolaos Melissinos; Manolis Vasilakis (IPEC, 2023)

Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (SODA, 2023)

Grundy Coloring and Friends, Half-Graphs, Bicliques. - Pierre Aboulker; Édouard Bonnet; Eun Jung Kim 002; Florian Sikora (Algorithmica, 2023)

New Results on Directed Edge Dominating Set. - Rémy Belmonte; Tesshu Hanaka; Ioannis Katsikarelis; Eun Jung Kim 002; Michael Lampis (Discret. Math. Theor. Comput. Sci., 2023)

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k. - Mamadou Moustapha Kanté; Eun Jung Kim 002; O-joung Kwon; Sang-il Oum (J. Comb. Theory B, 2023)

Representing Matroids over the Reals is ∃ℝ-complete. - Eun Jung Kim 002; Arnaud de Mesmay; Tillmann Miltzow (Discret. Math. Theor. Comput. Sci., 2024)

Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. - Édouard Bonnet; Colin Geniet; Eun Jung Kim 002; Stéphan Thomassé; Rémi Watrigant (SIAM J. Comput., 2024)

On Weighted Graph Separation Problems and Flow Augmentation. - Eun Jung Kim 002; Tomás Masarík; Marcin Pilipczuk; Roohani Sharma; Magnus Wahlström (SIAM J. Discret. Math., 2024)

Flow-augmentation II: Undirected Graphs. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (ACM Trans. Algorithms, 2024)

A tight meta-theorem for LOCAL certification of MSO2 properties within bounded treewidth graphs. - Linda Cook; Eun Jung Kim 002; Tomás Masarík (PODC, 2025)

CMSO-Transducing Tree-Like Graph Decompositions. - Rutger Campbell; Bruno Guillon; Mamadou Moustapha Kanté; Eun Jung Kim 002; Noleen Köhler (STACS, 2025)

A constant-factor approximation for weighted bond cover. - Eun Jung Kim 002; Euiwoong Lee; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2025)

Flow-augmentation I: Directed graphs. - Eun Jung Kim 002; Stefan Kratsch; Marcin Pilipczuk; Magnus Wahlström (J. ACM, 2025)

A Tight Meta-theorem for LOCAL Certification of MSO2 Properties within Bounded Treewidth Graphs. - Linda Cook; Eun Jung Kim 002; Tomás Masarík (CoRR, 2025)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson. - Jungho Ahn; Ian DeHaan; Eun Jung Kim 002; Euiwoong Lee (CoRR, 2025)