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
edit- ^ Cristina Bazgan at the Mathematics Genealogy Project
- ^ Bazgan Cristina, Paris Dauphine University, retrieved 2019-09-14
- ^ Cristina Bazgan, Institut Universitaire de France, retrieved 2019-09-14
External links
edit
  | This article about a French scientist is a stub. You can help Wikipedia by expanding it. |
 | This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it. |