Cristina Bazgan

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 44

Top Venues

Publications

Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez
Destroying Densest Subgraphs is Hard. CoRR (2024)
Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez
Destroying Densest Subgraphs Is Hard. SWAT (2024)
Cristina Bazgan, Henning Fernau
Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022. Algorithmica 86 (3) (2024)
Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, Pierre-Henri Wuillemin
Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping. AAAI (2023)
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
Approximating Multiobjective Optimization Problems: How exact can you be? CoRR (2023)
Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco M. Manquinho, José Rui Figueira
Exact and approximate determination of the Pareto front using Minimal Correction Subsets. Comput. Oper. Res. 153 (2023)
Cristina Bazgan, Katrin Casel, Pierre Cazals
Dense Graph Partitioning on Sparse and Dense Graphs. SWAT (2022)
Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. Theory Comput. Syst. 66 (1) (2022)
Cristina Bazgan, Paul Beaujean, Éric Gourdin
An approximation algorithm for the maximum spectral subgraph problem. J. Comb. Optim. 44 (3) (2022)
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
An approximation algorithm for a general class of parametric optimization problems. J. Comb. Optim. 43 (5) (2022)
Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco M. Manquinho, José Rui Figueira
Exact and approximate determination of the Pareto set using minimal correction subsets. CoRR (2022)
Cristina Bazgan, Katrin Casel, Pierre Cazals
Dense Graph Partitioning on sparse and dense graphs. CoRR (2021)
Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
One-exact approximate Pareto sets. J. Glob. Optim. 80 (1) (2021)
Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, Pierre-Henri Wuillemin
Monte Carlo Search Algorithms for Network Traffic Engineering. ECML/PKDD (4) (2021)
Cristina Bazgan, Pierre Cazals, Janka Chlebíková
Degree-anonymization using edge rotations. Theor. Comput. Sci. 873 (2021)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. Discret. Appl. Math. 280 (2020)
Cristina Bazgan, Janka Chlebíková, Clément Dallard
Graphs without a partition into two proportionally dense subgraphs. Inf. Process. Lett. 155 (2020)
Cristina Bazgan, Pierre Cazals, Janka Chlebíková
How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations. COCOA (2020)
Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau
Parameterized Dynamic Variants of Red-Blue Dominating Set. SOFSEM (2020)
Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg
A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths. Networks 73 (1) (2019)
Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
One-Exact Approximate Pareto Sets. CoRR (2019)
Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau
Proportionally dense subgraph of maximum size: Complexity and approximation. Discret. Appl. Math. 270 (2019)
Cristina Bazgan, Florent Foucaud, Florian Sikora
Parameterized and approximation complexity of Partial VC Dimension. Theor. Comput. Sci. 766 (2019)
Cristina Bazgan, Henning Fernau, Zsolt Tuza
Aspects of upper defensive alliances. Discret. Appl. Math. 266 (2019)
Janka Chlebíková, Cristina Bazgan, Clément Dallard, Thomas Pontoizeau
Proportionally dense subgraph of maximum size: complexity and approximation. CoRR (2019)
Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. CoRR (2019)
Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza
Finding a potential community in networks. Theor. Comput. Sci. 769 (2019)
Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
An FPTAS for a General Class of Parametric Optimization Problems. COCOON (2019)
Cristina Bazgan, Paul Beaujean, Éric Gourdin
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem. COCOA (2018)
Cristina Bazgan, Janka Chlebíková, Clément Dallard
Graphs without a partition into two proportionally dense subgraphs. CoRR (2018)
Cristina Bazgan, Janka Chlebíková, Thomas Pontoizeau
Structural and Algorithmic Properties of 2-Community Structures. Algorithmica 80 (6) (2018)
Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica 80 (9) (2018)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
The many facets of upper domination. Theor. Comput. Sci. 717 (2018)
Cristina Bazgan, Till Fluschnik, André Nichterlein, Rolf Niedermeier, Maximilian Stahlberg
A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CoRR (2018)
Cristina Bazgan, Florian Jamain, Daniel Vanderpooten
Discrete representation of the non-dominated set for multi-objective optimization problems using kernels. Eur. J. Oper. Res. 260 (3) (2017)
Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza
On the Complexity of Finding a Potential Community. CIAC (2017)
Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau
Building Clusters with Lower-Bounded Sizes. ISAAC (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Upper Domination: Complexity and Approximation. IWOCA (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM (2016)
Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
Data reductions and combinatorial bounds for improved approximation algorithms. J. Comput. Syst. Sci. 82 (3) (2016)
Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622 (2016)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau
On the Complexity Landscape of the Domination Chain. CALDAM (2016)
Cristina Bazgan, Florent Foucaud, Florian Sikora
On the Approximability of Partial VC Dimension. CoRR (2016)
Cristina Bazgan, Florent Foucaud, Florian Sikora
On the Approximability of Partial VC Dimension. COCOA (2016)
Cristina Bazgan, André Nichterlein, Rolf Niedermeier
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CIAC (2015)
Cristina Bazgan, Janka Chlebíková, Thomas Pontoizeau
New Insight into 2-Community Structures in Graphs with Applications in Social Networks. COCOA (2015)
Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora
On the Complexity of QoS-Aware Service Selection Problem. ICSOC (2015)
Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries
Blockers for the Stability Number and the Chromatic Number. Graphs Comb. 31 (1) (2015)
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
Algorithmic Aspects of Upper Domination. CoRR (2015)
Cristina Bazgan, Florian Jamain, Daniel Vanderpooten
Approximate Pareto sets of minimal size for multi-objective optimization problems. Oper. Res. Lett. 43 (1) (2015)
Cristina Bazgan, André Nichterlein
Parameterized Inapproximability of Degree Anonymization. IPEC (2014)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms 27 (2014)
Cristina Bazgan, Morgan Chopin
The complexity of finding harmless individuals in social networks. Discret. Optim. 14 (2014)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Inapproximability of Target Set Selection and Generalizations. CiE (2014)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Inapproximability of Target Set Selection and Generalizations. CoRR (2014)
Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms. CoRR (2014)
Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza
Complexity and approximation for Traveling Salesman Problems with profits. Theor. Comput. Sci. 531 (2014)
Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
Approximation Algorithms Inspired by Kernelization Methods. ISAAC (2014)
Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen
Parameterized complexity of firefighting. J. Comput. Syst. Sci. 80 (7) (2014)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Inapproximability of Target Set Selection and Generalizations. Comput. 3 (2) (2014)
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
Single approximation for the biobjective Max TSP. Theor. Comput. Sci. 478 (2013)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Complexity of determining the most vital elements for the p-median and p-center location problems. J. Comb. Optim. 25 (2) (2013)
Cristina Bazgan, Florian Jamain, Daniel Vanderpooten
On the number of non-dominated points of a multicriteria optimization problem. Discret. Appl. Math. 161 (18) (2013)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. J. Comb. Optim. 26 (1) (2013)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Approximability of Maximizing the Spread of Influence in Networks CoRR (2013)
Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora
Parameterized Approximability of Maximizing the Spread of Influence in Networks. COCOON (2013)
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
Approximation with a fixed number of solutions of some multiobjective maximization problems. J. Discrete Algorithms 22 (2013)
Cristina Bazgan, Morgan Chopin, Bernard Ries
The firefighter problem with more than one firefighter on trees. Discret. Appl. Math. 161 (7-8) (2013)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Critical edges for the assignment problem: Complexity and exact resolution. Oper. Res. Lett. 41 (6) (2013)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Efficient determination of the k most vital edges for the minimum spanning tree problem. Comput. Oper. Res. 39 (11) (2012)
Cristina Bazgan, Morgan Chopin
The Robust Set Problem: Parameterized Complexity and Approximation. MFCS (2012)
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA (2011)
Cristina Bazgan, Morgan Chopin, Bernard Ries
The firefighter problem with more than one firefighter on trees CoRR (2011)
Cristina Bazgan, Basile Couëtoux, Zsolt Tuza
Complexity and approximation of the Constrained Forest problem. Theor. Comput. Sci. 412 (32) (2011)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Most Vital Edges for the Minimum Spanning Tree Problem. COCOA (2011)
Cristina Bazgan, Morgan Chopin, Michael R. Fellows
Parameterized Complexity of the Firefighter Problem. ISAAC (2011)
Cristina Bazgan, Sonia Toubaline, Zsolt Tuza
The most vital nodes with respect to independent set and vertex cover. Discret. Appl. Math. 159 (17) (2011)
Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
Single Approximation for Biobjective Max TSP. WAOA (2011)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discret. Optim. 7 (3) (2010)
Cristina Bazgan, Sonia Toubaline, Zsolt Tuza
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. IWOCA (2010)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Satisfactory graph partition, variants, and generalizations. Eur. J. Oper. Res. 206 (2) (2010)
Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten
Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. COCOA (1) (2010)
Cristina Bazgan, Basile Couëtoux, Zsolt Tuza
Covering a Graph with a Constrained Forest (Extended Abstract). ISAAC (2009)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Min-max and min-max regret versions of combinatorial optimization problems: A survey. Eur. J. Oper. Res. 197 (2) (2009)
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
Solving efficiently the 0-1 multi-objective knapsack problem. Comput. Oper. Res. 36 (1) (2009)
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. Eur. J. Oper. Res. 198 (1) (2009)
Cristina Bazgan, Zsolt Tuza
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. J. Discrete Algorithms 6 (3) (2008)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Approximation of satisfactory bisection problems. J. Comput. Syst. Sci. 74 (5) (2008)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the min-max (regret) versions of min cut problems. Discret. Optim. 5 (1) (2008)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Efficient algorithms for decomposing graphs under degree constraints. Discret. Appl. Math. 155 (8) (2007)
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. ESA (2007)
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. WEA (2007)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Approximation of min-max and min-max regret versions of some combinatorial optimization problems. Eur. J. Oper. Res. 179 (2) (2007)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
The satisfactory partition problem. Discret. Appl. Math. 154 (8) (2006)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. COCOON (2006)
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Degree-constrained decompositions of graphs: Bounded treewidth and planarity. Theor. Comput. Sci. 355 (3) (2006)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ESA (2005)
Cristina Bazgan, Marek Karpinski
On the Complexity of Global Constraint Satisfaction. ISAAC (2005)
Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
Complexity of the Min-Max (Regret) Versions of Cut Problems. ISAAC (2005)
Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière
Greedy Differential Approximations for Min Set Cover. SOFSEM (2005)

Cristina Bazgan.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Cristina Bazgan