BAZGAN Cristina

Full professor

Cristina.BAZGAN@dauphine.fr
Phone : 01 44 05 40 90
Office : P 409
Website : Website

Current Position - Status

Head of an education program : Mathematics, Computer Science, Decision, Organization
Department of attachment : MIDO
Centre of Research : Aide la dcision (LAMSADE)
Management responsibilities : Director of Doctoral School (408)

Education and qualification

HDR
Sciences information et communication (2003 - Paris-Dauphine)
Ph.D.
Sciences information et communication (1998 - Orsay)
Master (Search) specialty : Informatique (1995 - Orsay)

Curriculum vitae : BAZGAN Cristina

Page 1/8

Fields of teaching, research and professionnal competence

Fields of teaching

Operation research and applications

Algorithmic
Complexity theory

Fields of research

Complexity theory
Approximation algorithms

Areas of Expertise

Complexity and approximation of combinatorial optimization problems, graphs theory, robust optimization

Fields professionnal competence

Number of theses guided and sustained : 5
Number of theses in process : 2

Curriculum vitae : BAZGAN Cristina

Page 2/8

Publications of Cristina BAZGAN

2015
Articles
Bazgan, Cristina ; Jamain, Florian ; Vanderpooten, Daniel . Approximate Pareto sets of minimal size for multi-objective
optimization problems. Operations Research Letters. Volume 43. n 1. 2015. pages 1-6. Elsevier. DOI
http://dx.doi.org/10.1016/j.orl.2014.10.003.
Ries, Bernard ; Picouleau, Christophe ; Bentz, Cdric ; Bazgan, Cristina . Blockers for the stability number and the chromatic
number. Graphs and Combinatorics. Volume 31. n 1. 2015. pages 73-90. Springer. DOI
http://dx.doi.org/10.1007/s00373-013-1380-2.

2014
Articles

van Leeuwen, Erik Jan ; Fomin, Fedor V. ; Fellow, Michael R. ; Cygan, Marek ; Chopin, Morgan ; Bazgan, Cristina .
Parameterized Complexity of Firefighting. Journal of Computer and System Sciences. Volume 80. n 7. 2014. pages
1285-1297. Elsevier. DOI http://dx.doi.org/10.1016/j.jcss.2014.03.001.

2013
Articles

Vanderpooten, Daniel ; Toubaline, Sonia ; Bazgan, Cristina . Critical edges for the assignment problem : complexity and exact
resolution. Operations Research Letters. Volume 41. n 6. 2013. pages 685-689. Elsevier. DOI
http://dx.doi.org/10.1016/j.orl.2013.10.001.
Vanderpooten, Daniel ; Jamain, Florian ; Bazgan, Cristina . On the number of non-dominated points of a multicriteria
optimization problem. Discrete Applied Mathematics. Volume 161. n 18. 2013. pages 2841-2850. Elsevier. DOI
http://dx.doi.org/10.1016/j.dam.2013.07.010.
Monnot, Jrme ; Gourvs, Laurent ; Bazgan, Cristina . Approximation with a fixed number of solutions of some multiobjective
maximization problems. Journal of Discrete Algorithms. Volume 22. 2013. pages 19-29. Elsevier. DOI
http://dx.doi.org/10.1016/j.jda.2013.06.006.
Bazgan, Cristina ; Gourvs, Laurent ; Monnot, Jrme ; Pascual, Fanny . Single approximation for the biobjective Max TSP.
Theoretical Computer Science. Volume 478. 2013. pages 41-50. Elsevier. DOI http://dx.doi.org/10.1016/j.tcs.2013.01.021.
Bazgan, Cristina ; Chopin, Morgan ; Ries, Bernard . The firefighter problem with more than one firefighter on trees. Discrete
Applied Mathematics. Volume 161. n 7-8. 2013. pages 899-908. Elsevier. DOI http://dx.doi.org/10.1016/j.dam.2012.11.011.
Bazgan, Cristina ; Toubaline, Sonia ; Vanderpooten, Daniel . Complexity of determining the most vital elements for the
p-median and p-center location problems. Journal of Combinatorial Optimization. Volume 25. n 2. 2013. pages 191-207.
Springer. DOI http://dx.doi.org/10.1007/s10878-012-9469-8.
Bazgan, Cristina ; Toubaline, Sonia ; Vanderpooten, Daniel . Critical edges/nodes for the minimum spanning tree problem:
complexity and approximation. Journal of Combinatorial Optimization. Volume 26. n 1. 2013. pages 178-189. Springer. DOI
http://dx.doi.org/10.1007/s10878-011-9449-4.

Curriculum vitae : BAZGAN Cristina

2012

Page 3/8

Articles

Bazgan, Cristina ; Toubaline, Sonia ; Vanderpooten, Daniel . Efficient determination of the k most vital edges for the minimum
spanning tree problem. Computers and Operations Research. Volume 39. n 11. 2012. pages 2888-2898. Elsevier. DOI
http://dx.doi.org/10.1016/j.cor.2012.02.023.

Conference Contributions

Bazgan, Cristina ; Chopin, Morgan . The Robust Set Problem: Parameterized Complexity and Approximation. Lecture Notes in
Computer Science. Berlin. Slovaquie. 2012.
Pascual, Fanny ; Monnot, Jrme ; Gourvs, Laurent ; Bazgan, Cristina . Single Approximation for Biobjective Max TSP.
Approximation and Online Algorithms 9th International Workshop, WAOA 2011. Saarbrcken. Allemagne. 2012.
Monnot, Jrme ; Gourvs, Laurent ; Bazgan, Cristina . Approximation with a Fixed Number of Solutions of Some Biobjective
Maximization Problems. Approximation and Online Algorithms 9th International Workshop, WAOA 2011. Saarbrcken.
Allemagne. 2012.

2011
Articles
Tuza, Zsolt ; Coutoux, Basile ; Bazgan, Cristina . Complexity and approximation of the constrained forest problem.
Theoretical Computer Science. Volume 412. n 32. 2011. pages 4081-4091. Elsevier. DOI
http://dx.doi.org/10.1016/j.tcs.2010.07.018.
Tuza, Zsolt ; Toubaline, Sonia ; Bazgan, Cristina . The most vital nodes with respect to independent set and vertex cover.
Discrete Applied Mathematics. Volume 159. n 17. 2011. pages 1933-1946. Elsevier. DOI
http://dx.doi.org/10.1016/j.dam.2011.06.023.

Conference Contributions
Bazgan, Cristina ; Toubaline, Sonia ; Tuza, Zsolt . Complexity of Most Vital Nodes for Independent Set in Graphs Related to
Tree Structures. Lecture Notes in Computer Science. Berlin. Royaume-Uni. 2011.
Vanderpooten, Daniel ; Toubaline, Sonia ; Bazgan, Cristina . Efficient Algorithms for Finding the k Most Vital Edges for the
Minimum Spanning Tree Problem. Combinatorial Optimization and Applications 5th International Conference, COCOA 2011.
Zhangjiajie. Chine. 2011.
Fellows, Michael R. ; Chopin, Morgan ; Bazgan, Cristina . Parameterized Complexity of the Firefighter Problem. ISAAC 2011.
Yokohama. Japon. 2011.

2010
Articles
Vanderpooten, Daniel ; Bazgan, Cristina ; Aissi, Hassene . General approximation schemes for minmax (regret) versions of
some (pseudo-)polynomial problems. Discrete Optimization. Volume 7. n 3. 2010. pages 136-148. Elsevier. DOI
http://dx.doi.org/10.1016/j.disopt.2010.03.004.
Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Satisfactory graph partition, variants, and generalizations. European
Journal of Operational Research. Volume 206. n 2. 2010. pages 271-280. Elsevier. DOI
http://dx.doi.org/10.1016/j.ejor.2009.10.019.

Curriculum vitae : BAZGAN Cristina

Page 4/8

Book chapters

Bazgan, Cristina . Optimal Satisfiability. Paschos, Vangelis Th.. Paradigms of Combinatorial Optimization: Problems and New
Approaches. . 2010. pages 3-31.

Conference Contributions

Vanderpooten, Daniel ; Toubaline, Sonia ; Bazgan, Cristina . Complexity of determining the most vital elements for the
1-median and 1-center location problems. Combinatorial Optimization and Combinatorial Optimization and Applications 4th
International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I. Kailua-Kona.
tats-Unis. 2010.

2009
Articles

Bazgan, Cristina ; Hugot, Hadrien ; Vanderpooten, Daniel . Implementing an efficient fptas for the 01 multi-objective knapsack
problem. European Journal of Operational Research. Volume 198. n 1. 2009. pages 47-56. Elsevier. DOI
http://dx.doi.org/10.1016/j.ejor.2008.07.047.
Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Minmax and minmax regret versions of combinatorial
optimization problems: A survey. European Journal of Operational Research. Volume 197. n 2. 2009. pages 427-438.
Elsevier. DOI http://dx.doi.org/10.1016/j.ejor.2008.09.012.
Vanderpooten, Daniel ; Hugot, Hadrien ; Bazgan, Cristina . Solving efficiently the 0-1 multi-objective knapsack problem.
Computers and Operations Research. Volume 36. n 1. 2009. pages 260-279. Elsevier. DOI
http://dx.doi.org/10.1016/j.cor.2007.09.009.

Conference Contributions

Bazgan, Cristina ; Coutoux, Basile ; Tuza, Zsolt . Covering a Graph with a Constrained Forest. Algorithms and Computation
20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Berlin. tats-Unis.
2009.

2008
Articles

Tuza, Zsolt ; Bazgan, Cristina . Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. Journal of
Discrete Algorithms. Volume 6. n 3. 2008. pages 510-519. Elsevier. DOI http://dx.doi.org/10.1016/j.jda.2007.02.002.
Vanderpooten, Daniel ; Bazgan, Cristina ; Aissi, Hassene . Complexity of the min-max (regret) versions of cut problems.
Discrete Optimization. Volume 5. n 1. 2008. pages 66-73. Elsevier Ltd. DOI http://dx.doi.org/10.1016/j.disopt.2007.11.008.
Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Approximation of satisfactory bisection problems. Journal of Computer
and System Sciences. Volume 74. n 5. 2008. pages 875-883. Elsevier. DOI http://dx.doi.org/10.1016/j.jcss.2007.12.001.

2007
Curriculum vitae : BAZGAN Cristina

Articles

Page 5/8

Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Approximation of min-max and min-max regret versions of some
combinatorial optimization problems. European Journal of Operational Research. Volume 179. n 2. 2007. pages 281-290.
Elsevier. DOI http://dx.doi.org/10.1016/j.ejor.2006.03.023.
Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Efficient algorithms for decomposing graphs under degree constraints.
Discrete Applied Mathematics. Volume 155. n 8. 2007. pages 979-988. Elsevier. DOI
http://dx.doi.org/10.1016/j.dam.2006.10.005.

Book chapters

Bazgan, Cristina . Complexit des problmes de satisfaction de contraintes boolennes. Paschos, Vangelis Th.. Optimisation
combinatoire 5 : problmes paradigmatiques et nouvelles problematiques. Paris. 2007. pages 21-50.

Conference Contributions
Bazgan, Cristina ; Hugot, Hadrien ; Vanderpooten, Daniel . A practical efficient fptas for the 0-1 multi-objective knapsack
problem. 15th Annual European Symposium on Algorithms (ESA 2007). Eilat. Isral. 2007.
Bazgan, Cristina ; Hugot, Hadrien ; Vanderpooten, Daniel . An efficient implementation for the 0-1 multi-objective knapsack
problem. Experimental Algorithms 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings. Berlin.
Italie. 2007.

2006
Articles

Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Degree-constrained decompositions of graphs: bounded treewidth and
planarity. Theoretical Computer Science. Volume 355. n 3. 2006. pages 389-395. Elsevier. DOI
http://dx.doi.org/10.1016/j.tcs.2006.01.024.
Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . The satisfactory partition problem. Discrete Applied Mathematics.
Volume 154. n 8. 2006. pages 1236-1245. Elsevier. DOI http://dx.doi.org/10.1016/j.dam.2005.10.014.

Conference Contributions

Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Approximating min-max (regret) versions of some polynomial
problems. 12th Annual International Conference on Computing and Combinatorics (COCOON 2006). Berlin. Tawan. 2006.

2005
Articles

Demange, Marc ; Bazgan, Cristina ; Ausiello, Giorgio ; Paschos, Vangelis . Completeness in differential approximation classes

Monnot, Jrme ; Hassin, Refael ; Bazgan, Cristina . Approximation algorithms for some vehicle routing problems. Discrete A

Bazgan, Cristina ; Escoffier, Bruno ; Paschos, Vangelis . Completeness in standard and differential approximation classes: Po
http://dx.doi.org/10.1016/j.tcs.2005.03.007.

Curriculum vitae : BAZGAN Cristina

Page 6/8

Bazgan, Cristina ; Monnot, Jrme ; Paschos, Vangelis ; Serrire, Fabrice . On the differential approximation of MIN SET COV

Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Complexity of the min-max and min-max regret assignment problem

Conference Contributions
Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Complexity and approximation of satisfactory partition problems. 11th
Annual International Conference on Computing and Combinatorics (COCOON 2005). Kunming. Chine. 2005.
Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Approximation complexity of min-max (regret) versions of shortest
path, spanning tree, and knapsack. 13th Annual European Symposium on Algorithms (ESA 2005). Berlin. Espagne. 2005.
Bazgan, Cristina ; Karpinski, Marek . On the Complexity of Global Constraint Satisfaction. 16th Annual International
Symposium on Algorithms and Computation (ISAAC 2005). Sanya. Chine. 2005.
Bazgan, Cristina ; Monnot, Jrme ; Paschos, Vangelis ; Serrire, Fabrice . Greedy differential approximations for MIN SET
COVER. SOFSEM 2005: Theory and Practice of Computer Science 31st Conference on Current Trends in Theory and
Practice of Computer Science, Liptovsk Jn, Slovakia, January 22-28, 2005, Proceedings. Berlin. Slovaquie. 2005.
Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Pseudo-polynomial algorithms for min-max and min-max regret
problems. Operations Research and Its Applications. The Fifth International Symposium, ISORA05 Tibet, China, August
813, 2005 Proceedings. Beijing. Chine. 2005.
Aissi, Hassene ; Bazgan, Cristina ; Vanderpooten, Daniel . Complexity of the min-max (regret) versions of cut problems.
Lecture Notes in Computer Science. Berlin. Chine. 2005.

2004
Articles

Bazgan, Cristina . A note on the approximability of the toughness of graphs. Discrete Mathematics. Volume 280. n 1-3. 2004.
pages 215-218. Elsevier. DOI http://dx.doi.org/10.1016/j.disc.2003.10.013.

Conference Contributions

Bazgan, Cristina ; Escoffier, Bruno ; Paschos, Vangelis . Poly-APX- and PTAS-completeness in standard and differential
approximation. Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December
20-22, 2004, Proceedings. Hong Kong. Chine. 2004.

2003
Articles

Bazgan, Cristina ; Paschos, Vangelis . Differential approximation for satisfiability and related problems. European Journal of
Operational Research. Volume 147. n 2. 2003. pages 397-404. Elsevier. DOI
http://dx.doi.org/10.1016/S0377-2217(02)00299-0.

Conference Contributions
Curriculum vitae : BAZGAN Cristina

Page 7/8

Ausiello, Giorgio ; Bazgan, Cristina ; Demange, Marc ; Paschos, Vangelis . Completeness in differential approximation classes

Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . On the existence and determination of satisfactory partitions in a graph

Bazgan, Cristina ; Hassin, Refael ; Monnot, Jrme . Differential approximation for some routing problems. 5th Italian Confere

Working Papers

Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Decomposition of graphs: some polynomial cases. . 2003 .
Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel . Complexity of the satisfactory partition problem. . 2003 .

Curriculum vitae : BAZGAN Cristina

Page 8/8