Cristina Bazgan is a French computer scientist who studies combinatorial optimization and graph theory problems from the points of view of parameterized complexity, fine-grained complexity, approximation algorithms, and regret.

Bazgan earned her Ph.D. in 1998 from the University of Paris-Sud. Her dissertation, Approximation de problèmes d'optimisation et de fonctions totales de NP, was supervised by Miklos Santha.[1] She is a professor at Paris Dauphine University, associated with Lamsade, the Laboratory for Analysis and Modeling Systems for Decision Support.[2]

Bazgan became a junior member of the Institut Universitaire de France in 2011.[3]

References

  1. ↑ Cristina Bazgan at the Mathematics Genealogy Project
  2. ↑ Bazgan Cristina, Paris Dauphine University, retrieved 2019-09-14
  3. ↑ Cristina Bazgan, Institut Universitaire de France, retrieved 2019-09-14


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.