Nos tutelles

CNRS Dauphine PSL *

Rechercher





Accueil > PERSONNES

Membres

publié le , mis à jour le

retour a la liste des membres

Cristina Bazgan

Email : Bazgan.Cristina@lamsade.dauphine.fr

Tel : 0144054090
Bureau : P409
Site Personnel: http://lamsade.dauphine.fr/~bazgan/
Pole : Optimisation combinatoire algorithmique
Status : Professeur

  • Expert IUF junior

  • Encadrement de these de doctorat :


    • Thomas Pontoizeau : Problèmes d'optimisation dans les réseaux sociaux ( Début : 2014-10-01)
    • Paul Beaujean : Conception d?architectures de réseaux optimisées et robustes face à la propagation d?instabilités ( Début : 2015-04-01)
    voir toutes les theses

    Publications Dblp


    Publications DFIS


    48 Structural and algorithmic properties of 2-community structures (, and ), In Algorithmica, . [bibtex] [doi]

    47 On the complexity of finding a potential community (, and ), In , Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC 2017), . [bibtex]

    46 Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (, and ), In European Journal of Operational Research, volume 260, . [bibtex] [doi]

    45 Upper Domination : Complexity and Approximation (, , , , , , , , and ), In Combinatorial Algorithms. 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings (Veli Mäkinen, Simon J. Puglisi, Leena Salmela, ed.), Springer, . [bibtex]

    44 On the Approximability of Partial VC Dimension (, and ), In Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016 (T-H. Hubert Chan, Minming Li, Lusheng Wang, ed.), Springer, . [bibtex]

    43 On the Complexity Landscape of the Domination Chain (, , and ), In Algorithms and Discrete Applied Mathematics - Second International Conference, CALDAM 2016 (Sathish Govindarajan, Anil Maheshwari, ed.), Springer, . [bibtex]

    42 Finding large degree-anonymous subgraphs is hard (, , , and ), In Theoretical Computer Science, volume 622, . [bibtex] [doi]

    41 Algorithmic Aspects of Upper Domination: A Parameterized Perspective (, , , , , , , , and ), In Algorithmic Aspects in Information and Management. 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings (Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri, ed.), Springer, . [bibtex]

    40 Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms (, , and ), In Journal of Computer and System Sciences, volume 82, . [bibtex] [doi]

    39 Building Clusters with Lower-Bounded Sizes (, , and ), In 27th International Symposium on Algorithms and Computation, ISAAC 2016 (Seok-Hee Hong, ed.), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, . [bibtex]

    38 New Insight into 2-Community Structures in Graphs with Applications in Social Networks (, and ), In Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015 (Zaixin Lu, Donghyun Kim, Weili Wu, Wei Li, Ding-Zhu Du, ed.), Springer, . [bibtex]

    37 Blockers for the stability number and the chromatic number (, , and ), In Graphs and Combinatorics, volume 31, . [bibtex] [doi]

    36 Approximate Pareto sets of minimal size for multi-objective optimization problems (, and ), In Operations Research Letters, volume 43, . [bibtex] [doi]

    35 A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (, and ), In Algorithms and Complexity - 9th International Conference, CIAC 2015 (Vangelis Th. Paschos, Peter Widmayer, ed.), Springer, . [bibtex]

    34 On the Complexity of QoS-Aware Service Selection Problem (, , and ), In Service-Oriented Computing. 13th International Conference, ICSOC 2015, Goa, India, November 16-19, 2015, Proceedings (Alistair Barros, Daniela Grigori, Nanjangud C. Narendra, Hoa Khanh Dam, ed.), Springer Berlin Heidelberg, . [bibtex]

    33 Parameterized approximability of maximizing the spread of influence in networks (, , and ), In Journal of Discrete Algorithms, volume 27, . [bibtex] [doi]

    32 The Complexity of Finding Harmless Individuals in Social Networks ( and ), In Discrete Optimization, volume 14, . [bibtex] [doi]

    31 Parameterized Inapproximability of Target Set Selection and Generalizations (, , and ), In Language, Life, Limits.10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings (Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer, ed.), Springer, . [bibtex]

    30 Parameterized Complexity of Firefighting (, , , , and ), In Journal of Computer and System Sciences, volume 80, . [bibtex] [doi]

    29 Parameterized Inapproximability of Degree Anonymization ( and ), In Parameterized and Exact Computation - 9th International Symposium, IPEC 2014 (Marek Cygan, Pinar Heggernes, ed.), Springer, . [bibtex]

    28 Parameterized Inapproximability of Target Set Selection and Generalizations (, , and ), In Computability, volume 3, . [bibtex] [pdf] [doi]

    27 Complexity and approximation for Traveling Salesman Problems with profits (, , and ), In Theoretical Computer Science, volume 531, . [bibtex] [doi]

    26 Approximation Algorithms Inspired by Kernelization Methods (, , and ), In Algorithms and Computation - 25th International Symposium, ISAAC 2014 (Hee-Kap Ahn, Chan-Su Shin, ed.), Springer, . [bibtex]

    25 The firefighter problem with more than one firefighter on trees (, and ), In Discrete Applied Mathematics, volume 161, . [bibtex] [doi]

    24 Single approximation for the biobjective Max TSP (, , and ), In Theoretical Computer Science, volume 478, . [bibtex] [doi]

    23 Parameterized Approximability of Maximizing the Spread of Influence in Networks (, , and ), In Computing and Combinatorics. 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings (Ding-Zhu Du, Guochuan Zhang, ed.), Springer, . [bibtex]

    22 On the number of non-dominated points of a multicriteria optimization problem (, and ), In Discrete Applied Mathematics, volume 161, . [bibtex] [doi]

    21 Critical edges for the assignment problem : complexity and exact resolution (, and ), In Operations Research Letters, volume 41, . [bibtex] [doi]

    20 Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (, and ), In Journal of Combinatorial Optimization, volume 26, . [bibtex] [doi]

    19 Complexity of determining the most vital elements for the p-median and p-center location problems (, and ), In Journal of Combinatorial Optimization, volume 25, . [bibtex] [doi]

    18 Approximation with a fixed number of solutions of some multiobjective maximization problems (, and ), In Journal of Discrete Algorithms, volume 22, . [bibtex] [doi]

    17 The Robust Set Problem: Parameterized Complexity and Approximation ( and ), In Mathematical Foundations of Computer Science 2012 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012, Proceedings (Widmayer, Peter, ed.), Springer, . [bibtex]

    16 Single Approximation for Biobjective Max TSP (, , and ), In WAOA 2011 (Solis-Oba, Roberto, ed.), Springer, . [bibtex]

    15 Efficient determination of the k most vital edges for the minimum spanning tree problem (, and ), In Computers and Operations Research, volume 39, . [bibtex] [doi]

    14 Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems (, and ), In WAOA 2011 (Solis-Oba, Roberto, ed.), Springer, . [bibtex]

    13 The most vital nodes with respect to independent set and vertex cover (, and ), In Discrete Applied Mathematics, volume 159, . [bibtex] [doi]

    12 Parameterized Complexity of the Firefighter Problem (, and ), In ISAAC 2011 (Watanabe, Osamu, ed.), Springer, . [bibtex]

    11 Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem (, and ), In Combinatorial Optimization and Applications 5th International Conference, COCOA 2011 (Zhu, Xuding, ed.), Springer, . [bibtex]

    10 Complexity and approximation of the constrained forest problem (, and ), In Theoretical Computer Science, volume 412, . [bibtex] [doi]

    9 Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (, and ), In Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers (Smyth, William F., ed.), Springer, . [bibtex]

    8 Satisfactory graph partition, variants, and generalizations (, and ), In European Journal of Operational Research, volume 206, . [bibtex] [doi]

    7 Optimal Satisfiability (), Chapter in (Paschos, Vangelis Th., ed.), Wiley, . [bibtex]

    6 Complexity of determining the most vital elements for the 1-median and 1-center location problems (, and ), In Combinatorial Optimization and Combinatorial Optimization and Applications 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010, Proceedings, Part I (Wu, Weili, ed.), Springer, . [bibtex]

    5 General approximation schemes for min–max (regret) versions of some (pseudo-)polynomial problems (, and ), In Discrete Optimization, volume 7, . [bibtex] [doi]

    4 Solving efficiently the 0-1 multi-objective knapsack problem (, and ), In Computers and Operations Research, volume 36, . [bibtex] [doi]

    3 Implementing an efficient fptas for the 0–1 multi-objective knapsack problem (, and ), In European Journal of Operational Research, volume 198, . [bibtex] [doi]

    2 Covering a Graph with a Constrained Forest (, and ), In Algorithms and Computation 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings (Yingfei Dong, Ding-Zhu Du, Oscar Ibarra, ed.), Springer, . [bibtex]

    1 Min–max and min–max regret versions of combinatorial optimization problems: A survey (, and ), In European Journal of Operational Research, volume 197, . [bibtex] [doi]

    Publications HAL