The following pages link to Morgan Chopin (Q289933):
Displayed 18 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- The firefighter problem: further steps in understanding its complexity (Q527402) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- The firefighter problem with more than one firefighter on trees (Q1949095) (← links)
- Parameterized approximability of maximizing the spread of influence in networks (Q2250539) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- The complexity of finding harmless individuals in social networks (Q2339843) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- The Robust Set Problem: Parameterized Complexity and Approximation (Q2912715) (← links)
- Approximation Algorithms Inspired by Kernelization Methods (Q2942653) (← links)
- The Firefighter Problem: A Structural Analysis (Q2946017) (← links)
- Parameterized Complexity of the Firefighter Problem (Q3104666) (← links)
- Constant Thresholds Can Make Target Set Selection Tractable (Q4916038) (← links)
- Parameterized Complexity of DAG Partitioning (Q4924637) (← links)
- Parameterized Approximability of Maximizing the Spread of Influence in Networks (Q4925269) (← links)
- Parameterized Inapproximability of Target Set Selection and Generalizations (Q5175620) (← links)
- Parameterized Inapproximability of Target Set Selection and Generalizations (Q5175873) (← links)