default search action
Morgan Chopin
Person information
- affiliation: Pierre and Marie Curie University, Paris, France
- affiliation: University of Ulm, Germany
- affiliation: Paris Dauphine University, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Joshua Shakya
, Morgan Chopin, Leïla Merghem-Boulahia:
Dynamic Coalition Formation among IoT Service Providers: A Systematic Exploration of IoT Dynamics Using an Agent-Based Model. Sensors 24(11): 3471 (2024) - 2023
- [c15]Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, Pierre-Henri Wuillemin:
Warm-Starting Nested Rollout Policy Adaptation with Optimal Stopping. AAAI 2023: 12381-12389 - [c14]Joshua Shakya, Chaima Ghribi, Morgan Chopin, Leïla Merghem-Boulahia:
Agent-based Simulation for Placement and Pricing of 5G Network Slices. CCNC 2023: 883-884 - [c13]Amal Benhamiche, Morgan Chopin, Sébastien Martin
Unsplittable Shortest Path Routing: Extended Model and Matheuristic. CoDIT 2023: 926-931 - [c12]Joshua Shakya
A Multi-Agent Based Dynamic Network Slice Tarification Framework. PAAMS 2023: 333-345 - 2021
- [c11]Chen Dang
Monte Carlo Search Algorithms for Network Traffic Engineering. ECML/PKDD (4) 2021: 486-501 - 2020
- [c10]Chrystel Gaber, José Manuel Sánchez-Vílchez, Gürkan Gür
Liability-Aware Security Management for 5G. 5G World Forum 2020: 133-138 - [i8]Amal Benhamiche, Morgan Chopin:
Toward Scalable Algorithms for the Unsplittable Shortest Path Routing Problem. CoRR abs/2006.04324 (2020)
2010 – 2019
- 2017
- [j10]René van Bevern
Fixed-parameter algorithms for DAG Partitioning. Discret. Appl. Math. 220: 134-160 (2017) - [j9]Janka Chlebíková
The firefighter problem: Further steps in understanding its complexity. Theor. Comput. Sci. 676: 42-51 (2017) - 2016
- [j8]Henning Bruhn, Morgan Chopin
Structural Parameterizations for Boxicity. Algorithmica 74(4): 1453-1472 (2016) - [j7]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin
Data reductions and combinatorial bounds for improved approximation algorithms. J. Comput. Syst. Sci. 82(3): 503-520 (2016) - [i7]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondrej Suchý:
Fixed-Parameter Algorithms for DAG Partitioning. CoRR abs/1611.08809 (2016) - 2014
- [j6]Cristina Bazgan, Morgan Chopin
Parameterized Inapproximability of Target Set Selection and Generalizations. Comput. 3(2): 135-145 (2014) - [j5]Cristina Bazgan, Morgan Chopin
The complexity of finding harmless individuals in social networks. Discret. Optim. 14: 170-182 (2014) - [j4]Cristina Bazgan, Morgan Chopin
Parameterized complexity of firefighting. J. Comput. Syst. Sci. 80(7): 1285-1297 (2014) - [j3]Cristina Bazgan, Morgan Chopin
Parameterized approximability of maximizing the spread of influence in networks. J. Discrete Algorithms 27: 54-65 (2014) - [j2]Morgan Chopin
Constant Thresholds Can Make Target Set Selection Tractable. Theory Comput. Syst. 55(1): 61-83 (2014) - [c9]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. CiE 2014: 11-20 - [c8]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
Approximation Algorithms Inspired by Kernelization Methods. ISAAC 2014: 479-490 - [c7]Janka Chlebíková
The Firefighter Problem: A Structural Analysis. IPEC 2014: 172-183 - [c6]Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt:
Structural Parameterizations for Boxicity. WG 2014: 117-128 - [i6]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Inapproximability of Target Set Selection and Generalizations. CoRR abs/1403.3565 (2014) - [i5]Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau:
Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms. CoRR abs/1409.3742 (2014) - 2013
- [b1]Morgan Chopin
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). Paris Dauphine University, France, 2013 - [j1]Cristina Bazgan, Morgan Chopin
The firefighter problem with more than one firefighter on trees. Discret. Appl. Math. 161(7-8): 899-908 (2013) - [c5]René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner
Parameterized Complexity of DAG Partitioning. CIAC 2013: 49-60 - [c4]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Approximability of Maximizing the Spread of Influence in Networks. COCOON 2013: 543-554 - [i4]Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora:
Parameterized Approximability of Maximizing the Spread of Influence in Networks. CoRR abs/1303.6907 (2013) - [i3]Janka Chlebíková, Morgan Chopin:
The Firefighter Problem: A Structural Analysis. CoRR abs/1310.2322 (2013) - [i2]Janka Chlebíková, Morgan Chopin:
The Firefighter Problem: A Structural Analysis. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c3]Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller:
Constant Thresholds Can Make Target Set Selection Tractable. MedAlg 2012: 120-133 - [c2]Cristina Bazgan, Morgan Chopin:
The Robust Set Problem: Parameterized Complexity and Approximation. MFCS 2012: 136-147 - 2011
- [c1]Cristina Bazgan, Morgan Chopin, Michael R. Fellows
Parameterized Complexity of the Firefighter Problem. ISAAC 2011: 643-652 - [i1]Cristina Bazgan, Morgan Chopin, Bernard Ries:
The firefighter problem with more than one firefighter on trees. CoRR abs/1110.0341 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: