Eun Jung Kim

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 76

Top Venues

Royal Holloway, University of London, UK (PHD)

Education History

Royal Holloway, University of London, UK

PHD

Publications

Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. 38 (1) (2024)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Flow-augmentation II: Undirected Graphs. ACM Trans. Algorithms 20 (2) (2024)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
. J. Comb. Theory, Ser. B 160 (2023)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. SODA (2023)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. Discret. Math. Theor. Comput. Sci. 25 (2023)
Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis
Bandwidth Parameterized by Cluster Vertex Deletion Number. CoRR (2023)
Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis
Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC (2023)
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
Grundy Coloring and Friends, Half-Graphs, Bicliques. Algorithmica 85 (1) (2023)
Robert Ganian, Eun Jung Kim, Stefan Szeider
Algorithmic Applications of Tree-Cut Width. CoRR (2022)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
Twin-width and Polynomial Kernels. Algorithmica 84 (11) (2022)
Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau
Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. 904 (2022)
Robert Ganian, Eun Jung Kim, Stefan Szeider
Algorithmic Applications of Tree-Cut Width. SIAM J. Discret. Math. 36 (4) (2022)
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
Twin-Width VIII: Delineation and Win-Wins. IPEC (2022)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints. CoRR (2022)
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
Sum-of-Products with Default Values: Algorithms and Complexity Results. J. Artif. Intell. Res. 73 (2022)
Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
On weighted graph separation problems and flow-augmentation. CoRR (2022)
Jungho Ahn, Eun Jung Kim, Euiwoong Lee
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. Algorithmica 84 (7) (2022)
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé
Twin-width VIII: delineation and win-wins. CoRR (2022)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Directed flow-augmentation. STOC (2022)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. 36 (3) (2022)
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width I: Tractable FO Model Checking. J. ACM 69 (1) (2022)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
Twin-width VI: the lens of contraction sequences. SODA (2022)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Sang-il Oum
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k. STACS (2022)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR (2021)
Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
A Constant-Factor Approximation for Weighted Bond Cover. APPROX-RANDOM (2021)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68 (2) (2021)
Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
A Constant-factor Approximation for Weighted Bond Cover. CoRR (2021)
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring. ICALP (2021)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. Theory Comput. Syst. 65 (4) (2021)
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width II: small classes. SODA (2021)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé
Twin-width VI: the lens of contraction sequences. CoRR (2021)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Finding Branch-Decompositions of Matroids, Hypergraphs, and More. SIAM J. Discret. Math. 35 (4) (2021)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Directed flow-augmentation. CoRR (2021)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. Algorithmica 83 (7) (2021)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
Twin-Width and Polynomial Kernels. IPEC (2021)
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant
Twin-width and polynomial kernels. CoRR (2021)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Solving hard cut problems via flow-augmentation. SODA (2021)
Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
On the tree-width of even-hole-free graphs. Eur. J. Comb. 98 (2021)
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström
Solving hard cut problems via flow-augmentation. CoRR (2020)
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width II: small classes. CoRR (2020)
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width I: tractable FO model checking. CoRR (2020)
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
Grundy Coloring & Friends, Half-Graphs, Bicliques. STACS (2020)
Jungho Ahn, Eun Jung Kim, Euiwoong Lee
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. ISAAC (2020)
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width III: Max Independent Set and Coloring. CoRR (2020)
Jungho Ahn, Eun Jung Kim, Euiwoong Lee
Towards constant-factor approximation for chordal / distance-hereditary vertex deletion. CoRR (2020)
Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora
Grundy Coloring & friends, Half-Graphs, Bicliques. CoRR (2020)
Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon
On the tree-width of even-hole-free graphs. CoRR (2020)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. ESA (2020)
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
Twin-width I: tractable FO model checking. FOCS (2020)
Eun Jung Kim, O-joung Kwon
Erdős-Pósa property of chordless cycles and its applications. J. Comb. Theory, Ser. B 145 (2020)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi
Grundy Distinguishes Treewidth from Pathwidth. CoRR (2020)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. STACS (2019)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. CoRR (2019)
Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos
Data-Compression for Parametrized Counting Problems on Sparse Graphs. ISAAC (2018)
Eun Jung Kim, O-joung Kwon
Erdős-Pósa property of chordless cycles and its applications. SODA (2018)
Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy coloring and its variants. Discret. Appl. Math. 243 (2018)
Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora
Token Sliding on Split Graphs. CoRR (2018)
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG (2018)
Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis
New Results on Directed Edge Dominating Set. MFCS (2018)
Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider
Sum-of-Products with Default Values: Algorithms and Complexity Results. ICTAI (2018)
Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos
Data-compression for Parametrized Counting Problems on Sparse graphs. CoRR (2018)
Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80 (1) (2018)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Finding Branch-Decompositions of Matroids, Hypergraphs, and More. ICALP (2018)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable. IEEE Trans. Inf. Theory 63 (11) (2017)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Algorithmica 79 (1) (2017)
Eun Jung Kim, O-joung Kwon
Erdős-Pósa property of chordless cycles and its applications. CoRR (2017)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. WADS (2017)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79 (1) (2017)
Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Parameterized algorithms for min-max multiway cut and list digraph homomorphism. J. Comput. Syst. Sci. 86 (2017)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Block Graph Deletion. Algorithmica 79 (1) (2017)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. 89 (2017)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Finding branch-decompositions of matroids, hypergraphs, and more. CoRR (2017)
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR (2017)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Constructive algorithm for path-width of matroids. SODA (2016)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. CoRR (2016)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions. ACM Trans. Algorithms 12 (2) (2016)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. IPEC (2015)
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke
Complexity and Approximability of Parameterized MAX-CSPs. CoRR (2015)
Eun Jung Kim, Martin Milanic, Oliver Schaudt
Recognizing k-equistable Graphs in FPT Time. WG (2015)
Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC (2015)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR (2015)
Jisu Jeong, Eun Jung Kim, Sang-il Oum
Constructive algorithm for path-width of matroids. CoRR (2015)
Eun Jung Kim, O-joung Kwon
A polynomial kernel for Block Graph Vertex Deletion. CoRR (2015)
Eun Jung Kim, Martin Milanic, Oliver Schaudt
Recognizing k-equistable graphs in FPT time. CoRR (2015)
Robert Ganian, Eun Jung Kim, Stefan Szeider
Algorithmic Applications of Tree-Cut Width. MFCS (2) (2015)
Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
On Subexponential and FPT-Time Inapproximability. Algorithmica 71 (3) (2015)
Eun Jung Kim, Christophe Paul, Geevarghese Philip
-minor cover problem. J. Comput. Syst. Sci. 81 (1) (2015)
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy Coloring and Its Variants. COCOON (2015)
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul
An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. IPEC (2015)
Eun Jung Kim, O-joung Kwon
A Polynomial Kernel for Block Graph Deletion. IPEC (2015)
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. CoRR (2014)
Robert Crowston, Michael R. Fellows, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Fran Rosamond, Imre Z. Ruzsa, Stéphan Thomassé, Anders Yeo
Satisfying more than half of a system of linear equations over GF(2): A multivariate approach. J. Comput. Syst. Sci. 80 (4) (2014)
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR (2014)
Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora
Complexity of Grundy coloring and its variants. CoRR (2014)
Eun Jung Kim, Daniel Gonçalves
On exact algorithms for the permutation CSP. Theor. Comput. Sci. 511 (2013)
Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions. ICALP (1) (2013)
Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
On Subexponential and FPT-Time Inapproximability. IPEC (2013)
Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. TAFA (2013)
Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider
Don't Be Strict in Local Search! AAAI (2012)
Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica 64 (1) (2012)

Eun Jung Kim.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eun Jung Kim