Eun Jung Kim (parameterized complexity)

Eun Jung Kim (Korean: 김은정) is a South Korean computer scientist and graph theorist specializing in parameterized complexity, parameterized algorithms for constraint satisfaction problems, and width parameters in graphs and matroids. She is a researcher for the French National Centre for Scientific Research (CNRS), associated with Paris Dauphine University.[1]

Education and career

Kim studied industrial engineering at KAIST in Korea, obtaining a master's degree, and then completed her Ph.D. in computer science in 2010 at Royal Holloway, University of London.[2] Her dissertation was supervised by Gregory Gutin.[3]

After postdoctoral research in Montpellier, France, at the Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier, she became a CNRS researcher in 2011, affiliated with the Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE) at Paris Dauphine University.[2]

Recognition

In 2017, Kim was awarded the CNRS Bronze Medal.[4][1]

References
  1. Eun Jung Kim, Chercheuse en informatique, Médaille de bronze du CNRS 2017 (in French), CNRS, retrieved 2022-03-08
  2. "Eun Jung Kim", Current long-term visitors, Simons Institute for the Theory of Computing, 2015, retrieved 2022-03-08
  3. "Ms Eun Jung Kim", Researcher profiles, Royal Holloway Computer Science, retrieved 2022-03-08
  4. "Eunjung Kim – CNRS Bronze Medal" (PDF), Parameterized Complexity News, vol. 13, no. 1, November 2017
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.