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


Publications HAL


33 A polynomial-time algorithm for Outerplanar Diameter Improvement (, , , , , and ), In Journal of Computer and System Sciences, Elsevier, volume 89, . [bibtex] [pdf] [doi]

32 Parameterized algorithms for min-max multiway cut and list digraph homomorphism (, , and ), In Journal of Computer and System Sciences, Elsevier, volume 86, . [bibtex] [pdf] [doi]

31 Upper Domination: Complexity and Approximation (, , , , , , , , and ), In 27th International Workshop on Combinatorial Algorithms (IWOCA), volume 9843, . [bibtex] [pdf] [doi]

30 Algorithmic Aspects of Upper Domination: A Parameterised Perspective (, , , , , , , , and ), In 11th International Conference Algorithmic Aspects in Information and Management (AAIM), volume 9778, . [bibtex] [pdf] [doi]

29 Electronic energy and electron transfer processes in photoexcited donor-acceptor dyad and triad molecular systems based on triphenylene and perylene diimide units (, , , , , , , , , , , , , and ), In Physical Chemistry Chemical Physics, Royal Society of Chemistry, volume 18, . [bibtex] [pdf] [doi]

28 Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions (, , , , , and ), In ACM Transactions on Algorithms, Association for Computing Machinery, volume 12, . [bibtex] [pdf] [doi]

27 The Visual Object Tracking VOT2015 Challenge Results (, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , and ), In Visual Object Tracking Workshop 2015 at ICCV2015, IEEE, . [bibtex] [pdf] [doi]

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

25 Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism (, , and ), Technical report, LIRMM, . [bibtex] [pdf]

24 An FPT 2-Approximation for Tree-Cut Decomposition (, , , and ), Technical report, LIRMM, . [bibtex] [pdf]

23 Complexity and Approximability of Parameterized MAX-CSPs (, , , and ), In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), . [bibtex] [pdf] [doi]

22 Complexity of Grundy Coloring and Its Variants (, , and ), In 21st International Conference on Computing and Combinatorics, COCOON 2015, . [bibtex] [pdf] [doi]

21 On Subexponential and FPT-Time Inapproximability (, , and ), In Algorithmica, Springer Verlag, volume 71, . [bibtex] [pdf] [doi]

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

19 An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion (, , and ), In IPEC: International Symposium on Parameterized and Exact Computation, volume 43, . [bibtex] [pdf]

18 An FPT 2-Approximation for Tree-cut Decomposition (, , , and ), In WAOA: International Workshop on Approximation and Online Algorithms, volume LNCS, . [bibtex] [pdf] [doi]

17 A single-exponential FPT algorithm for the $K\_4$-minor cover problem (, and ), In Journal of Computer and System Sciences, Elsevier, volume 81, . [bibtex] [pdf]

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

15 A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (, , , , , and ), In International Computer Science Symposium in Russia - CRS, volume 9139, . [bibtex] [pdf]

14 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] [pdf] [doi]

13 On exact algorithms for the permutation CSP ( and ), In Journal of Theoretical Computer Science (TCS), Elsevier, volume 511, . [bibtex] [pdf] [doi]

12 A note on the NP-hardness of two matching problems in induced subgrids (), In Discrete Mathematics and Theoretical Computer Science, DMTCS, volume Vol. 15 no. 2, . [bibtex] [pdf]

11 On Subexponential and FPT-time Inapproximability (, , and ), In 8th International Symposium, IPEC 2013, . [bibtex] [pdf] [doi]

10 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, . [bibtex] [pdf] [doi]

9 Linear Kernels and Single-Exponential Algorithms via Protrusion Decompositions (, , , , , and ), In Automata, Languages, and Programming. 40th International Colloquium, ICALP 2013, . [bibtex] [pdf] [doi]

8 Linear Kernels and Single-exponential Algorithms via Protrusion Decompositions (, , , , , and ), In ICALP: International Colloquium on Automata, Languages and Programming, volume 1, . [bibtex] [pdf]

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

6 Congestion games with capacitated resources (, , and ), In 5th International Symposium on Algorithmic Game Theory (SAGT 2012), volume 7615, . [bibtex] [pdf] [doi]

5 Don't Be Strict in Local Search! (, , , and ), In AAAI 2012, . [bibtex] [pdf]

4 Subexponential and FPT-time Inapproximability of Independent Set and Related Problems (, and ), . [bibtex] [pdf]

3 Valued-Based Argumentation for Tree-like Value Graphs ( and ), Chapter in Computational Models of Argument, . [bibtex] [pdf] [doi]

2 Strategy-proof Mechanisms for Facility Location Games with Many Facilities (, , , and ), In 2nd International Conference on Algorithmic Decision Theory (ADT'11), Springer, volume 6992, . [bibtex] [pdf] [doi]

1 Improved Parameterized Algorithms for above Average Constraint Satisfaction ( and ), In 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, . [bibtex] [pdf] [doi]