Morgan Chopin
Morgan Chopin
Researcher, Orange
Bestätigte E-Mail-Adresse bei
Zitiert von
Zitiert von
Constant thresholds can make target set selection tractable
M Chopin, A Nichterlein, R Niedermeier, M Weller
Theory of Computing Systems 55, 61-83, 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
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
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
Parameterized inapproximability of target set selection and generalizations
C Bazgan, M Chopin, A Nichterlein, F Sikora
Computability 3 (2), 135-145, 2014
Parameterized complexity of the firefighter problem
C Bazgan, M Chopin, MR Fellows
Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 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
The firefighter problem: Further steps in understanding its complexity
J Chlebíková, M Chopin
Theoretical Computer Science 676, 42-51, 2017
The firefighter problem: A structural analysis
J Chlebíková, M Chopin
International Symposium on Parameterized and Exact Computation, 172-183, 2014
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
The complexity of finding harmless individuals in social networks
C Bazgan, M Chopin
Discrete Optimization 14, 170-182, 2014
Parameterized complexity of DAG partitioning
R Van Bevern, R Bredereck, M Chopin, S Hartung, F Hüffner, ...
Algorithms and Complexity: 8th International Conference, CIAC 2013 …, 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
The robust set problem: Parameterized complexity and approximation
C Bazgan, M Chopin
Mathematical Foundations of Computer Science 2012: 37th International …, 2012
Structural parameterizations for boxicity
H Bruhn, M Chopin, F Joos, O Schaudt
Algorithmica 74, 1453-1472, 2016
Approximation algorithms inspired by kernelization methods
FN Abu-Khzam, C Bazgan, M Chopin, H Fernau
Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju …, 2014
Optimization problems with propagation in graphs: Parameterized complexity and approximation
M Chopin
Université Paris Dauphine-Paris IX, 2013
Warm-starting nested rollout policy adaptation with optimal stopping
C Dang, C Bazgan, T Cazenave, M Chopin, PH Wuillemin
Proceedings of the AAAI Conference on Artificial Intelligence 37 (10), 12381 …, 2023
Agent-based simulation for placement and pricing of 5G network slices
J Shakya, C Ghribi, M Chopin, L Merghem-Boulahia
2023 IEEE 20th Consumer Communications & Networking Conference (CCNC), 883-884, 2023
Toward scalable algorithms for the unsplittable shortest path routing problem
A Benhamiche, M Chopin
arXiv preprint arXiv:2006.04324, 2020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20