2 citations · 4 across the 10 of their papers we have counts for
10 papers
About the Infinite Windy Firebreak Location problem
Marc Demange, Alessia Di Fonso, Gabriele Di Stefano +1
The severity of wildfires can be mitigated adopting preventive measures like the construction of firebreaks that are strips of land from which the vegetation is completely removed.…
Orienteering problem with time-windows and updating delay
Marc Demange, David Ellison, Bertrand Jouve
The Orienteering Problem with Time Window and Delay (\OPTiWinD) is a variant of the online orienteering problem. A series of requests appear in various locations while a vehicle mo…
A graph theoretical approach to the firebreak locating problem
Marc Demange, Alessia Di Fonso, Gabriele Di Stefano +1
In the last decade, wildfires have become wider and more destructive. The climate change and the growth of urban areas may further increase the probability of incidence of large-sc…
Hardness and approximation of the Probabilistic p-Center problem under Pressure
Marc Demange, Marcel A. Haddad, Cécile Murat
The Probabilistic p-Center problem under Pressure (Min PpCP) is a variant of the usual p-Center problem we recently introduced in the context of wildfire management. The problem is…
Online Firefighting on Grids
Marc Demange, David Ellison, Raffaella Gentilini
The Firefighter Problem (FP) is a graph problem originally introduced in 1995 to model the spread of a fire in a graph, which has attracted considerable attention in the literature…
Firefighting on Trees
Pierre Coupechoux, Marc Demange, David Ellison +1
In the Firefighter problem, introduced by Hartnell in 1995, a fire spreads through a graph while a player chooses which vertices to protect in order to contain it. In this paper, w…
Improper Twin Edge Coloring of Graphs
Paniz Abedin, Saieed Akbari, Marc Demange +1
Let be a graph whose each component has order at least 3. Let for some integer be an improper edge coloring of (where adjacent…
Complexity of choosability with a small palette of colors
Marc Demange, Dominique de Werra
A graph is -choosable if, for any choice of lists of colors for each vertex, there is a list coloring, which is a coloring where each vertex receives a color from its…
Structure of conflict graphs in constraint alignment problems and algorithms
Ferhat Alkan, Türker Bıyıkoğlu, Marc Demange +1
We consider the constrained graph alignment problem which has applications in biological network analysis. Given two input graphs , a pair of vertex m…
Playing with parameters: structural parameterization in graphs
Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange +1
When considering a graph problem from a parameterized point of view, the parameter chosen is often the size of an optimal solution of this problem (the "standard" parameter). A nat…