#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2010

2017

- This year (0)
- Last 5 years (18)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Morgan Chopin, André Nichterlein, Rolf Niedermeier, Mathias Weller
- Theory of Computing Systems
- 2013

Target Set Selection, which is a prominent NP-hard problem occurring in social network analysis and distributed computing, is notoriously hard both in terms of achieving useful polynomial-time… (More)

- Janka Chlebíková, Morgan Chopin
- Electronic Colloquium on Computational Complexity
- 2013

We consider the complexity of the firefighter problem where b ≥ 1 firefighters are available at each time step. This problem is proved NP-complete even on trees of degree at most three and budget one… (More)

- Cristina Bazgan, Morgan Chopin, Marek Cygan, Michael R. Fellows, Fedor V. Fomin, Erik Jan van Leeuwen
- J. Comput. Syst. Sci.
- 2014

The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a firefighter may be… (More)

- Janka Chlebíková, Morgan Chopin
- Theor. Comput. Sci.
- 2017

Article history: Received 27 November 2015 Received in revised form 1 February 2017 Accepted 10 March 2017 Available online xxxx Communicated by F.V. Fomin

- Cristina Bazgan, Morgan Chopin, Michael R. Fellows
- ISAAC
- 2011

In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that Saving k-Vertices and its dual Saving All But k-Vertices are both W[1]-hard for parameter… (More)

- René van Bevern, Robert Bredereck, +4 authors Ondrej Suchý
- CIAC
- 2013

The goal of tracking the origin of short, distinctive phrases (memes) that propagate through the web in reaction to current events has been formalized as DAG Partitioning: given a directed acyclic… (More)

In this paper, we consider the problem of maximizing the spread of influence through a social network. This optimization problem is formally defined as follows. We are given a graph G = (V,E), a… (More)

- Morgan Chopin
- 2013

In this thesis, we investigate the computational complexity of optimization problems involving a “diffusion process” in a graph. More specifically, we are first interested to the target set selection… (More)

Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for… (More)