| 2026 | WALCOM | On the Computational Complexity of Covering Multi-Interface Networks. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer |
| 2025 | CIAC | On the Computational Complexity of Graph Reconstruction. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer |
| 2025 | INFOCOM | Parameterized Complexity of Segment Routing. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer |
| 2023 | AAAI | Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping. | Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, Pierre-Henri Wuillemin |
| 2020 | COCOA | How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations. | Cristina Bazgan, Pierre Cazals, Janka Chlebkov |
| 2020 | SOFSEM | Parameterized Dynamic Variants of Red-Blue Dominating Set. | Faisal N. Abu-Khzam, Cristina Bazgan, Henning Fernau |
| 2019 | COCOON | An FPTAS for a General Class of Parametric Optimization Problems. | Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten |
| 2018 | COCOA | Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem. | Cristina Bazgan, Paul Beaujean, ric Gourdin |
| 2017 | CIAC | On the Complexity of Finding a Potential Community. | Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza |
| 2016 | AAIM | Algorithmic Aspects of Upper Domination: A Parameterised Perspective. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | COCOA | On the Approximability of Partial VC Dimension. | Cristina Bazgan, Florent Foucaud, Florian Sikora |
| 2016 | ISAAC | Building Clusters with Lower-Bounded Sizes. | Faisal N. Abu-Khzam, Cristina Bazgan, Katrin Casel, Henning Fernau |
| 2016 | IWOCA | Upper Domination: Complexity and Approximation. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2015 | CIAC | A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths. | Cristina Bazgan, Andr Nichterlein, Rolf Niedermeier |
| 2015 | COCOA | New Insight into 2-Community Structures in Graphs with Applications in Social Networks. | Cristina Bazgan, Janka Chlebkov, Thomas Pontoizeau |
| 2015 | ICSOC | On the Complexity of QoS-Aware Service Selection Problem. | Faisal N. Abu-Khzam, Cristina Bazgan, Joyce El Haddad, Florian Sikora |
| 2014 | CiE | Parameterized Inapproximability of Target Set Selection and Generalizations. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Florian Sikora |
| 2014 | ISAAC | Approximation Algorithms Inspired by Kernelization Methods. | Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau |
| 2013 | COCOON | Parameterized Approximability of Maximizing the Spread of Influence in Networks. | Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Florian Sikora |
| 2012 | MFCS | The Robust Set Problem: Parameterized Complexity and Approximation. | Cristina Bazgan, Morgan Chopin |
| 2011 | COCOA | Efficient Algorithms for Finding the | Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten |
| 2011 | ISAAC | Parameterized Complexity of the Firefighter Problem. | Cristina Bazgan, Morgan Chopin, Michael R. Fellows |
| 2011 | WAOA | Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems. | Cristina Bazgan, Laurent Gourvs, Jrme Monnot |
| 2011 | WAOA | Single Approximation for Biobjective Max TSP. | Cristina Bazgan, Laurent Gourvs, Jrme Monnot, Fanny Pascual |
| 2010 | COCOA | Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems. | Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten |
| 2010 | IWOCA | Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures. | Cristina Bazgan, Sonia Toubaline, Zsolt Tuza |
| 2009 | ISAAC | Covering a Graph with a Constrained Forest (Extended Abstract). | Cristina Bazgan, Basile Coutoux, Zsolt Tuza |
| 2007 | ESA | A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. | Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten |
| 2006 | COCOON | Approximating Min-Max (Regret) Versions of Some Polynomial Problems. | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
| 2005 | COCOON | Complexity and Approximation of Satisfactory Partition Problems. | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
| 2005 | ESA | Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
| 2005 | ISAAC | Complexity of the Min-Max (Regret) Versions of Cut Problems. | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
| 2005 | ISAAC | On the Complexity of Global Constraint Satisfaction. | Cristina Bazgan, Marek Karpinski |
| 2005 | SOFSEM | Greedy Differential Approximations for Min Set Cover. | Cristina Bazgan, Jrme Monnot, Vangelis Th. Paschos, Fabrice Serrire |
| 2004 | ISAAC | Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
| 2003 | CIAC | Differential Approximation for Some Routing Problems. | Cristina Bazgan, Refael Hassin, Jrme Monnot |
| 2003 | ISAAC | On the Existence and Determination of Satisfactory Partitions in a Graph. | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten |
| 2003 | MFCS | Completeness in Differential Approximation Classes. | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
| 1999 | FCT | A Polynomial Time Approximation Scheme for Dense MIN 2SAT. | Cristina Bazgan, Wenceslas Fernandez de la Vega |
| 1998 | ICALP | Efficient Approximation Algorithms for the Subset-Sums Equality Problem. | Cristina Bazgan, Miklos Santha, Zsolt Tuza |
| 1998 | STACS | On the Approximation of Finding A(nother) Hamilton Cycle in Cubic Hamilton Graphs (Extended Abstract). | Cristina Bazgan, Miklos Santha, Zsolt Tuza |