Parameterized Complexity of the Firefighter Problem. - Cristina Bazgan; Morgan Chopin; Michael R. Fellows (ISAAC, 2011)

The Robust Set Problem: Parameterized Complexity and Approximation. - Cristina Bazgan; Morgan Chopin (MFCS, 2012)

Parameterized Complexity of DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (CIAC, 2013)

The firefighter problem with more than one firefighter on trees. - Cristina Bazgan; Morgan Chopin; Bernard Ries (Discret. Appl. Math., 2013)

The Firefighter Problem: A Structural Analysis. - Janka Chlebíková; Morgan Chopin (Electron. Colloquium Comput. Complex., 2013)

Optimization problems with propagation in graphs : Parameterized complexity and approximation. (Problèmes d'optimisation avec propagation dans les graphes : complexité paramétrée et approximation). - Morgan Chopin (2013)

Approximation Algorithms Inspired by Kernelization Methods. - Faisal N. Abu-Khzam; Cristina Bazgan; Morgan Chopin; Henning Fernau (ISAAC, 2014)

Parameterized Inapproximability of Target Set Selection and Generalizations. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Florian Sikora (Comput., 2014)

The complexity of finding harmless individuals in social networks. - Cristina Bazgan; Morgan Chopin (Discret. Optim., 2014)

Parameterized complexity of firefighting. - Cristina Bazgan; Morgan Chopin; Marek Cygan; Michael R. Fellows; Fedor V. Fomin; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2014)

Parameterized approximability of maximizing the spread of influence in networks. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Florian Sikora (J. Discrete Algorithms, 2014)

Constant Thresholds Can Make Target Set Selection Tractable. - Morgan Chopin; André Nichterlein; Rolf Niedermeier; Mathias Weller (Theory Comput. Syst., 2014)

Structural Parameterizations for Boxicity. - Henning Bruhn; Morgan Chopin; Felix Joos; Oliver Schaudt (Algorithmica, 2016)

Data reductions and combinatorial bounds for improved approximation algorithms. - Faisal N. Abu-Khzam; Cristina Bazgan; Morgan Chopin; Henning Fernau (J. Comput. Syst. Sci., 2016)

Fixed-parameter algorithms for DAG Partitioning. - René van Bevern; Robert Bredereck; Morgan Chopin; Sepp Hartung; Falk Hüffner; André Nichterlein; Ondrej Suchý 001 (Discret. Appl. Math., 2017)

The firefighter problem: Further steps in understanding its complexity. - Janka Chlebíková; Morgan Chopin (Theor. Comput. Sci., 2017)

Liability-Aware Security Management for 5G. - Chrystel Gaber; José Manuel Sánchez-Vílchez; Gürkan Gür; Morgan Chopin; Nancy Perrot; Jean-Luc Grimault; Jean-Philippe Wary (5G World Forum, 2020)

Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem. - Amal Benhamiche; Morgan Chopin (CoRR, 2020)

Monte Carlo Search Algorithms for Network Traffic Engineering. - Chen Dang; Cristina Bazgan; Tristan Cazenave; Morgan Chopin; Pierre-Henri Wuillemin (ECML/PKDD (4), 2021)

Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping. - Chen Dang; Cristina Bazgan; Tristan Cazenave; Morgan Chopin; Pierre-Henri Wuillemin (AAAI, 2023)

Agent-based Simulation for Placement and Pricing of 5G Network Slices. - Joshua Shakya; Chaima Ghribi; Morgan Chopin; Leïla Merghem-Boulahia (CCNC, 2023)

Unsplittable Shortest Path Routing: Extended Model and Matheuristic. - Amal Benhamiche; Morgan Chopin; Sébastien Martin (CoDIT, 2023)

A Multi-Agent Based Dynamic Network Slice Tarification Framework. - Joshua Shakya; Morgan Chopin; Leïla Merghem-Boulahia (PAAMS, 2023)

Dynamic Coalition Formation among IoT Service Providers: A Systematic Exploration of IoT Dynamics Using an Agent-Based Model. - Joshua Shakya; Morgan Chopin; Leïla Merghem-Boulahia (Sensors, 2024)

On the Computational Complexity of Graph Reconstruction. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Camille Richer (CIAC (1), 2025)

Parameterized Complexity of Segment Routing. - Cristina Bazgan; Morgan Chopin; André Nichterlein; Camille Richer (INFOCOM, 2025)

MultiAgentNetSim: Empowering Next-Generation Network Modeling with Multi-Agent Simulation. - Joshua Shakya; Morgan Chopin; Leïla Merghem-Boulahia (IEEE Commun. Mag., 2025)