Constant thresholds can make target set selection tractable M Chopin, A Nichterlein, R Niedermeier, M Weller Theory of Computing Systems 55 (1), 61-83, 2014 | 57 | 2014 |

Parameterized approximability of maximizing the spread of influence in networks C Bazgan, M Chopin, A Nichterlein, F Sikora Journal of Discrete Algorithms 27, 54-65, 2014 | 41 | 2014 |

The firefighter problem with more than one firefighter on trees C Bazgan, M Chopin, B Ries Discrete Applied Mathematics 161 (7-8), 899-908, 2013 | 31 | 2013 |

Parameterized complexity of firefighting C Bazgan, M Chopin, M Cygan, MR Fellows, FV Fomin, EJ Van Leeuwen Journal of Computer and System Sciences 80 (7), 1285-1297, 2014 | 24 | 2014 |

Parameterized inapproximability of target set selection and generalizations C Bazgan, M Chopin, A Nichterlein, F Sikora Computability 3 (2), 135-145, 2014 | 17 | 2014 |

Parameterized complexity of the firefighter problem C Bazgan, M Chopin, MR Fellows International Symposium on Algorithms and Computation, 643-652, 2011 | 16 | 2011 |

Data reductions and combinatorial bounds for improved approximation algorithms FN Abu-Khzam, C Bazgan, M Chopin, H Fernau Journal of Computer and System Sciences 82 (3), 503-520, 2016 | 11 | 2016 |

The firefighter problem: Further steps in understanding its complexity J Chlebíková, M Chopin Theoretical Computer Science 676, 42-51, 2017 | 10 | 2017 |

The firefighter problem: A structural analysis J Chlebíková, M Chopin International Symposium on Parameterized and Exact Computation, 172-183, 2014 | 7 | 2014 |

Parameterized complexity of DAG partitioning R Van Bevern, R Bredereck, M Chopin, S Hartung, F Hüffner, ... International Conference on Algorithms and Complexity, 49-60, 2013 | 7 | 2013 |

Fixed-parameter algorithms for DAG partitioning R van Bevern, R Bredereck, M Chopin, S Hartung, F Hüffner, A Nichterlein, ... Discrete Applied Mathematics 220, 134-160, 2017 | 6 | 2017 |

Optimization problems with propagation in graphs: Parameterized complexity and approximation M Chopin Université Paris Dauphine-Paris IX, 2013 | 5 | 2013 |

The robust set problem: Parameterized complexity and approximation C Bazgan, M Chopin International Symposium on Mathematical Foundations of Computer Science, 136-147, 2012 | 5 | 2012 |

Structural parameterizations for boxicity H Bruhn, M Chopin, F Joos, O Schaudt Algorithmica 74 (4), 1453-1472, 2016 | 4 | 2016 |

Approximation algorithms inspired by kernelization methods FN Abu-Khzam, C Bazgan, M Chopin, H Fernau International Symposium on Algorithms and Computation, 479-490, 2014 | 3 | 2014 |

The complexity of finding harmless individuals in social networks C Bazgan, M Chopin Discrete Optimization 14, 170-182, 2014 | 3 | 2014 |

Optimizing the triangulation of Dynamic Bayesian Networks M Chopin, PH Wuillemin on Probabilistic Graphical Models, 73, 2010 | 2 | 2010 |

Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem A Benhamiche, M Chopin arXiv preprint arXiv:2006.04324, 2020 | 1 | 2020 |

Optimisation de l’inférence dans les Réseaux Bayésiens Dynamiques M Chopin, PH Wuillemin LIP6, université de paris, France. ROADEF, 2010 | 1 | 2010 |

Monte Carlo Search Algorithms for Network Traffic Engineering C Dang, C Bazgan, T Cazenave, M Chopin, PH Wuillemin Joint European Conference on Machine Learning and Knowledge Discovery in …, 2021 | | 2021 |