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


Publications DFIS


19 On some applications of the selective graph coloring problem (, , and ), In European Journal of Operational Research, volume 240, . [bibtex] [doi]

18 On Subexponential and FPT-Time Inapproximability (, , and ), In Algorithmica, volume 71, . [bibtex] [doi]

17 A single-exponential FPT algorithm for the K4-minor cover problem (, and ), In Journal of Computer and System Sciences, volume 81, . [bibtex] [doi]

16 Congestion Games with Capacitated Resources (, , and ), In Theory of Computing Systems, volume 57, . [bibtex] [doi]

15 Complexity and Approximability of Parameterized MAX-CSPs (, , , and ), In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015) (Thore Husfeldt, Iyad Kanj, ed.), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, . [bibtex]

14 Complexity of Grundy Coloring and Its Variants (, , and ), In Computing and Combinatorics. 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings (Dachuan Xu, Donglei Du, Dingzhu Du, ed.), Springer International Publishing, . [bibtex]

13 Satisfying more than half of a system of linear equations over GF(2): A multivariate approach (, , , , , , , and ), In Journal of Computer and System Sciences, volume 80, . [bibtex] [doi]

12 The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation (, and ), In Theory and Applications of Formal Argumentation; Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected papers (Elizabeth Black, Sanjay Modgil, Nir Oren, ed.), Springer Berlin Heidelberg, . [bibtex]

11 Perfectness of clustered graphs (, , and ), In Discrete Optimization, volume 10, . [bibtex] [doi]

10 On Subexponential and FPT-time Inapproximability (, , and ), In Parameterized and Exact Computation 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers (Szeider, Stefan, ed.), Springer, . [bibtex]

9 On Exact Algorithms for Permutation CSP ( and ), In Theoretical Computer Science, volume 511, . [bibtex] [doi]

8 Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions (, , , , , and ), In Automata, Languages, and Programming. 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I (Fedor V. Fomin, Rūsiņš Freivalds, Marta Kwiatkowska, David Peleg, ed.), Springer Berlin Heidelberg, . [bibtex]

7 Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming (, , , and ), In Algorithmica, volume 64, . [bibtex] [pdf] [doi]

6 Improved Parameterized Algorithms for above Average Constraint Satisfaction ( and ), In Parameterized and Exact Computation 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers (Rossmanith, Peter, ed.), Springer, . [bibtex]

5 Valued-Based Argumentation for Tree-like Value Graphs ( and ), Chapter in (Woltran, Stefan, ed.), IOS Press, . [bibtex]

4 Don't Be Strict in Local Search! (, , , and ), In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (Selman, Bart, ed.), AAAI Press, . [bibtex]

3 Congestion Games with Capacitated Resources (, , and ), In Algorithmic Game Theory 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings (Serna, Maria, ed.), Springer, . [bibtex]

2 Algorithmes à véracité garantie pour le placement d'installations sur une ligne (, , , and ), . [bibtex]

1 Split-critical and uniquely split-colorable graphs (, and ), In Discrete Mathematics and Theoretical Computer Science, volume 12, . [bibtex]

Publications HAL