default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCristina Bazgan
Person information
- affiliation: Université Paris Dauphine, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j64]Cristina Bazgan, Henning Fernau:
Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022. Algorithmica 86(3): 695-696 (2024)- [j63]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen
, Daniel Vanderpooten:
Approximating multiobjective optimization problems: How exact can you be? Math. Methods Oper. Res. 100(1): 5-25 (2024) - 2023
- [j62]Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco Manquinho, José Rui Figueira:
Exact and approximate determination of the Pareto front using Minimal Correction Subsets. Comput. Oper. Res. 153: 106153 (2023) - 2022
- [j61]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): 1328-1358 (2022) - [j60]Cristina Bazgan, Paul Beaujean, Éric Gourdin:
An approximation algorithm for the maximum spectral subgraph problem. J. Comb. Optim. 44(3): 1880-1899 (2022) - [j59]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): 395-415 (2022) - 2021
- [j58]Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
One-exact approximate Pareto sets. J. Glob. Optim. 80(1): 87-115 (2021) - [j57]Cristina Bazgan, Pierre Cazals, Janka Chlebíková:
Degree-anonymization using edge rotations. Theor. Comput. Sci. 873: 1-15 (2021) - 2020
- [j56]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau:
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. Discret. Appl. Math. 280: 23-42 (2020) - [j55]Cristina Bazgan, Janka Chlebíková, Clément Dallard:
Graphs without a partition into two proportionally dense subgraphs. Inf. Process. Lett. 155 (2020) - 2019
- [j54]Cristina Bazgan, Henning Fernau, Zsolt Tuza:
Aspects of upper defensive alliances. Discret. Appl. Math. 266: 111-120 (2019) - [j53]Cristina Bazgan, Janka Chlebíková, Clément Dallard, Thomas Pontoizeau:
Proportionally dense subgraph of maximum size: Complexity and approximation. Discret. Appl. Math. 270: 25-36 (2019) - [j52]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): 23-37 (2019) - [j51]Cristina Bazgan, Florent Foucaud, Florian Sikora:
Parameterized and approximation complexity of Partial VC Dimension. Theor. Comput. Sci. 766: 1-15 (2019) - [j50]Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza:
Finding a potential community in networks. Theor. Comput. Sci. 769: 32-42 (2019) - 2018
- [j49]Cristina Bazgan, Janka Chlebíková, Thomas Pontoizeau:
Structural and Algorithmic Properties of 2-Community Structures. Algorithmica 80(6): 1890-1908 (2018) - [j48]Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau:
Clustering with Lower-Bounded Sizes - A General Graph-Theoretic Framework. Algorithmica 80(9): 2517-2550 (2018) - [j47]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: 2-25 (2018) - 2017
- [j46]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): 814-827 (2017) - 2016
- [j45]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): 503-520 (2016) - [j44]Cristina Bazgan, Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger:
Finding large degree-anonymous subgraphs is hard. Theor. Comput. Sci. 622: 90-110 (2016) - 2015
- [j43]Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries:
Blockers for the Stability Number and the Chromatic Number. Graphs Comb. 31(1): 73-90 (2015) - [j42]Cristina Bazgan, Florian Jamain, Daniel Vanderpooten:
Approximate Pareto sets of minimal size for multi-objective optimization problems. Oper. Res. Lett. 43(1): 1-6 (2015) - 2014
- [j41]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. Comput. 3(2): 135-145 (2014) - [j40]Cristina Bazgan, Morgan Chopin:
The complexity of finding harmless individuals in social networks. Discret. Optim. 14: 170-182 (2014) - [j39]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): 1285-1297 (2014) - [j38]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms 27: 54-65 (2014) - [j37]Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza:
Complexity and approximation for Traveling Salesman Problems with profits. Theor. Comput. Sci. 531: 54-65 (2014) - 2013
- [j36]Cristina Bazgan, Morgan Chopin, Bernard Ries:
The firefighter problem with more than one firefighter on trees. Discret. Appl. Math. 161(7-8): 899-908 (2013) - [j35]Cristina Bazgan, Florian Jamain, Daniel Vanderpooten:
On the number of non-dominated points of a multicriteria optimization problem. Discret. Appl. Math. 161(18): 2841-2850 (2013) - [j34]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): 191-207 (2013) - [j33]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. J. Comb. Optim. 26(1): 178-189 (2013) - [j32]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: 19-29 (2013) - [j31]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Critical edges for the assignment problem: Complexity and exact resolution. Oper. Res. Lett. 41(6): 685-689 (2013) - [j30]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single approximation for the biobjective Max TSP. Theor. Comput. Sci. 478: 41-50 (2013) - 2012
- [j29]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): 2888-2898 (2012) - 2011
- [j28]Cristina Bazgan, Sonia Toubaline, Zsolt Tuza:
The most vital nodes with respect to independent set and vertex cover. Discret. Appl. Math. 159(17): 1933-1946 (2011) - [j27]Cristina Bazgan, Basile Couëtoux, Zsolt Tuza:
Complexity and approximation of the Constrained Forest problem. Theor. Comput. Sci. 412(32): 4081-4091 (2011) - 2010
- [j26]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discret. Optim. 7(3): 136-148 (2010) - [j25]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Satisfactory graph partition, variants, and generalizations. Eur. J. Oper. Res. 206(2): 271-280 (2010) - 2009
- [j24]Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
Solving efficiently the 0-1 multi-objective knapsack problem. Comput. Oper. Res. 36(1): 260-279 (2009) - [j23]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): 427-438 (2009) - [j22]Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
Implementing an efficient fptas for the 0-1 multi-objective knapsack problem. Eur. J. Oper. Res. 198(1): 47-56 (2009) - 2008
- [j21]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the min-max (regret) versions of min cut problems. Discret. Optim. 5(1): 66-73 (2008) - [j20]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Approximation of satisfactory bisection problems. J. Comput. Syst. Sci. 74(5): 875-883 (2008) - [j19]Cristina Bazgan, Zsolt Tuza:
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3. J. Discrete Algorithms 6(3): 510-519 (2008) - 2007
- [j18]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Efficient algorithms for decomposing graphs under degree constraints. Discret. Appl. Math. 155(8): 979-988 (2007) - [j17]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): 281-290 (2007) - 2006
- [j16]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
The satisfactory partition problem. Discret. Appl. Math. 154(8): 1236-1245 (2006) - [j15]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Degree-constrained decompositions of graphs: Bounded treewidth and planarity. Theor. Comput. Sci. 355(3): 389-395 (2006) - 2005
- [j14]Cristina Bazgan, Refael Hassin, Jérôme Monnot:
Approximation algorithms for some vehicle routing problems. Discret. Appl. Math. 146(1): 27-42 (2005) - [j13]Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16(6): 1267-1295 (2005) - [j12]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33(6): 634-640 (2005) - [j11]Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière:
On the differential approximation of MIN SET COVER. Theor. Comput. Sci. 332(1-3): 497-513 (2005) - [j10]Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos:
Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Theor. Comput. Sci. 339(2-3): 272-292 (2005) - 2004
- [j9]Cristina Bazgan:
A note on the approximability of the toughness of graphs. Discret. Math. 280(1-3): 215-218 (2004) - 2003
- [j8]Cristina Bazgan, Vangelis Th. Paschos:
Differential approximation for optimal satisfiability and related problems. Eur. J. Oper. Res. 147(2): 397-404 (2003) - [j7]Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski:
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction. Random Struct. Algorithms 23(1): 73-91 (2003) - 2002
- [j6]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem. J. Comput. Syst. Sci. 64(2): 160-170 (2002) - 2001
- [j5]Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree. Discret. Math. 236(1-3): 37-42 (2001) - [j4]Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
Partitioning vertices of 1-tough graphs into paths. Theor. Comput. Sci. 263(1-2): 255-261 (2001) - 2000
- [j3]Cristina Bazgan, Hao Li, Mariusz Wozniak:
On the Loebl-Komlós-Sós conjecture. J. Graph Theory 34(4): 269-276 (2000) - 1999
- [j2]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs. J. Algorithms 31(1): 249-268 (1999) - [j1]Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak:
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs. J. Comb. Theory B 75(2): 288-301 (1999)
Conference and Workshop Papers
- 2024
- [c46]Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez:
Destroying Densest Subgraphs Is Hard. SWAT 2024: 6:1-6:17 - 2023
- [c45]Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, Pierre-Henri Wuillemin:
Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping. AAAI 2023: 12381-12389 - 2022
- [c44]Cristina Bazgan, Katrin Casel, Pierre Cazals:
Dense Graph Partitioning on Sparse and Dense Graphs. SWAT 2022: 13:1-13:15 - 2021
- [c43]Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, Pierre-Henri Wuillemin:
Monte Carlo Search Algorithms for Network Traffic Engineering. ECML/PKDD (4) 2021: 486-501 - 2020
- [c42]Cristina Bazgan, Pierre Cazals, Janka Chlebíková:
How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations. COCOA 2020: 242-256 - [c41]Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau:
Parameterized Dynamic Variants of Red-Blue Dominating Set. SOFSEM 2020: 236-247 - 2019
- [c40]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
An FPTAS for a General Class of Parametric Optimization Problems. COCOON 2019: 25-37 - 2018
- [c39]Cristina Bazgan, Paul Beaujean, Éric Gourdin:
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem. COCOA 2018: 108-122 - 2017
- [c38]Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza:
On the Complexity of Finding a Potential Community. CIAC 2017: 80-91 - 2016
- [c37]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: 113-124 - [c36]Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau:
On the Complexity Landscape of the Domination Chain. CALDAM 2016: 61-72 - [c35]Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. COCOA 2016: 92-106 - [c34]Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau:
Building Clusters with Lower-Bounded Sizes. ISAAC 2016: 4:1-4:13 - [c33]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: 241-252 - 2015
- [c32]Cristina Bazgan, André Nichterlein, Rolf Niedermeier:
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. CIAC 2015: 47-60 - [c31]Cristina Bazgan, Janka Chlebíková, Thomas Pontoizeau:
New Insight into 2-Community Structures in Graphs with Applications in Social Networks. COCOA 2015: 236-250 - [c30]Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora:
On the Complexity of QoS-Aware Service Selection Problem. ICSOC 2015: 345-352 - 2014
- [c29]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. CiE 2014: 11-20 - [c28]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Approximation Algorithms Inspired by Kernelization Methods. ISAAC 2014: 479-490 - [c27]Cristina Bazgan, André Nichterlein:
Parameterized Inapproximability of Degree Anonymization. IPEC 2014: 75-84 - 2013
- [c26]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Approximability of Maximizing the Spread of Influence in Networks. COCOON 2013: 543-554 - 2012
- [c25]Cristina Bazgan, Morgan Chopin:
The Robust Set Problem: Parameterized Complexity and Approximation. MFCS 2012: 136-147 - 2011
- [c24]Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Efficient Algorithms for Finding the k Most Vital Edges for the Minimum Spanning Tree Problem. COCOA 2011: 126-140 - [c23]Cristina Bazgan, Morgan Chopin, Michael R. Fellows:
Parameterized Complexity of the Firefighter Problem. ISAAC 2011: 643-652 - [c22]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual:
Single Approximation for Biobjective Max TSP. WAOA 2011: 49-62 - [c21]Cristina Bazgan, Laurent Gourvès, Jérôme Monnot:
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. WAOA 2011: 233-246 - 2010
- [c20]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: 237-251 - [c19]Cristina Bazgan, Sonia Toubaline, Zsolt Tuza:
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. IWOCA 2010: 154-166 - 2009
- [c18]Cristina Bazgan, Basile Couëtoux, Zsolt Tuza:
Covering a Graph with a Constrained Forest (Extended Abstract). ISAAC 2009: 892-901 - 2007
- [c17]Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. ESA 2007: 717-728 - [c16]Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem. WEA 2007: 406-419 - 2006
- [c15]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. COCOON 2006: 428-438 - 2005
- [c14]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
Complexity and Approximation of Satisfactory Partition Problems. COCOON 2005: 829-838 - [c13]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ESA 2005: 862-873 - [c12]Cristina Bazgan, Marek Karpinski:
On the Complexity of Global Constraint Satisfaction. ISAAC 2005: 624-633 - [c11]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the Min-Max (Regret) Versions of Cut Problems. ISAAC 2005: 789-798 - [c10]Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière:
Greedy Differential Approximations for Min Set Cover. SOFSEM 2005: 62-71 - 2004
- [c9]Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos:
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. ISAAC 2004: 124-136 - 2003
- [c8]Cristina Bazgan, Refael Hassin, Jérôme Monnot:
Differential Approximation for Some Routing Problems. CIAC 2003: 277-288 - [c7]Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten:
On the Existence and Determination of Satisfactory Partitions in a Graph. ISAAC 2003: 444-453 - [c6]Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in Differential Approximation Classes. MFCS 2003: 179-188 - 2002
- [c5]Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski:
Approximability of Dense Instances of NEAREST CODEWORD Problem. SWAT 2002: 298-307 - 1999
- [c4]Cristina Bazgan, Wenceslas Fernandez de la Vega:
A Polynomial Time Approximation Scheme for Dense MIN 2SAT. FCT 1999: 91-99 - 1998
- [c3]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
Efficient Approximation Algorithms for the Subset-Sums Equality Problem. ICALP 1998: 387-396 - [c2]Cristina Bazgan, Miklos Santha, Zsolt Tuza:
On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). STACS 1998: 276-286 - 1995
- [c1]Cristina Bazgan, Henri Luchian:
A Genetic Algorithm for the Maximal Clique Problem. ICANNGA 1995: 499-502
Editorship
- 2022
- [e1]Cristina Bazgan, Henning Fernau:
Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7-9, 2022, Proceedings. Lecture Notes in Computer Science 13270, Springer 2022, ISBN 978-3-031-06677-1 [contents]
Informal and Other Publications
- 2024
- [i17]Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez:
Destroying Densest Subgraphs is Hard. CoRR abs/2404.08599 (2024) - 2023
- [i16]Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
Approximating Multiobjective Optimization Problems: How exact can you be? CoRR abs/2305.15142 (2023) - 2022
- [i15]Andreia P. Guerreiro, João Cortes, Daniel Vanderpooten, Cristina Bazgan, Inês Lynce, Vasco Manquinho, José Rui Figueira:
Exact and approximate determination of the Pareto set using minimal correction subsets. CoRR abs/2204.06908 (2022) - 2021
- [i14]Cristina Bazgan, Katrin Casel, Pierre Cazals:
Dense Graph Partitioning on sparse and dense graphs. CoRR abs/2107.13282 (2021) - 2019
- [i13]Janka Chlebíková, Cristina Bazgan, Clément Dallard, Thomas Pontoizeau:
Proportionally dense subgraph of maximum size: complexity and approximation. CoRR abs/1903.06579 (2019) - [i12]Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems. CoRR abs/1908.01181 (2019) - [i11]Arne Herzel, Cristina Bazgan, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten:
One-Exact Approximate Pareto Sets. CoRR abs/1908.10561 (2019) - 2018
- [i10]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 abs/1804.09155 (2018) - [i9]Cristina Bazgan, Janka Chlebíková, Clément Dallard:
Graphs without a partition into two proportionally dense subgraphs. CoRR abs/1806.10963 (2018) - 2016
- [i8]Cristina Bazgan, Florent Foucaud, Florian Sikora:
On the Approximability of Partial VC Dimension. CoRR abs/1609.05110 (2016) - 2015
- [i7]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 abs/1506.07260 (2015) - 2014
- [i6]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. CoRR abs/1403.3565 (2014) - [i5]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms. CoRR abs/1409.3742 (2014) - 2013
- [i4]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Approximability of Maximizing the Spread of Influence in Networks. CoRR abs/1303.6907 (2013) - 2011
- [i3]Cristina Bazgan, Morgan Chopin, Bernard Ries:
The firefighter problem with more than one firefighter on trees. CoRR abs/1110.0341 (2011) - 2001
- [i2]Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski:
Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [i1]Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski:
Approximability of Dense Instances of NEAREST CODEWORD Problem. Electron. Colloquium Comput. Complex. TR00 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
