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


    Publications HAL


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

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

    43 Structural and algorithmic properties of 2-community structures (, and ), In Algorithmica, Springer Verlag, . [bibtex] [pdf] [doi]

    42 On the Approximability of Partial VC Dimension (, and ), In 10th International Conference, COCOA 2016, . [bibtex] [pdf] [doi]

    41 Building Clusters with Lower-Bounded Sizes (, , and ), In 27th International Symposium on Algorithms and Computation, ISAAC 2016, . [bibtex] [pdf] [doi]

    40 Upper Domination: Complexity and Approximation (, , , , , , , , and ), In 27th International Workshop on Combinatorial Algorithms (IWOCA), volume 9843, . [bibtex] [pdf] [doi]

    39 Algorithmic Aspects of Upper Domination: A Parameterised Perspective (, , , , , , , , and ), In 11th International Conference Algorithmic Aspects in Information and Management (AAIM), volume 9778, . [bibtex] [pdf] [doi]

    38 On the Complexity Landscape of the Domination Chain (, , and ), In Second International Conference, CALDAM 2016, . [bibtex] [pdf] [doi]

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

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

    35 New Insight into 2-Community Structures in Graphs with Applications in Social Networks (, and ), In 9th International Conference, COCOA 2015, . [bibtex] [pdf] [doi]

    34 On the Complexity of QoS-Aware Service Selection Problem (, , and ), In 13th International Conference on Service-Oriented Computing, ICSOC 2015, . [bibtex] [pdf] [doi]

    33 A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (, and ), In 9th International Conference - CIAC 2015, . [bibtex] [pdf] [doi]

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

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

    30 Blockers for the stability number and the chromatic number (, , and ), In AKCE International Journal of Graphs and Combinatorics, volume 31, . [bibtex] [pdf]

    29 Approximation Algorithms Inspired by Kernelization Methods (, , and ), In 25th International Symposium, ISAAC 2014, . [bibtex] [pdf] [doi]

    28 Parameterized Inapproximability of Degree Anonymization ( and ), In 9th International Symposium, IPEC 2014, . [bibtex] [pdf] [doi]

    27 Parameterized Inapproximability of Target Set Selection and Generalizations (, , and ), In 10th Conference on Computability in Europe, CiE 2014, . [bibtex] [pdf] [doi]

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

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

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

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

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

    21 Parameterized Approximability of Maximizing the Spread of Influence in Networks (, , and ), In 19th International Conference on Computing and Combinatorics, COCOON 2013, . [bibtex] [pdf] [doi]

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

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

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

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

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

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

    14 The Robust Set Problem: Parameterized Complexity and Approximation ( and ), In 37th International Symposium on Mathematical Foundations of Computer Science , MFCS 2012, . [bibtex] [pdf] [doi]

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

    12 Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems (, and ), In 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, . [bibtex] [pdf]

    11 Min-max and min-max regret versions of some combinatorial optimization problems: a survey (, and ), . [bibtex] [pdf]

    10 Completeness in differential approximation classes (, , and ), . [bibtex] [pdf]

    9 Complexity of the satisfactory partition problem (, and ), . [bibtex] [pdf]

    8 Decomposition of graphs: some polynomial cases (, and ), . [bibtex] [pdf]

    7 Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (, and ), . [bibtex] [pdf]

    6 On the differential approximation of MIN SET COVER (juin 2004) (, , and ), . [bibtex] [pdf]

    5 Differential approximations for min set cover (, , and ), In Theoretical Computer Science, Elsevier, volume 332, . [bibtex] [pdf]

    4 Approximation algorithms for some vehicle routing problems (, and ), In Discrete Applied Mathematics, Elsevier, volume 146, . [bibtex] [pdf]

    3 Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (, and ), In Random Structures and Algorithms, volume 23, . [bibtex] [pdf] [doi]

    2 Approximability of Dense Instances of NEAREST CODEWORD Problem (, and ), In 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, . [bibtex] [pdf] [doi]

    1 On the complexity of recognizing decomposable perfect graphs ( and ), Technical report A00-R-084 || bazgan00a, , . [bibtex] [pdf]