Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Eun Jung Kim

Email : eunjungkim78@gmail.com

Bureau : P627
Site Personnel: http://lamsade.dauphine.fr/~kim/
Pole : Optimisation combinatoire algorithmique
Status : Chargé de Recherche
Domaines de Recherche : Algorithms design, complexity analysis


Publications Dblp




  • Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Christophe Paul
    An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion.Algorithmica79(1) 2017:66-95

  • Holger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke
    Complexity and Approximability of Parameterized MAX-CSPs.Algorithmica79(1) 2017:230-250

  • Eun Jung Kim 0002, O-joung Kwon
    A Polynomial Kernel for Block Graph Deletion.Algorithmica79(1) 2017:251-270

  • Eun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
    Parameterized algorithms for min-max multiway cut and list digraph homomorphism.J. Comput. Syst. Sci.86 2017:191-206

  • Nathann Cohen, Daniel Gonçalves 0001, Eun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
    A polynomial-time algorithm for Outerplanar Diameter Improvement.J. Comput. Syst. Sci.89 2017:315-327

  • Jisu Jeong, Eun Jung Kim 0002, Sang-il Oum
    The "Art of Trellis Decoding" Is Fixed-Parameter Tractable.IEEE Trans. Information Theory63(11) 2017:7178-7205

  • Eun Jung Kim 0002, O-joung Kwon
    A Polynomial Kernel for Distance-Hereditary Vertex Deletion.WADS 2017:509-520

  • Eun Jung Kim 0002, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
    Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions.ACM Trans. Algorithms12(2) 2016:21:1-21:41

  • Jisu Jeong, Eun Jung Kim 0002, Sang-il Oum
    Constructive algorithm for path-width of matroids.SODA 2016:1695-1704

  • Eun Jung Kim 0002, O-joung Kwon
    A Polynomial Kernel for Distance-Hereditary Vertex Deletion.CoRRabs/1610.07229 2016:

  • Edouard Bonnet, Bruno Escoffier, Eun Jung Kim 0002, Vangelis Th. Paschos
    On Subexponential and FPT-Time Inapproximability.Algorithmica71(3) 2015:541-565

  • Eun Jung Kim 0002, Christophe Paul, Geevarghese Philip
    A single-exponential FPT algorithm for the K-minor cover problem.J. Comput. Syst. Sci.81(1) 2015:186-207

  • Edouard Bonnet, Florent Foucaud, Eun Jung Kim 0002, Florian Sikora
    Complexity of Grundy Coloring and Its Variants.COCOON 2015:109-120

  • Nathann Cohen, Daniel Gonçalves 0001, Eunjung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
    A Polynomial-Time Algorithm for Outerplanar Diameter Improvement.CSR 2015:123-142

  • Eun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
    Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism.IPEC 2015:78-89

  • Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Christophe Paul
    An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion.IPEC 2015:138-150

  • Eun Jung Kim 0002, O-joung Kwon
    A Polynomial Kernel for Block Graph Deletion.IPEC 2015:270-281

  • Holger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke
    Complexity and Approximability of Parameterized MAX-CSPs.IPEC 2015:294-306

  • Robert Ganian, Eun Jung Kim 0002, Stefan Szeider
    Algorithmic Applications of Tree-Cut Width.MFCS (2) 2015:348-360

  • Eunjung Kim 0002, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
    An FPT 2-Approximation for Tree-cut Decomposition.WAOA 2015:35-46

  • Eun Jung Kim 0002, Martin Milanic, Oliver Schaudt
    Recognizing k-equistable Graphs in FPT Time.WG 2015:487-498

  • Eun Jung Kim 0002, Martin Milanic, Oliver Schaudt
    Recognizing k-equistable graphs in FPT time.CoRRabs/1503.01098 2015:

  • Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Christophe Paul
    FPT Algorithm and Polynomial Kernel for Linear Rank-width One Vertex Deletion.CoRRabs/1504.05905 2015:

  • Eun Jung Kim 0002, O-joung Kwon
    A polynomial kernel for Block Graph Vertex Deletion.CoRRabs/1506.08477 2015:

  • Jisu Jeong, Eun Jung Kim 0002, Sang-il Oum
    Constructive algorithm for path-width of matroids.CoRRabs/1507.02184 2015:

  • Eunjung Kim 0002, Sang-il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
    An FPT 2-Approximation for Tree-Cut Decomposition.CoRRabs/1509.04880 2015:

  • Eunjung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos
    Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism.CoRRabs/1509.07404 2015:

  • Holger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke
    Complexity and Approximability of Parameterized MAX-CSPs.CoRRabs/1511.05546 2015:

  • Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Eun Jung Kim 0002, 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:687-696

  • Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider
    The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.CoRRabs/1402.6109 2014:

  • Nathann Cohen, Daniel Gonçalves 0001, Eun Jung Kim 0002, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
    A Polynomial-time Algorithm for Outerplanar Diameter Improvement.CoRRabs/1403.5702 2014:

  • Edouard Bonnet, Florent Foucaud, Eun Jung Kim 0002, Florian Sikora
    Complexity of Grundy coloring and its variants.CoRRabs/1407.5336 2014:

  • Eun Jung Kim 0002, Daniel Gonçalves 0001
    On exact algorithms for the permutation CSP.Theor. Comput. Sci.511 2013:109-116

  • Eun Jung Kim 0002, 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

  • Edouard Bonnet, Bruno Escoffier, Eun Jung Kim 0002, Vangelis Th. Paschos
    On Subexponential and FPT-Time Inapproximability.IPEC 2013:54-65

  • Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider
    The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation.TAFA 2013:158-175

  • Gregory Gutin, Eun Jung Kim 0002, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
    Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming.Algorithmica64(1) 2012:112-125

  • Serge Gaspers, Eun Jung Kim 0002, Sebastian Ordyniak, Saket Saurabh 0001, Stefan Szeider
    Don't Be Strict in Local Search!AAAI 2012:

  • Eun Jung Kim 0002, Sebastian Ordyniak
    Valued-Based Argumentation for Tree-like Value Graphs.COMMA 2012:378-389

  • Eun Jung Kim 0002, Christophe Paul, Geevarghese Philip
    A Single-Exponential FPT Algorithm for the K 4-Minor Cover Problem.SWAT 2012:119-130

  • Eun Jung Kim 0002, Daniel Gonçalves 0001
    On Exact Algorithms for Permutation CSPCoRRabs/1203.2801 2012:

  • Eun Jung Kim 0002, Christophe Paul, Geevarghese Philip
    A single-exponential FPT algorithm for the $K_4$-minor cover problemCoRRabs/1204.1417 2012:

  • Eun Jung Kim 0002, Alexander Langer, Christophe Paul, Felix Reidl, Peter Rossmanith, Ignasi Sau, Somnath Sikdar
    Linear kernels and single-exponential algorithms via protrusion decompositionsCoRRabs/1207.0835 2012:

  • Serge Gaspers, Eun Jung Kim 0002, Sebastian Ordyniak, Saket Saurabh 0001, Stefan Szeider
    Don't Be Strict in Local Search!CoRRabs/1208.1688 2012:

  • Bruno Escoffier, Eun Jung Kim 0002, Vangelis Th. Paschos
    Subexponential and FPT-time Inapproximability of Independent Set and Related ProblemsCoRRabs/1211.6656 2012:

  • Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider
    Algorithms and complexity results for persuasive argumentation.Artif. Intell.175(9-10) 2011:1722-1736

  • Noga Alon, Gregory Gutin, Eun Jung Kim 0002, Stefan Szeider, Anders Yeo
    Solving MAX--SAT Above a Tight Lower Bound.Algorithmica61(3) 2011:638-655

  • Gregory Gutin, Eun Jung Kim 0002, Stefan Szeider, Anders Yeo
    A probabilistic approach to problems parameterized above or below tight bounds.J. Comput. Syst. Sci.77(2) 2011:422-429

  • Gregory Gutin, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou
    Vertex Cover Problem Parameterized Above and Below Tight Bounds.Theory Comput. Syst.48(2) 2011:402-410

  • Eun Jung Kim 0002, Ryan Williams 0001
    Improved Parameterized Algorithms for above Average Constraint Satisfaction.IPEC 2011:118-131

  • Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider
    Algorithms and Complexity Results for Persuasive ArgumentationCoRRabs/1104.4290 2011:

  • Gregory Gutin, Eun Jung Kim 0002, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo
    Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint ProgrammingCoRRabs/1106.3527 2011:

  • Eun Jung Kim 0002
    Parameterized algorithms on digraph and constraint satisfaction problems. 2010:

  • Arvind Gupta, Gregory Gutin, Mehdi Karimi, Eun Jung Kim 0002, Arash Rafiey
    Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs.Australasian J. Combinatorics46 2010:217-232

  • Gregory Gutin, Eun Jung Kim 0002
    The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops.Discrete Applied Mathematics158(4) 2010:319-330

  • Jean Daligault, Gregory Gutin, Eun Jung Kim 0002, Anders Yeo
    FPT algorithms and kernels for the Directed k-Leaf problem.J. Comput. Syst. Sci.76(2) 2010:144-152

  • Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim 0002, Saket Saurabh 0001, Anders Yeo
    Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.J. Comput. Syst. Sci.76(7) 2010:650-662

  • Gregory Gutin, Eun Jung Kim 0002, Matthias Mnich, Anders Yeo
    Betweenness parameterized above tight lower bound.J. Comput. Syst. Sci.76(8) 2010:872-878

  • Eun Jung Kim 0002, Sebastian Ordyniak, Stefan Szeider
    Algorithms and Complexity Results for Persuasive Argumentation.COMMA 2010:311-322

  • Gregory Gutin, Eun Jung Kim 0002, 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

  • Noga Alon, Gregory Gutin, Eun Jung Kim 0002, Stefan Szeider, Anders Yeo
    Solving MAX-r-SAT Above a Tight Lower Bound.SODA 2010:511-517

  • Robert Crowston, Gregory Gutin, Mark Jones, Eun Jung Kim 0002, Imre Z. Ruzsa
    Systems of Linear Equations over F and Problems Parameterized above Average.SWAT 2010:164-175

  • Robert Crowston, Gregory Gutin, Mark Jones, Eun Jung Kim 0002, Imre Z. Ruzsa
    Systems of Linear Equations over F and Problems Parameterized Above AverageCoRRabs/1002.0286 2010:

  • Eun Jung Kim 0002, Ryan Williams 0001
    Improved Parameterized Algorithms for Constraint SatisfactionCoRRabs/1008.0213 2010:

  • Peter Dankelmann, Gregory Gutin, Eun Jung Kim 0002
    On complexity of Minimum Leaf Out-Branching problem.Discrete Applied Mathematics157(13) 2009:3000-3004

  • Gregory Gutin, Igor Razgon, Eun Jung Kim 0002
    Minimum leaf out-branching and related problems.Theor. Comput. Sci.410(45) 2009:4571-4579

  • Gregory Gutin, Eun Jung Kim 0002
    Properly Coloured Cycles and Paths: Results and Open Problems.Graph Theory, Computational Intelligence and Thought 2009:200-208

  • Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim 0002, Saket Saurabh 0001, Anders Yeo
    Algorithm for Finding -Vertex Out-trees and Its Application to -Internal Out-branching Problem.COCOON 2009:37-46

  • Gregory Gutin, Eun Jung Kim 0002, Stefan Szeider, Anders Yeo
    A Probabilistic Approach to Problems Parameterized above or below Tight Bounds.IWPEC 2009:234-245

  • Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim 0002, Saket Saurabh 0001, Anders Yeo
    Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching ProblemCoRRabs/0903.0938 2009:

  • Gregory Gutin, Eun Jung Kim 0002, Stefan Szeider, Anders Yeo
    A Probabilistic Approach to Problems Parameterized Above Tight Lower BoundCoRRabs/0906.1356 2009:

  • Gregory Gutin, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou
    Vertex Cover Problem Parameterized Above and Below Tight BoundsCoRRabs/0907.4488 2009:

  • Gregory Gutin, Eun Jung Kim 0002, Stefan Szeider, Anders Yeo
    Solving MAX-2-SAT Above a Tight Lower BoundCoRRabs/0907.4573 2009:

  • Gregory Gutin, Eun Jung Kim 0002, Matthias Mnich, Anders Yeo
    Ordinal Embedding Relaxations Parameterized Above Tight Lower BoundCoRRabs/0907.5427 2009:

  • Gregory Gutin, Igor Razgon, Eun Jung Kim 0002
    Minimum Leaf Out-Branching Problems.AAIM 2008:235-246

  • Arvind Gupta, Mehdi Karimi, Eun Jung Kim 0002, Arash Rafiey
    Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs.COCOA 2008:374-383

  • Gregory Gutin, Eun Jung Kim 0002, Igor Razgon
    Minimum Leaf Out-Branching ProblemsCoRRabs/0801.1979 2008:

  • Gregory Gutin, Eun Jung Kim 0002
    Properly Coloured Cycles and Paths: Results and Open ProblemsCoRRabs/0805.3901 2008:

  • Peter Dankelmann, Gregory Gutin, Eun Jung Kim 0002
    On Complexity of Minimum Leaf Out-branching ProblemCoRRabs/0808.0980 2008:

  • Jean Daligault, Gregory Gutin, Eun Jung Kim 0002, Anders Yeo
    FPT Algorithms and Kernels for the Directed $k$-Leaf ProblemCoRRabs/0810.4946 2008:

  • Gregory Gutin, Eun Jung Kim 0002
    On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite TournamentsCoRRabs/0708.2544 2007:

  • Eun Jung Kim 0002, Gregory Gutin
    Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible LoopsCoRRabs/0708.2545 2007:

  • Arvind Gupta, Gregory Gutin, Mehdi Karimi, Eun Jung Kim 0002, Arash Rafiey
    Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive DigraphsCoRRabs/0712.0804 2007:



Publications DFIS


Publications HAL