Cristina Bazgan | Academic Influence

Cristina Bazgan's AcademicInfluence.com Rankings

Cristina Bazgan

Computer Science

#10346

World Rank

#10858

Historical Rank

Machine Learning

#5670

World Rank

#5748

Historical Rank

Artificial Intelligence

#6119

World Rank

#6214

Historical Rank

Database

#9427

World Rank

#9930

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Cristina Bazgan's Degrees

PhD Computer Science Université Paris Cité
Masters Computer Science Université Paris Cité
Bachelors Computer Science Université Paris Cité

Similar Degrees You Can Earn

Why Is Cristina Bazgan Influential?

(Suggest an Edit or Addition)

According to Wikipedia, 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.

(See a Problem?)

Cristina Bazgan's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Min-max and min-max regret versions of combinatorial optimization problems: A survey (2009) (471)
Solving efficiently the 0-1 multi-objective knapsack problem (2009) (144)
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs (1999) (107)
Complexity of the min-max and min-max regret assignment problems (2005) (92)
Approximation of min-max and min-max regret versions of some combinatorial optimization problems (2007) (65)
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness (2005) (58)
The most vital nodes with respect to independent set and vertex cover (2011) (48)
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (2009) (44)
The satisfactory partition problem (2006) (44)
Approximation algorithms for some vehicle routing problems (2005) (42)
Parameterized approximability of maximizing the spread of influence in networks (2013) (41)
Approximate Pareto sets of minimal size for multi-objective optimization problems (2015) (36)
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs (1999) (36)
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack (2005) (34)
Efficient algorithms for decomposing graphs under degree constraints (2007) (33)
Satisfactory graph partition, variants, and generalizations (2010) (33)
The many facets of upper domination (2017) (31)
Approximating Min-Max (Regret) Versions of Some Polynomial Problems (2006) (29)
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (2010) (28)
Differential approximation for optimal satisfiability and related problems (2003) (27)
Completeness in differential approximation classes (2003) (26)
Complexity of the Min-Max (Regret) Versions of Cut Problems (2005) (26)
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem (1998) (26)
The firefighter problem with more than one firefighter on trees (2011) (26)
On the Existence and Determination of Satisfactory Partitions in a Graph (2003) (25)
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (2013) (24)
Parameterized complexity of firefighting (2014) (23)
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree (2001) (22)
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (2015) (20)
On the differential approximation of MIN SET COVER (2005) (19)
Parameterized Inapproximability of Target Set Selection and Generalizations (2014) (18)
Blockers for the Stability Number and the Chromatic Number (2015) (17)
On the Loebl-Komlós-Sós conjecture (2000) (15)
Complexity of determining the most vital elements for the p-median and p-center location problems (2013) (15)
Degree-constrained decompositions of graphs: Bounded treewidth and planarity (2006) (15)
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (2003) (15)
Efficient determination of the k most vital edges for the minimum spanning tree problem (2012) (15)
Complexity and approximation for Traveling Salesman Problems with profits (2014) (14)
Complexity of determining the most vital elements for the p-median and p-center location problems (2010) (14)
Complexity and Approximation of Satisfactory Partition Problems (2005) (14)
Critical edges for the assignment problem: Complexity and exact resolution (2013) (13)
Data reductions and combinatorial bounds for improved approximation algorithms (2014) (13)
Complexity of the min-max (regret) versions of min cut problems (2008) (13)
A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (2018) (13)
Partitioning vertices of 1-tough graphs into paths (2001) (12)
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem (2007) (12)
Parameterized Complexity of the Firefighter Problem (2011) (11)
Upper Domination: Complexity and Approximation (2016) (11)
Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (2017) (11)
Complexity and approximation of the Constrained Forest problem (2011) (10)
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation (2004) (9)
On the Complexity Landscape of the Domination Chain (2016) (9)
Algorithmic Aspects of Upper Domination: A Parameterised Perspective (2016) (9)
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability (2020) (8)
On the Complexity of Global Constraint Satisfaction (2005) (8)
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract) (1998) (8)
Structural and Algorithmic Properties of 2-Community Structures (2018) (8)
Parameterized Inapproximability of Degree Anonymization (2014) (8)
Pseudo-polynomial algorithms for min-max and min-max regret problems (2005) (8)
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (2008) (8)
A Polynomial Time Approximation Scheme for Dense MIN 2SAT (1999) (8)
Finding large degree-anonymous subgraphs is hard (2016) (7)
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (2010) (6)
Approximation of satisfactory bisection problems (2008) (6)
One-exact approximate Pareto sets (2019) (6)
Parameterized and approximation complexity of Partial VC Dimension (2016) (6)
Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem (2011) (5)
Approximation with a fixed number of solutions of some multiobjective maximization problems (2013) (5)
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem (2007) (5)
On the number of non-dominated points of a multicriteria optimization problem (2013) (5)
The Robust Set Problem: Parameterized Complexity and Approximation (2012) (5)
Approximation Algorithms Inspired by Kernelization Methods (2014) (5)
Complexity of the satisfactory partition problem (2003) (5)
On the Loebl–Komlós–Sós conjecture (2000) (5)
The complexity of finding harmless individuals in social networks (2014) (5)
Aspects of upper defensive alliances (2019) (5)
A Genetic Algorithm for the Maximal Clique Problem (1995) (4)
On the Approximability of Partial VC Dimension (2016) (4)
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems (2019) (4)
On the Complexity of QoS-Aware Service Selection Problem (2015) (4)
Approximability of Dense Instances of NEAREST CODEWORD Problem (2002) (4)
Parameterized Approximability of Influence in Social Networks (2013) (3)
Completeness in differential approximation classes: (Extended abstract) (2003) (3)
Graphs without a partition into two proportionally dense subgraphs (2018) (3)
Single Approximation for Biobjective Max TSP (2011) (3)
On the Loebl-Koml?s-S?s conjecture (2000) (3)
Building Clusters with Lower-Bounded Sizes (2016) (3)
Monte Carlo Search Algorithms for Network Traffic Engineering (2021) (2)
Clustering with Lower-Bounded Sizes-A General Graph-Theoretic Framework (2017) (2)
An FPTAS for a General Class of Parametric Optimization Problems (2019) (2)
Differential Approximation for Some Routing Problems (2003) (2)
Proportionally dense subgraph of maximum size: complexity and approximation (2019) (2)
Single approximation for the biobjective Max TSP (2013) (2)
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems (2011) (2)
Parameterized Dynamic Variants of Red-Blue Dominating Set (2020) (2)
An approximation algorithm for a general class of parametric optimization problems (2020) (1)
Structural and Algorithmic Properties of 2-Community Structures (2017) (1)
Pseudo-Polynomial Algorithms for Min-Max (2005) (1)
Degree-anonymization using edge rotations (2021) (1)
Graphs without $2$-community structures (2018) (1)
Covering a Graph with a Constrained Forest (Extended Abstract) (2009) (1)
Algorithmic Aspects of Upper Domination (2015) (1)
Dense Graph Partitioning on sparse and dense graphs (2021) (1)
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem (2018) (1)
Greedy Differential Approximations for Min Set Cover (2005) (1)
On Approximate Kernels of Minimal Size for Bicriteria Problems (2013) (0)
Communities in Networks: Detection of dense subgraphs and partitions (2022) (0)
PTAS-completeness in standard and differential approximation ( Preliminary version ) (2008) (0)
Exact and approximate determination of the Pareto set using minimal correction subsets (2022) (0)
Finding a potential community in networks (2019) (0)
On the Complexity of Finding a Potential Community (2017) (0)
An approximation algorithm for the maximum spectral subgraph problem (2020) (0)
Clustering with Lower-Bounded Sizes (2018) (0)
Approximation with a xed number of solutions of somemultiobje tive maximization problems ∗ (2013) (0)
Approximation in multiobjective optimization using e-kernels (2014) (0)
On the complexity of recognizing decomposable perfect graphs (2000) (0)
Differential approximation for satisfiability and related problems (2003) (0)
Complexity of the satisfactory partition problem NOTE N ° 34 (2003) (0)
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems (2021) (0)
Upper Domination in all its Beauty (2016) (0)
Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi'an, China, July 29–31, 2019, Proceedings (2019) (0)
Differential approximations for min set cover (2018) (0)
Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping (2022) (0)
Blockers for the Stability Number and the Chromatic Number (2013) (0)
Clustering with Lower-Bounded Sizes (2017) (0)
A note on the approximability of the toughness of graphs (2004) (0)
Single approximation for Biobje tive Max TSP ∗ (2011) (0)
Decomposition of graphs: some polynomial cases (2003) (0)
CAHIER DU LAMSADE 204 Mars 2003 Completeness in differential approximation classes (2003) (0)
Covering a graph with a constrained forest (2010) (0)
How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations (2020) (0)
New Insight into 2-Community Structures in Graphs with Applications in Social Networks (2015) (0)
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (2012) (0)
On the di erential approximation of min set overCristina (2005) (0)
An approximation algorithm for a general class of parametric optimization problems (2020) (0)
1. Optimal Satisfiability (2014) (0)
On the approximation of multiple criteria Max-TSP (2011) (0)

This paper list is powered by the following services:

Other Resources About Cristina Bazgan

en.wikipedia.org

What Schools Are Affiliated With Cristina Bazgan?

Cristina Bazgan is affiliated with the following schools: