default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEun Jung Kim 0002
Eunjung Kim 0002
Person information
- affiliation: KAIST, Republic of Korea
- affiliation: Paris Dauphine University, LAMSADE, France
- affiliation (former): Royal Holloway, University of London, Egham, Surrey, UK
Other persons with the same name
- Eun Jung Kim 0001
![[0000-0002-2590-698X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2590-698X")
(aka: Eunjung Kim 0001) — Texas A&M University, College Station, TX, USA - Eun Jung Kim 0003 — Yonsei University College of Medicine, Seoul, Korea
- Eunjung Kim — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j48]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Flow-augmentation I: Directed graphs. J. ACM 72(1): 5:1-5:38 (2025)- [j47]Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A constant-factor approximation for weighted bond cover. J. Comput. Syst. Sci. 149: 103617 (2025) - [c50]Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler:
CMSO-Transducing Tree-Like Graph Decompositions. STACS 2025: 22:1-22:18 - 2024
- [j46]Eun Jung Kim, Arnaud de Mesmay, Tillmann Miltzow:
Representing Matroids over the Reals is ∃ℝ-complete. Discret. Math. Theor. Comput. Sci. 26(2) (2024) - [j45]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring. SIAM J. Comput. 53(5): 1602-1640 (2024) - [j44]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): 170-189 (2024) - [j43]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Flow-augmentation II: Undirected Graphs. ACM Trans. Algorithms 20(2): 12 (2024) - [i58]Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler:
CMSO-transducing tree-like graph decompositions. CoRR abs/2412.04970 (2024) - 2023
- [j42]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring and Friends, Half-Graphs, Bicliques. Algorithmica 85(1): 1-28 (2023) - [j41]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(1) (2023) - [j40]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. J. Comb. Theory B 160: 15-35 (2023) - [c49]Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis:
Bandwidth Parameterized by Cluster Vertex Deletion Number. IPEC 2023: 21:1-21:15 - [c48]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: 3218-3228 - [i57]Eunjung Kim, Arnaud de Mesmay, Tillmann Miltzow:
Representing Matroids over the Reals is ∃R-complete. CoRR abs/2301.03221 (2023) - [i56]Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis:
Bandwidth Parameterized by Cluster Vertex Deletion Number. CoRR abs/2309.17204 (2023) - 2022
- [j39]Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion. Algorithmica 84(7): 2106-2133 (2022) - [j38]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-width and Polynomial Kernels. Algorithmica 84(11): 3300-3337 (2022) - [j37]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. Comb. Theory 2(2) (2022) - [j36]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: Tractable FO Model Checking. J. ACM 69(1): 3:1-3:46 (2022) - [j35]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. J. Artif. Intell. Res. 73: 535-552 (2022) - [j34]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. SIAM J. Discret. Math. 36(3): 1761-1787 (2022) - [j33]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. SIAM J. Discret. Math. 36(4): 2635-2666 (2022) - [j32]Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau:
Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. 904: 15-26 (2022) - [c47]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-Width VIII: Delineation and Win-Wins. IPEC 2022: 9:1-9:18 - [c46]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé:
Twin-width VI: the lens of contraction sequences. SODA 2022: 1036-1056 - [c45]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: 40:1-40:14 - [c44]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Directed flow-augmentation. STOC 2022: 938-947 - [i55]Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-width VIII: delineation and win-wins. CoRR abs/2204.00722 (2022) - [i54]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. CoRR abs/2206.00752 (2022) - [i53]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 abs/2207.07422 (2022) - [i52]Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström:
On weighted graph separation problems and flow-augmentation. CoRR abs/2208.14841 (2022) - 2021
- [j31]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. Algorithmica 83(7): 2096-2141 (2021) - [j30]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: 103394 (2021) - [j29]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): 9:1-9:38 (2021) - [j28]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. Theory Comput. Syst. 65(4): 662-686 (2021) - [j27]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Finding Branch-Decompositions of Matroids, Hypergraphs, and More. SIAM J. Discret. Math. 35(4): 2544-2617 (2021) - [c43]Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A Constant-Factor Approximation for Weighted Bond Cover. APPROX-RANDOM 2021: 7:1-7:14 - [c42]É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: 35:1-35:20 - [c41]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-Width and Polynomial Kernels. IPEC 2021: 10:1-10:16 - [c40]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Solving hard cut problems via flow-augmentation. SODA 2021: 149-168 - [c39]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. SODA 2021: 1977-1996 - [i51]Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos:
A Constant-factor Approximation for Weighted Bond Cover. CoRR abs/2105.00857 (2021) - [i50]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, Rémi Watrigant:
Twin-width and polynomial kernels. CoRR abs/2107.02882 (2021) - [i49]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 abs/2110.15419 (2021) - [i48]Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé:
Twin-width VI: the lens of contraction sequences. CoRR abs/2111.00282 (2021) - [i47]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Directed flow-augmentation. CoRR abs/2111.03450 (2021) - 2020
- [j26]Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. J. Comb. Theory B 145: 65-112 (2020) - [c38]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. ESA 2020: 14:1-14:19 - [c37]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: tractable FO model checking. FOCS 2020: 601-612 - [c36]Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion. ISAAC 2020: 62:1-62:16 - [c35]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring & Friends, Half-Graphs, Bicliques. STACS 2020: 58:1-58:18 - [i46]Pierre Aboulker, Édouard Bonnet, Eun Jung Kim, Florian Sikora:
Grundy Coloring & friends, Half-Graphs, Bicliques. CoRR abs/2001.03794 (2020) - [i45]Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width I: tractable FO model checking. CoRR abs/2004.14789 (2020) - [i44]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width II: small classes. CoRR abs/2006.09877 (2020) - [i43]Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk, Magnus Wahlström:
Solving hard cut problems via flow-augmentation. CoRR abs/2007.09018 (2020) - [i42]Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant:
Twin-width III: Max Independent Set and Coloring. CoRR abs/2007.14161 (2020) - [i41]Pierre Aboulker, Isolde Adler, Eun Jung Kim, Ni Luh Dewi Sintiari, Nicolas Trotignon:
On the tree-width of even-hole-free graphs. CoRR abs/2008.05504 (2020) - [i40]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi:
Grundy Distinguishes Treewidth from Pathwidth. CoRR abs/2008.07425 (2020) - [i39]Jungho Ahn, Eun Jung Kim, Euiwoong Lee:
Towards constant-factor approximation for chordal / distance-hereditary vertex deletion. CoRR abs/2009.00809 (2020)
2010 – 2019
- 2019
- [c34]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. STACS 2019: 13:1-13:17 - [i38]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. CoRR abs/1902.04919 (2019) - 2018
- [j25]Eun Jung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. Algorithmica 80(1): 116-135 (2018) - [j24]Édouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. Discret. Appl. Math. 243: 99-114 (2018) - [c33]Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora:
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG 2018: 12:1-12:15 - [c32]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Finding Branch-Decompositions of Matroids, Hypergraphs, and More. ICALP 2018: 80:1-80:14 - [c31]Robert Ganian, Eun Jung Kim, Friedrich Slivovsky, Stefan Szeider:
Sum-of-Products with Default Values: Algorithms and Complexity Results. ICTAI 2018: 733-737 - [c30]Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos:
Data-Compression for Parametrized Counting Problems on Sparse Graphs. ISAAC 2018: 20:1-20:13 - [c29]Rémy Belmonte, Tesshu Hanaka, Ioannis Katsikarelis, Eun Jung Kim, Michael Lampis:
New Results on Directed Edge Dominating Set. MFCS 2018: 67:1-67:16 - [c28]Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. SODA 2018: 1665-1684 - [i37]Rémy Belmonte, Eun Jung Kim, Michael Lampis, Valia Mitsou, Yota Otachi, Florian Sikora:
Token Sliding on Split Graphs. CoRR abs/1807.05322 (2018) - [i36]Eun Jung Kim, Maria J. Serna, Dimitrios M. Thilikos:
Data-compression for Parametrized Counting Problems on Sparse graphs. CoRR abs/1809.08160 (2018) - 2017
- [j23]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): 66-95 (2017) - [j22]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79(1): 230-250 (2017) - [j21]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Block Graph Deletion. Algorithmica 79(1): 251-270 (2017) - [j20]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: 191-206 (2017) - [j19]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: 315-327 (2017) - [j18]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
The "Art of Trellis Decoding" Is Fixed-Parameter Tractable. IEEE Trans. Inf. Theory 63(11): 7178-7205 (2017) - [c27]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. WADS 2017: 509-520 - [i35]Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. CoRR abs/1711.00667 (2017) - [i34]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Finding branch-decompositions of matroids, hypergraphs, and more. CoRR abs/1711.01381 (2017) - [i33]Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora:
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. CoRR abs/1712.05010 (2017) - 2016
- [j17]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): 21:1-21:41 (2016) - [c26]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Constructive algorithm for path-width of matroids. SODA 2016: 1695-1704 - [i32]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Distance-Hereditary Vertex Deletion. CoRR abs/1610.07229 (2016) - 2015
- [j16]Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. Algorithmica 71(3): 541-565 (2015) - [j15]Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A single-exponential FPT algorithm for the K4-minor cover problem. J. Comput. Syst. Sci. 81(1): 186-207 (2015) - [c25]Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy Coloring and Its Variants. COCOON 2015: 109-120 - [c24]Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR 2015: 123-142 - [c23]Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. IPEC 2015: 78-89 - [c22]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: 138-150 - [c21]Eun Jung Kim, O-joung Kwon:
A Polynomial Kernel for Block Graph Deletion. IPEC 2015: 270-281 - [c20]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. IPEC 2015: 294-306 - [c19]Robert Ganian, Eun Jung Kim, Stefan Szeider:
Algorithmic Applications of Tree-Cut Width. MFCS (2) 2015: 348-360 - [c18]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-cut Decomposition. WAOA 2015: 35-46 - [c17]Eun Jung Kim, Martin Milanic, Oliver Schaudt:
Recognizing k-equistable Graphs in FPT Time. WG 2015: 487-498 - [i31]Eun Jung Kim, Martin Milanic, Oliver Schaudt:
Recognizing k-equistable graphs in FPT time. CoRR abs/1503.01098 (2015) - [i30]Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul:
FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion. CoRR abs/1504.05905 (2015) - [i29]Eun Jung Kim, O-joung Kwon:
A polynomial kernel for Block Graph Vertex Deletion. CoRR abs/1506.08477 (2015) - [i28]Jisu Jeong, Eun Jung Kim, Sang-il Oum:
Constructive algorithm for path-width of matroids. CoRR abs/1507.02184 (2015) - [i27]Eunjung Kim, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
An FPT 2-Approximation for Tree-Cut Decomposition. CoRR abs/1509.04880 (2015) - [i26]Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. CoRR abs/1509.07404 (2015) - [i25]Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. CoRR abs/1511.05546 (2015) - 2014
- [j14]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): 687-696 (2014) - [i24]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. CoRR abs/1402.6109 (2014) - [i23]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 abs/1403.5702 (2014) - [i22]Edouard Bonnet, Florent Foucaud, Eun Jung Kim, Florian Sikora:
Complexity of Grundy coloring and its variants. CoRR abs/1407.5336 (2014) - 2013
- [j13]Eun Jung Kim, Daniel Gonçalves:
On exact algorithms for the permutation CSP. Theor. Comput. Sci. 511: 109-116 (2013) - [c16]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: 613-624 - [c15]Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
On Subexponential and FPT-Time Inapproximability. IPEC 2013: 54-65 - [c14]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. TAFA 2013: 158-175 - 2012
- [j12]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): 112-125 (2012) - [c13]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider:
Don't Be Strict in Local Search! AAAI 2012: 486-492 - [c12]Eun Jung Kim, Sebastian Ordyniak:
Valued-Based Argumentation for Tree-like Value Graphs. COMMA 2012: 378-389 - [c11]Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem. SWAT 2012: 119-130 - [i21]Eun Jung Kim, Daniel Gonçalves:
On Exact Algorithms for Permutation CSP. CoRR abs/1203.2801 (2012) - [i20]Eun Jung Kim, Christophe Paul, Geevarghese Philip:
A single-exponential FPT algorithm for the $K_4$-minor cover problem. CoRR abs/1204.1417 (2012) - [i19]Eun Jung Kim, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar:
Linear kernels and single-exponential algorithms via protrusion decompositions. CoRR abs/1207.0835 (2012) - [i18]Serge Gaspers, Eun Jung Kim, Sebastian Ordyniak, Saket Saurabh, Stefan Szeider:
Don't Be Strict in Local Search! CoRR abs/1208.1688 (2012) - [i17]Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos:
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems. CoRR abs/1211.6656 (2012) - 2011
- [j11]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and complexity results for persuasive argumentation. Artif. Intell. 175(9-10): 1722-1736 (2011) - [j10]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011) - [j9]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. 77(2): 422-429 (2011) - [j8]Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. 48(2): 402-410 (2011) - [c10]Eun Jung Kim, Ryan Williams:
Improved Parameterized Algorithms for above Average Constraint Satisfaction. IPEC 2011: 118-131 - [i16]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Persuasive Argumentation. CoRR abs/1104.4290 (2011) - [i15]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. CoRR abs/1106.3527 (2011) - 2010
- [b1]Eun Jung Kim:
Parameterized algorithms on digraph and constraint satisfaction problems. Royal Holloway, University of London, UK, 2010 - [j7]Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs. Australas. J Comb. 46: 217-232 (2010) - [j6]Gregory Z. Gutin, Eun Jung Kim:
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. Discret. Appl. Math. 158(4): 319-330 (2010) - [j5]Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo:
FPT algorithms and kernels for the Directed k-Leaf problem. J. Comput. Syst. Sci. 76(2): 144-152 (2010) - [j4]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. 76(7): 650-662 (2010) - [j3]Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo:
Betweenness parameterized above tight lower bound. J. Comput. Syst. Sci. 76(8): 872-878 (2010) - [c9]Eun Jung Kim, Sebastian Ordyniak, Stefan Szeider:
Algorithms and Complexity Results for Persuasive Argumentation. COMMA 2010: 311-322 - [c8]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. IPEC 2010: 158-169 - [c7]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517 - [c6]Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa:
Systems of Linear Equations over F2 and Problems Parameterized above Average. SWAT 2010: 164-175 - [i14]Robert Crowston, Gregory Z. Gutin, Mark Jones, Eun Jung Kim, Imre Z. Ruzsa:
Systems of Linear Equations over F2 and Problems Parameterized Above Average. CoRR abs/1002.0286 (2010) - [i13]Eun Jung Kim, Ryan Williams:
Improved Parameterized Algorithms for Constraint Satisfaction. CoRR abs/1008.0213 (2010)
2000 – 2009
- 2009
- [j2]Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim:
On complexity of Minimum Leaf Out-Branching problem. Discret. Appl. Math. 157(13): 3000-3004 (2009) - [j1]Gregory Z. Gutin, Igor Razgon, Eun Jung Kim:
Minimum leaf out-branching and related problems. Theor. Comput. Sci. 410(45): 4571-4579 (2009) - [c5]Gregory Z. Gutin, Eun Jung Kim:
Properly Coloured Cycles and Paths: Results and Open Problems. Graph Theory, Computational Intelligence and Thought 2009: 200-208 - [c4]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. COCOON 2009: 37-46 - [c3]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245 - [i12]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem. CoRR abs/0903.0938 (2009) - [i11]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound. CoRR abs/0906.1356 (2009) - [i10]Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds. CoRR abs/0907.4488 (2009) - [i9]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-2-SAT Above a Tight Lower Bound. CoRR abs/0907.4573 (2009) - [i8]Gregory Z. Gutin, Eun Jung Kim, Matthias Mnich, Anders Yeo:
Ordinal Embedding Relaxations Parameterized Above Tight Lower Bound. CoRR abs/0907.5427 (2009) - 2008
- [c2]Gregory Z. Gutin, Igor Razgon, Eun Jung Kim:
Minimum Leaf Out-Branching Problems. AAIM 2008: 235-246 - [c1]Arvind Gupta, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. COCOA 2008: 374-383 - [i7]Gregory Z. Gutin, Eun Jung Kim, Igor Razgon:
Minimum Leaf Out-Branching Problems. CoRR abs/0801.1979 (2008) - [i6]Gregory Z. Gutin, Eun Jung Kim:
Properly Coloured Cycles and Paths: Results and Open Problems. CoRR abs/0805.3901 (2008) - [i5]Peter Dankelmann, Gregory Z. Gutin, Eun Jung Kim:
On Complexity of Minimum Leaf Out-branching Problem. CoRR abs/0808.0980 (2008) - [i4]Jean Daligault, Gregory Z. Gutin, Eun Jung Kim, Anders Yeo:
FPT Algorithms and Kernels for the Directed $k$-Leaf Problem. CoRR abs/0810.4946 (2008) - 2007
- [i3]Gregory Z. Gutin, Eun Jung Kim:
On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments. CoRR abs/0708.2544 (2007) - [i2]Eun Jung Kim, Gregory Z. Gutin:
Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops. CoRR abs/0708.2545 (2007) - [i1]Arvind Gupta, Gregory Z. Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey:
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs. CoRR abs/0712.0804 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 21:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
