Skip to content

Morgan Chopin

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

13

Venues

11

Active years

2011–2026

Best venue rank

A*

Where they publish

Papers

13 indexed papers, newest first.

YearVenueTitleAuthors
2026WALCOMOn the Computational Complexity of Covering Multi-Interface Networks.Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer
2025CIACOn the Computational Complexity of Graph Reconstruction.Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer
2025INFOCOMParameterized Complexity of Segment Routing.Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Camille Richer
2023AAAIWarm-Starting Nested Rollout Policy Adaptation with Optimal Stopping.Chen Dang, Cristina Bazgan, Tristan Cazenave, Morgan Chopin, Pierre-Henri Wuillemin
2023CoDITUnsplittable Shortest Path Routing: Extended Model and Matheuristic.Amal Benhamiche, Morgan Chopin, Sbastien Martin
2023PAAMSA Multi-Agent Based Dynamic Network Slice Tarification Framework.Joshua Shakya, Morgan Chopin, Lela Merghem-Boulahia
2014CiEParameterized Inapproximability of Target Set Selection and Generalizations.Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Florian Sikora
2014ISAACApproximation Algorithms Inspired by Kernelization Methods.Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau
2014WGStructural Parameterizations for Boxicity.Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt
2013CIACParameterized Complexity of DAG Partitioning.Ren van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hffner, Andr Nichterlein, Ondrej Such
2013COCOONParameterized Approximability of Maximizing the Spread of Influence in Networks.Cristina Bazgan, Morgan Chopin, Andr Nichterlein, Florian Sikora
2012MFCSThe Robust Set Problem: Parameterized Complexity and Approximation.Cristina Bazgan, Morgan Chopin
2011ISAACParameterized Complexity of the Firefighter Problem.Cristina Bazgan, Morgan Chopin, Michael R. Fellows