Related papers: About the Infinite Windy Firebreak Location proble…
In this paper we analyze a continuous version of the maximal covering location problem, in which the facilities are required to be interconnected by means of a graph structure in which two facilities are allowed to be linked if a given…
We study the two inference problems of detecting and recovering an isolated community of \emph{general} structure planted in a random graph. The detection problem is formalized as a hypothesis testing problem, where under the null…
The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…
With electric power infrastructure increasingly susceptible to impacts from climate-driven natural disasters, there is an increasing need for optimization algorithms that determine where to harden the power grid. Prior work has primarily…
A geometric model for the computation of the firefront of a forest wildfire which takes into account several effects (possibly time-dependent wind, anisotropies and slope of the ground) is introduced. It relies on a general theoretical…
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 to locate p shelters minimizing the maximum distance people…
One of the most important combinatorial optimization problems is graph coloring. There are several variations of this problem involving additional constraints either on vertices or edges. They constitute models for real applications, such…
In this study, we investigate the problem of classifying, characterizing, and designing efficient algorithms for hard inference problems on planar graphs, in the limit of infinite size. The problem is considered hard if, for a deterministic…
Given a planar graph $G$ and a partition of the neighbors of each vertex $v$ in four sets $UR(v)$, $UL(v)$, $DL(v)$, and $DR(v)$, the problem Windrose Planarity asks to decide whether $G$ admits a windrose-planar drawing, that is, a planar…
We consider a version of the forest fire model on graph $G$, where each vertex of a graph becomes occupied with rate one. A fixed vertex $v_0$ is hit by lightning with the same rate, and when this occurs, the whole cluster of occupied…
Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed graphs, the notion of matching forest was proposed as a…
Consider the following forest-fire process on a connected graph. Each site of the graph can be either occupied or vacant. A vacant site becomes occupied with rate 1. A site is ignited with rate lambda, and its whole occupied cluster burns…
We consider the constrained graph alignment problem which has applications in biological network analysis. Given two input graphs $G_1=(V_1,E_1), G_2=(V_2,E_2)$, a pair of vertex mappings induces an {\it edge conservation} if the vertex…
Geodesic models are known as an efficient tool for solving various image segmentation problems. Most of existing approaches only exploit local pointwise image features to track geodesic paths for delineating the objective boundaries.…
Wildfires ignited by the power lines have become increasingly common over the past decade. Enhancing the operational and financial resilience of power grids against wildfires involves a multifaceted approach. Key proactive measures include…
We consider the problem of learning the structure of undirected graphical models with bounded treewidth, within the maximum likelihood framework. This is an NP-hard problem and most approaches consider local search techniques. In this…
We consider two problems for a directed graph $G$, which we show to be closely related. The first one is to find $k$ edge-disjoint forests in $G$ of maximal size such that the indegree of each vertex in these forests is at most $k$. We…
Graph burning is a discrete-time process that models the spread of influence in a network. Vertices are either burning or unburned, and in each round, a burning vertex causes all of its neighbours to become burning before a new fire source…
We systematically study a natural problem in extremal graph theory, to minimize the number of edges in a graph with a fixed number of vertices, subject to a certain local condition: each vertex must be in a copy of a fixed graph $H$. We…
As wildfires in the United States are becoming more frequent and severe, mitigating wildfire ignition risk from power line faults is an increasingly crucial effort. Long-term ignition prevention strategies, especially converting overhead…