Morgan Chopin

Orcid: 0000-0002-9668-1300

Affiliations:
  • Pierre and Marie Curie University, Paris, France
  • University of Ulm, Germany
  • Paris Dauphine University, France


According to our database1, Morgan Chopin authored at least 23 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Multi-Agent Based Dynamic Network Slice Tarification Framework.
Proceedings of the Advances in Practical Applications of Agents, Multi-Agent Systems, and Cognitive Mimetics. The PAAMS Collection, 2023

Unsplittable Shortest Path Routing: Extended Model and Matheuristic.
Proceedings of the 9th International Conference on Control, 2023

Agent-based Simulation for Placement and Pricing of 5G Network Slices.
Proceedings of the 20th IEEE Consumer Communications & Networking Conference, 2023

Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2021
Monte Carlo Search Algorithms for Network Traffic Engineering.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Applied Data Science Track, 2021

2020
Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem.
CoRR, 2020

Liability-Aware Security Management for 5G.
Proceedings of the 3rd IEEE 5G World Forum, 2020

2017
The firefighter problem: Further steps in understanding its complexity.
Theor. Comput. Sci., 2017

Fixed-parameter algorithms for DAG Partitioning.
Discret. Appl. Math., 2017

2016
Data reductions and combinatorial bounds for improved approximation algorithms.
J. Comput. Syst. Sci., 2016

Structural Parameterizations for Boxicity.
Algorithmica, 2016

2014
Constant Thresholds Can Make Target Set Selection Tractable.
Theory Comput. Syst., 2014

Parameterized approximability of maximizing the spread of influence in networks.
J. Discrete Algorithms, 2014

Parameterized complexity of firefighting.
J. Comput. Syst. Sci., 2014

The complexity of finding harmless individuals in social networks.
Discret. Optim., 2014

Parameterized Inapproximability of Target Set Selection and Generalizations.
Comput., 2014

Approximation Algorithms Inspired by Kernelization Methods.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

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).
PhD thesis, 2013

The Firefighter Problem: A Structural Analysis.
Electron. Colloquium Comput. Complex., 2013

The firefighter problem with more than one firefighter on trees.
Discret. Appl. Math., 2013

Parameterized Complexity of DAG Partitioning.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
The Robust Set Problem: Parameterized Complexity and Approximation.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Parameterized Complexity of the Firefighter Problem.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011


  Loading...